Machbarkeitsstudie OÖ Kulturdatenbank

@techreport{RISC7178,
author = {J. Ablinger and A. Behring and J. Blümlein and A. De Freitas and A. von Manteuffel and C. Schneider and K. Schönwald},
title = {{The three-loop single-mass heavy-flavor corrections to the structure functions $F_2(x,Q^2)$ and $g_1(x,Q^2)$}},
language = {english},
abstract = {We report quantitative results on the single-mass heavy-flavor contributions up to three-loop order to the unpolarized structure function $F_2(x,Q^2)$ and the polarized structure function $g_1(x,Q^2)$ for the first time. These results are relevant for precision QCD analyses of the World deep-inelastic data and the data taken at future colliders, such as the Electron--Ion Collider, in order to measure the strong coupling constant $alpha_s(M_Z^2)$, and the twist-2 parton distribution functions consistently at next-to-next-to-leading order.},
number = {25-08},
year = {2025},
month = {September},
keywords = {single-mass heavy-flavor contributions, QCD, Feynman diagrams, computer algebra},
length = {6},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7181,
author = {J. Ablinger and A. Behring and J. Blümlein and d and A. De Freitas and A. von Manteuffel and C. Schneider and and K. Schönwald},
title = {{The Single-Mass Variable Flavor Number Scheme at Three-Loop Order}},
language = {english},
abstract = {The matching relations in the unpolarized and polarized variable flavor number scheme at three-loop order are presented in the single-mass case. They describe the process of massive quarks becoming light at large virtualities $Q^2$. In this framework, heavy-quark parton distributions can be defined. Numerical results are presented on the matching relations in the case of the single-mass variable flavor number scheme for the light parton, charm and bottom quark distributions. These relations are process independent. In the polarized case we generally work in the Larin scheme. To two-loop order we present the polarized massive OMEs also in the $overline{rm MS}$ scheme. Fast numerical codes for the single-mass massive operator matrix elements are provided. },
number = {25-04},
year = {2025},
month = {October},
note = {arXiv:2510.02175 [hep-ph]},
keywords = {QCD, Feynman diagrams, computer algebra},
length = {27},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7182,
author = {J. Ablinger and J. Bluemlein and A. De Freitas and A. von Manteuffel and C. Schneider and Kay Schoenwald},
title = {{The two-mass contributions to the three-loop massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$}},
language = {english},
abstract = {We calculate the two-mass three-loop contributions to the unpolarized and polarized massive operator matrix elements $tilde{A}_{Qg}^{(3)}$ and $Delta tilde{A}_{Qg}^{(3)}$ in $x$-space for a general mass ratio by using a semi-analytic approach. We also compute Mellin moments up to $N = 2000 (3000)$ by an independent method, to which we compare the results in $x$-space. In the polarized case, we work in the Larin scheme. We present numerical results. The two-mass contributions amount to about $50 %$ of the full textcolor{blue}{$O(T_F^2)$} and textcolor{blue}{$O(T_F^3)$} terms contributing to the operator matrix elements. The present result completes the calculation of all unpolarized and polarized massive three-loop operator matrix elements.},
number = {25-07},
year = {2025},
month = {November},
keywords = {operator matrix elements,3-loop massive Feynman diagrams, two masses, symbolic computation},
length = {50},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7141,
author = {Besik Dundua and Temur Kutsia},
title = {{Higher-Order Pattern Unification Modulo Similarity Relations}},
language = {english},
abstract = {The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient reasoning and computational techniques for such a combined formalism presents a significant challenge. In this paper, we adopt a more straightforward approach aiming at integrating two well-established and computationally well-behaving components: higher-order patterns on one side and fuzzy equivalences expressed through similarity relations based on minimum T-norm on the other. We propose a unification algorithm for higher-order patterns modulo these similarity relations and prove its termination, soundness, and completeness. This unification problem, like its crisp counterpart, is unitary. The algorithm computes the most general unifier with the highest degree of approximation when the given terms are unifiable.},
number = {25-03},
year = {2025},
month = {February},
keywords = {Unification, higher-order patterns, fuzzy similarity relations},
length = {20},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7134,
author = {Ralf Hemmecke and Peter Paule and Cristian-Silviu Radu},
title = {{Computer-assisted construction of Ramanujan-Sato series for 1 over pi}},
language = {english},
abstract = {Referring to ideasof Takeshi Sato, Yifan Yang in~cite{YangDE} described a construction ofseries for $1$ over $pi$ startingwith a pair $(g,h)$, where $g$ is a modular formof weight $2$ and $h$ is a modular function; i.e.,a modular form of weight zero. In this article we present an algorithmicversion,called ``Sato construction''. Series for $1/pi$ obtained this way will becalled ``Ramanujan-Sato''series. Famous series fit into this definition, for instance, Ramanujan'sseries used by Gosperand the series used by the Chudnovsky brothersfor computing millions of digits of $pi$. Weshow that these series are induced by membersof infinite families of Sato triples $(N, gamma_N,tau_N)$ where $N>1$ is an integer and $gamma_N$ a $2times 2$ matrixsatisfying $gamma_N tau_N=N tau_N$ for$tau_N$ being an element from the upper half of thecomplex plane.In addition to procedures for guessingand proving from the holonomic toolbox togetherwiththe algorithm ``ModFormDE'', as describedin~cite{PPSR:ModFormDE1}, a central roleis played by the algorithm ``MultiSamba'',an extension ofSamba (``subalgebra module basis algorithm'') originating fromcite{Radu_RamanujanKolberg_2015} and cite{Hemmecke}.With thehelp of MultiSamba one canfind and prove evaluations of modular functions,at imaginary quadratic points, in terms of nested algebraic expressions.As a consequence,all the series for $1/pi$ constructed withthe help of MultiSamba are proven completelyin a rigorous non-numerical manner.},
number = {25-01},
year = {2025},
month = {January},
keywords = {modular forms and functions, holonomic differential equations, Ramanujan-Sato series for 1 over pi, MultiSamba algorithm},
length = {58},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7151,
author = {S. Chen and Y. Gao and H. Huang and C. Schneider},
title = {{Telescoping Algorithms for $Sigma^*$-Extensions via Complete Reductions}},
language = {english},
abstract = {A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such thatthe given element is summable if and only if the remainder is equal to zero.In this paper, we present a complete reduction in a tower of $Sigma^*$-extensions that turns to a new efficient framework for the parameterized telescoping problem. Special instances of such $Sigma^*$-extensions cover iterative sums such as the harmonic numbers and generalized versions that arise, e.g., in combinatorics, computer science or particle physics. Moreover, we illustrate how these new ideas can be used to reduce the depth of the given sum and provide structural theorems that connect complete reductions to Karr's Fundamental Theorem of symbolic summation.},
number = {25-05},
year = {2025},
month = {June},
note = {arXiv:2506.08767 [cs.SC]},
keywords = {symbolic summation, difference fields, complete reductions, paramaterized telescoping},
length = {35},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7136,
author = {Wolfgang Schreiner and William Steingartner},
title = {{Semantics-Based Rapid Prototyping of a Subset of SQL}},
language = {english},
abstract = {This report documents the application of our semantics-based language generator SLANG to developing a rapid prototype of a non-trivial domain-specific language, a substantial subset of the Structured Query Language SQL that we have named SubSQL. After developing a mathematical/logical formulation of the language’s abstract syntax, formal type system, and denotational semantics, we have translated this formulation into a SLANG specification from which the SLANG software generates Java code that implements a parser, a printer, a type-checker, and an executor of the language. This implementation is based on several manually created Java classes that implement the mathematical domains and operations used in the formalization, a simple persistent database, and a high-level application programming interface that allows to execute complete SubSQL scripts from file or individual SubSQL commands within Java programs. The results represent a blueprint for the semantics-based development of other domain-specific languages of similar complexity.},
number = {25-02},
year = {2025},
month = {February},
keywords = {formal semantics of programming languages, domain specific languages, rapid prototyping, interpreters},
sponsor = {Aktion Österreich–Slowakei project 2024-05-15-001, KEGA project 030TUKE-4/2023},
length = {179},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}

@techreport{RISC7153,
author = {Jack Heseltine},
title = {{Theorema Project: Document Processing}},
language = {english},
abstract = {This work explores the Wolfram Language as a Software Engineering tool, with a particular focus on the Theorema mathematical software package, in combination with the LATEX typesetting system. It delves into the advanced functionalities and paradigms of Wolfram Language, including high-level programming, functional programming, and pattern matching, to showcase these capabilities beyond object oriented programming languages in particular, as applied to mathematical document transformation. Through Theorema, package development using Wolfram Language is demonstrated from conception through execution to the point that the new package can be easily integrated with the existing Theorema system: the associated analysis touches on the workings of Theorema but the focus is on an implementational bridge between computational mathematics and document preparation, aiming to provide easy extensibility and delivering on further Software Engineering principles to make for a rounded Wolfram Language and Theorema package, as the final project output.The thesis also addresses the challenges and methodologies associated with the LATEX typesetting of mathematical content, emphasizing the transformation of Wolfram Language/Theorema notebooks using a Wolfram-Language-native approach. This includes an examination of first-order predicate logic symbols, to ensure coverage at the output side, and the role of (mathematical) expressions in Wolfram Language, the input side, showcasing back-and-forth between typesetting and (symbolic) computational languages, and particularly, recursive parsing of entire notebook expressions as the basic working principle in this approach.},
number = {25-06},
year = {2025},
month = {March 02},
note = {Bachelor Thesis at University of Applied Sciences Hagenberg, bachelor program Software Engineering},
keywords = {Theorema, LaTeX},
length = {76},
license = {CC BY 4.0 International},
type = {RISC Report Series},
institution = {Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz},
address = {Altenberger Straße 69, 4040 Linz, Austria},
issn = {2791-4267 (online)}
}