RISC Reports Series

2023

[Schneider]

Refined telescoping algorithms in $R\Pi\Sigma$-extensions to reduce the degrees of the denominators

C. Schneider

Technical report no. 23-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2023. arXiv:2302.03563 [cs.SC]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6682,
author = {C. Schneider},
title = {{Refined telescoping algorithms in $R\Pi\Sigma$-extensions to reduce the degrees of the denominators}},
language = {english},
abstract = {We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The underlying (parameterized) telescoping algorithms can be executed in $R\Pi\Sigma$-ring extensions that are built over general $\Pi\Sigma$-fields. An important application of this toolbox is the simplification of d'Alembertian and Liouvillian solutions coming from recurrence relations where the denominators of the arising sums do not factor nicely.},
number = {23-01},
year = {2023},
month = {February},
note = {arXiv:2302.03563 [cs.SC]},
keywords = {telescoping, difference rings, reduced denominators, nested sums},
length = {18},
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)}
}
[Dominici]

Linear functionals and $Delta$- coherent pairs of the second kind

Diego Dominici and Francisco Marcellan

Technical report no. 23-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6677,
author = {Diego Dominici and Francisco Marcellan},
title = {{Linear functionals and $Delta$- coherent pairs of the second kind}},
language = {english},
abstract = {We classify all the emph{$Delta$-}coherent pairs of measures of the secondkind on the real line. We obtain $5$ cases, corresponding to all the familiesof discrete semiclassical orthogonal polynomials of class $sleq1.$},
number = {23-02},
year = {2023},
month = {February},
keywords = { Discrete orthogonal polynomials, discrete semiclassical functionals, discrete Sobolev inner products, coherent pairs of discrete measures, coherent pairs of second kind for discrete measures.},
length = {24},
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)}
}
[Kauers]

Order bounds for $C^2$-finite sequences

M. Kauers, P. Nuspl, V. Pillwein

Technical report no. 23-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6683,
author = {M. Kauers and P. Nuspl and V. Pillwein},
title = {{Order bounds for $C^2$-finite sequences}},
language = {english},
abstract = {A sequence is called $C$-finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with $C$-finite coefficients. Recently, it was shown that such $C^2$-finite sequences satisfy similar closure properties as $C$-finite sequences. In particular, they form a difference ring. In this paper we present new techniques for performing these closure properties of $C^2$-finite sequences. These methods also allow us to derive order bounds which were not known before. Additionally, they provide more insight in the effectiveness of these computations. The results are based on the exponent lattice of algebraic numbers. We present an iterative algorithm which can be used to compute bases of such lattices.},
number = {23-03},
year = {2023},
month = {February},
keywords = {Difference equations, holonomic sequences, closure properties, algorithms},
length = {16},
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)}
}
[Buchberger]

Is ChatGPT Smarter Than Master’s Applicants?

Bruno Buchberger

Technical report no. 23-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). January 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6684,
author = {Bruno Buchberger},
title = {{Is ChatGPT Smarter Than Master’s Applicants?}},
language = {English},
abstract = {During the selection procedure for a particular informatics fellowship program sponsored by Upper Austrian companies, I ask the applicants a couple of simple technical questions about programming, etc., in a Zoom meeting. I put the same questions to the dialogue system ChatGPT, [ChatGPT]. The result surprised me: Nearly all answers of ChatGPT were totally correct and nicely explained. Also, in the dialogues to clarify some critical points in the answers, the explanations by ChatGPT were amazingly clear and goal-oriented.In comparison: I tried out the same questions in the personal Zoom interviews with approximately 30 applicants from five countries. Only the top three candidates (with a GPA of 1.0, i.e., the highest possible GPA in their bachelor’s study) performed approximately equally well in the interview. All the others performed (far) worse than ChatGPT. And, of course, all answers from ChatGPT came within 1 to 10 seconds, whereas most of the human applicants' answers needed lengthy and arduous dialogues.I am particularly impressed by the ability of ChatGPT to extract meaningful and well-structured programs from problem specifications in natural language. In this experiment, I also added some questions that ask for proofs for simple statements in natural language, which I do not ask in the student's interviews. The performance of ChatGPT was quite impressive as far as formalization and propositional logic are concerned. In examples where predicate logic reasoning is necessary, the ChatGPT answers are not (yet?) perfect. I am pleased to see that ChatGPT tries to present the proofs in a “natural style” This is something that I had as one of my main goals when I initiated the Theorema project in 1995. I think we already achieved this in the early stage of Theorema, and we performed this slightly better and more systematically than ChatGPT does.I also tried to develop a natural language input facility for Theorema in 2017, i.e., a tool to formalize natural language statements in predicate logic. However, I could not continue this research for a couple of reasons. Now I see that ChatGPT achieved this goal. Thus, I think that the following combination of methods could result in a significant leap forward:- the “natural style” proving methods that we developed within Theorema (for the automated generation of programs from specifications, the automated verification of programs in the frame of knowledge, and the automated proof of theorems in theories), in particular, my “Lazy Thinking Method” for algorithm synthesis from specifications- and the natural language formalization techniques of ChatGPT.I propose this as a research project topic and invite colleagues and students to contact me and join me in this effort: Buchberger.bruno@gmail.com.},
number = {23-04},
year = {2023},
month = {January},
keywords = {ChatGPT, automated programming, program synthesis, automated proving, formalization of natural language, master's screening},
length = {30},
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)}
}
[Dominici]

Recurrence relations for the moments of discrete semiclassical functionals of class $sleq2.$

Diego Dominici

Technical report no. 23-05 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). March 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6687,
author = {Diego Dominici },
title = {{Recurrence relations for the moments of discrete semiclassical functionals of class $sleq2.$}},
language = {english},
abstract = {We study recurrence relations satisfied by the moments $lambda_{n}left(zright) $ of discrete linear functionals whose first moment satisfies aholonomic differential equation. We consider all cases when the order of theODE is less or equal than $3$.},
number = {23-05},
year = {2023},
month = {March},
keywords = {Discrete orthogonal polynomials, discrete semiclassical functionals, moments.},
length = {81},
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)}
}
[STUDENT]

Formalisation of Relational Algebra and a SQL-like Language with the RISCAL Model Checker

Joachim Borya

Technical report no. 23-06 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). May 2023. Bachelor thesis. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6706,
author = {Joachim Borya},
title = {{Formalisation of Relational Algebra and a SQL-like Language with the RISCAL Model Checker}},
language = {english},
abstract = {The relational database model is based on the mathematical concept of relational algebra.Query languages have been developed to make data available quickly without creatingdedicated access procedures that depend on the internal representation of the data. SQL(structured query language) can be seen as a quasi-standard for this. This thesis dealswith the formalization and verification of relational algebra and a small but elementarysubset of SQL with the help of the RISCAL model checker, a software tool for the formalspecification and verification of mathematical theories and algorithms.},
number = {23-06},
year = {2023},
month = {May},
keywords = {formal methods, program verification, model checking, automated theorem proving},
length = {77},
type = {Bachelor thesis},
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)}
}
[STUDENT]

Model Checking Concurrent Systems Under Fairness Constraints in RISCAL

Ágoston Sütő

Technical report no. 23-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). May 2023. Master's thesis. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6708,
author = {Ágoston Sütő},
title = {{Model Checking Concurrent Systems Under Fairness Constraints in RISCAL}},
language = {english},
abstract = {Model checking is a method for verifying that a program satisfies certain desirable properties formalised using mathematical logic. It is a rigorous method, similar to theorem proving, but it is generally applied when theorem proving would be too difficult due to the complexity of the algorithm, such as in concurrent systems. Model checking is used in the software industry. RISCAL (RISC Algorithm Language) is a language and software system that can be used to describe algorithms over a finite domain, specify their behaviour and then validate the specification. While it mainly focuses on deterministic algorithms, it has limited support for non-deterministic systems as well.The thesis extends the support for non-deterministic systems in RISCAL by allowing the user to specify complex properties about their behaviour in the language of Linear Temporal Logic (LTL) and then to validate them. The core contribution is a model checker implemented in Java using the so-called automaton-based explicit state model checking approach. The software is capable of verifying certain properties that could not be handled by a well-known model checker used in the industry. While in most cases it has underperformed its competitors, our implementation is promising, especially when it comes to properties with certain side conditions, called fairness constraints. The majority of the thesis is be concerned with the theoretical aspects of the automaton-based model checking approach, which is followed by a description of the implementation and various benchmarks.},
number = {23-07},
year = {2023},
month = {May},
keywords = {formal methods, model checking, concurrent systems, nondeterminism, linear temporal logic},
sponsor = {Supported by Aktion Österreich–Slowakei project grant Nr. 2019-10-15-003 “Semantic Modeling of Component-Based Program Systems”},
length = {102},
type = {Master's thesis},
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)}
}
[de Freitas]

Analytic results on the massive three-loop form factors: quarkonic contributions

J. Bluemlein, A. De Freitas, P. Marquard, N. Rana, C. Schneider

Technical report no. 23-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). July 2023. arXiv:2307.02983 [hep-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6716,
author = {J. Bluemlein and A. De Freitas and P. Marquard and N. Rana and C. Schneider},
title = {{Analytic results on the massive three-loop form factors: quarkonic contributions}},
language = {english},
abstract = {The quarkonic contributions to the three--loop heavy-quark form factors for vector, axial-vector, scalar and pseudoscalar currents are described by closed form difference equations for the expansion coefficients in the limit of small virtualities $q^2/m^2$. A part of the contributions can be solved analytically and expressed in terms of harmonic and cyclotomic harmonic polylogarithms and square-root valued iterated integrals. Other contributions obey equations which are not first--order factorizable. For them still infinite series expansions around the singularities of the form factors can be obtained by matching the expansions at intermediate points and using differential equations which are obeyed directly by the form factors and are derived by guessing algorithms. One may determine all expansion coefficients for $q^2/m^2 rightarrow infty$ analytically in terms of multiple zeta values. By expanding around the threshold and pseudo--threshold, the corresponding constants are multiple zeta values supplemented by a finite amount of new constants, which can be computed at high precision. For a part of these coefficients, the infinite series in front of these constants may be even resummed into harmonic polylogarithms. In this way, one obtains a deeper analytic description of the massive form factors, beyond their pure numerical evaluation. The calculations of these analytic results are based on sophisticated computer algebra techniques. We also compare our results with numerical results in the literature.},
number = {23-08},
year = {2023},
month = {July},
note = {arXiv:2307.02983 [hep-ph]},
keywords = {form factor, Feynman diagram, computer algebra, holonomic properties, difference equations, differential equations, symbolic summation, numerical matching, analytic continuation, guessing, PSLQ},
length = {92},
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)}
}
[de Freitas]

Recent 3-Loop Heavy Flavor Corrections to Deep-Inelastic Scattering

J. Ablinger, A. Behring, J. Bluemlein, A. De Freitas, A. Goedicke, A. von Manteuffel, C. Schneider, K. Schoenwald

Technical report no. 23-09 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). June 2023. arXiv:2306.16550 [hep-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6714,
author = {J. Ablinger and A. Behring and J. Bluemlein and A. De Freitas and A. Goedicke and A. von Manteuffel and C. Schneider and K. Schoenwald},
title = {{Recent 3-Loop Heavy Flavor Corrections to Deep-Inelastic Scattering}},
language = {english},
abstract = {We report on recent progress in calculating the three loop QCD corrections of the heavy flavor contributions in deep--inelastic scattering and the massive operator matrix elements of the variable flavor number scheme. Notably we deal with the operator matrix elements $A_{gg,Q}^{(3)}$ and $A_{Qg}^{(3)}$ and technical steps to their calculation. In particular, a new method to obtain the inverse Mellin transform without computing the corresponding $N$--space expressions is discussed.},
number = {23-09},
year = {2023},
month = {June},
note = {arXiv:2306.16550 [hep-ph]},
keywords = {deep-inelastic scattering, 3-loop Feynman diagrams, (inverse) Mellin transform, binomial sums},
length = {7},
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)}
}
[Banerjee]

2-Elongated Plane Partitions and Powers of 7: The Localization Method Applied to a Genus 1 Congruence Family

K. Banerjee, N.A. Smoot

Technical report no. 23-10 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). August 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6713,
author = {K. Banerjee and N.A. Smoot},
title = {{2-Elongated Plane Partitions and Powers of 7: The Localization Method Applied to a Genus 1 Congruence Family}},
language = {english},
abstract = {Over the last century, a large variety of infinite congruence families have been discovered and studied, exhibiting a great variety with respect to their difficulty. Major complicating factors arise from the topology of the associated modular curve: classical techniques are sufficient when the associated curve has cusp count 2 and genus 0. Recent work has led to new techniques that have proven useful when the associated curve has cusp count greater than 2 and genus 0. We show here that these techniques may be adapted in the case of positive genus. In particular, we examine a congruence family over the 2-elongated plane partition diamond counting function $d_2(n)$ by powers of 7, for which the associated modular curve has cusp count 4 and genus 1. We compare our method with other techniques for proving genus 1 congruence families, and present a second congruence family by powers of 7 which we conjecture, and which may be amenable to similar techniques.},
number = {23-10},
year = {2023},
month = {August},
keywords = {Partition congruences, infinite congruence family, modular functions, plane partitions, partition analysis, modular curve, Riemann surface},
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)}
}
[Schneider]

Computing Mellin representations and asymptotics of nested binomial sums in a symbolic way: the RICA package

Johannes Bluemlein, Nikolai Fadeev, Carsten Schneider

Technical report no. 23-11 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). August 2023. Appeared in ACM Communications in Computer Algebra, Vol. 57, No. 2, Issue 224, June 2023, arXiv:2308.06042 [hep-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6739,
author = {Johannes Bluemlein and Nikolai Fadeev and Carsten Schneider},
title = {{Computing Mellin representations and asymptotics of nested binomial sums in a symbolic way: the RICA package}},
language = {english},
abstract = {Nested binomial sums form a particular class of sums that arise in the context of particle physics computations at higher orders in perturbation theory within QCD and QED, but that are also mathematically relevant, e.g., in combinatorics. We present the package RICA (Rule Induced Convolutions for Asymptotics), which aims at calculating Mellin representations and asymptotic expansions at infinity of those objects. These representations are of particular interest to perform analytic continuations of such sums. },
number = {23-11},
year = {2023},
month = {August},
note = {Appeared in ACM Communications in Computer Algebra, Vol. 57, No. 2, Issue 224, June 2023, arXiv:2308.06042 [hep-ph]},
keywords = {Mellin transform, asymptotic expansions, nested sums, nested integrals, computer algebra},
length = {4},
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)}
}
[Schreiner]

The SLANG Semantics-Based Language Generator

Wolfgang Schreiner, William Steingartner

Technical report no. 23-13 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). September 2023. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6749,
author = {Wolfgang Schreiner and William Steingartner},
title = {{The SLANG Semantics-Based Language Generator}},
language = {english},
abstract = {This report documents the SLANG semantics-based language generator. SLANG is a software for generating rapid prototype implementations of programming languages from their formal specifications. Its input is a text file that describes the abstract syntax of a language and its concrete text representation; from this, a parser is generated (utilizing the ANTLR4 tool) that transforms the text representation of a program into its abstract syntax tree and a printer that generates from the abstract syntax tree its text representation. Furthermore, one can equip the language with a formal type system (by logical inference rules) from which a type checker is generated. Finally, one can give the language a formal semantics, in the denotational style (by function equations) and/or in the big-step operational style (by transition steps); from this, a language interpreter is generated. SLANG is implemented in Java and produces Java source code; it should be easy to extend the software also to other target languages.},
number = {23-13},
year = {2023},
month = {September},
keywords = {formal semantics of programming languages, denotational semantics, operational semantics, type systems, interpreters},
sponsor = {Supported by the Slovak Academic Information Agency SAIA project 2023-03-15-001 “Semantics-Based Rapid Prototyping of Domain-Specific Languages”},
length = {59},
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)}
}

2022

[Schneider]

The Two-Loop Massless Off-Shell QCD Operator Matrix Elements to Finite Terms

J. Blümlein, P. Marquard, C. Schneider, K. Schönwald

Technical report no. 22-01 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6487,
author = {J. Blümlein and P. Marquard and C. Schneider and K. Schönwald},
title = {{The Two-Loop Massless Off-Shell QCD Operator Matrix Elements to Finite Terms}},
language = {english},
abstract = {We calculate the unpolarized and polarized two--loop massless off--shell operator matrix elements in QCD to $O(ep)$ in the dimensional parameter in an automated way. Here we use the method of arbitrary high Mellin moments and difference ring theory, based on integration-by-parts relations. This method also constitutes one way to compute the QCD anomalous dimensions. The presented higher order contributions to these operator matrix elements occur as building blocks in the corresponding higher order calculations upto four--loop order. All contributing quantities can be expressed in terms of harmonic sums in Mellin--$N$ space or by harmonic polylogarithms in $z$--space. We also perform comparisons to the literature. },
number = {22-01},
year = {2022},
month = {February},
keywords = {QCD, Operator Matrix Element, 2-loop Feynman diagrams, computer algebra, large moment method},
length = {101},
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)}
}
[Nuspl]

Simple $C^2$-finite Sequences: a Computable Generalization of $C$-finite Sequences

P. Nuspl, V. Pillwein

Technical report no. 22-02 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). February 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6479,
author = {P. Nuspl and V. Pillwein},
title = {{Simple $C^2$-finite Sequences: a Computable Generalization of $C$-finite Sequences}},
language = {english},
abstract = {The class of $C^2$-finite sequences is a natural generalization of holonomic sequences and consists of sequences satisfying a linear recurrence with C-finite coefficients, i.e., coefficients satisfying a linear recurrence with constant coefficients themselves. Recently, we investigated computational properties of $C^2$-finite sequences: we showed that these sequences form a difference ring and provided methods to compute in this ring.From an algorithmic point of view, some of these results were not as far reaching as we hoped for. In this paper, we define the class of simple $C^2$-finite sequences and show that it satisfies the same computational properties, but does not share the same technical issues. In particular, we are able to derive bounds for the asymptotic behavior, can compute closure properties more efficiently, and have a characterization via the generating function.},
number = {22-02},
year = {2022},
month = {February},
keywords = {difference equations, holonomic sequences, closure properties, generating functions, algorithms},
length = {16},
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)}
}
[Schneider]

The SAGEX Review on Scattering Amplitudes, Chapter 4: Multi-loop Feynman Integrals

J. Blümlein, C. Schneider

Technical report no. 22-03 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). March 2022. arXiv:2203.13015 [hep-th]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6495,
author = {J. Blümlein and C. Schneider},
title = {{The SAGEX Review on Scattering Amplitudes, Chapter 4: Multi-loop Feynman Integrals}},
language = {english},
abstract = {The analytic integration and simplification of multi-loop Feynman integrals to special functions and constants plays an important role to perform higher order perturbative calculations in the Standard Model of elementary particles. In this survey article the most recent and relevant computer algebra and special function algorithms are presented that are currently used or that may play an important role to perform such challenging precision calculations in the future. They are discussed in the context of analytic zero, single and double scale calculations in the Quantum Field Theories of the Standard Model and effective field theories, also with classical applications. These calculations play a central role in the analysis of precision measurements at present and future colliders to obtain ultimate information for fundamental physics.},
number = {22-03},
year = {2022},
month = {March},
note = {arXiv:2203.13015 [hep-th]},
keywords = {Feynman integrals, computer algebra, special functions, linear differential equations, linear difference integrals},
length = {40},
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)}
}
[Pau]

A framework for approximate generalization in quantitative theories

Temur Kutsia, Cleo Pau

Technical report no. 22-04 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). May 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6505,
author = {Temur Kutsia and Cleo Pau},
title = {{A framework for approximate generalization in quantitative theories}},
language = {english},
abstract = {Anti-unification aims at computing generalizations for given terms, retaining their common structure and abstracting differences by variables. We study quantitative anti-unification where the notion of the common structure is relaxed into "proximal'' up to the given degree with respect to the given fuzzy proximity relation. Proximal symbols may have different names and arities. We develop a generic set of rules for computing minimal complete sets of approximate generalizations and study their properties. Depending on the characterizations of proximities between symbols and the desired forms of solutions, these rules give rise to different versions of concrete algorithms.},
number = {22-04},
year = {2022},
month = {May},
keywords = {Generalization, anti-unification, quantiative theories, fuzzy proximity relations},
length = {22},
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)}
}
[Nuspl]

A comparison of algorithms for proving positivity of linearly recurrent sequences

P. Nuspl, V. Pillwein

Technical report no. 22-05 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). May 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6514,
author = {P. Nuspl and V. Pillwein},
title = {{A comparison of algorithms for proving positivity of linearly recurrent sequences}},
language = {english},
abstract = {Deciding positivity for recursively defined sequences based on only the recursive description as input is usually a non-trivial task. Even in the case of $C$-finite sequences, i.e., sequences satisfying a linear recurrence with constant coefficients, this is only known to be decidable for orders up to five. In this paper, we discuss several methods for proving positivity of $C$-finite sequences and compare their effectiveness on input from the Online Encyclopedia of Integer Sequences (OEIS).},
number = {22-05},
year = {2022},
month = {May},
keywords = {Difference equations Inequalities Holonomic sequences},
length = {17},
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)}
}
[Nuspl]

$C$-finite and $C^2$-finite Sequences in SageMath

P. Nuspl

Technical report no. 22-06 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). June 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6516,
author = {P. Nuspl},
title = {{$C$-finite and $C^2$-finite Sequences in SageMath}},
language = {english},
abstract = {We present the SageMath package rec_sequences which provides methods to compute with sequences satisfying linear recurrences. The package can be used to show inequalities of $C$-finite sequences, i.e., sequences satisfying a linear recurrence relation with constant coefficients. Furthermore, it provides functionality to compute in the $C^2$-finite sequence ring, i.e., to compute closure properties of sequences satisfying a linear recurrence with $C$-finite coefficients.},
number = {22-06},
year = {2022},
month = {June},
keywords = {Difference equations, Closure properties, Inequalities},
length = {4},
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)}
}
[Schreiner]

The RISCTP Theorem Proving Interface - Tutorial and Reference Manual (Version 1.0.*)

Wolfgang Schreiner

Technical report no. 22-07 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). June 2022. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6517,
author = {Wolfgang Schreiner},
title = {{The RISCTP Theorem Proving Interface - Tutorial and Reference Manual (Version 1.0.*)}},
language = {english},
abstract = {This report documents the RISCTP theorem proving interface. RISCTP consists of alanguage for specifying proof problems and of an associated software for solving theseproblems. The RISCTP language is a typed variant of first-order logic whose level ofabstraction is between that of higher level formal specification languages (such as thelanguage of the RISCAL model checker) and lower level theorem proving languages (such asthe language SMT-LIB supported by various satisfiability modulo theories solvers such as Z3).Thus the RISCTP language can serve as an intermediate layer that simplifies the connectionof specification and verification systems to theorem provers; in fact, it was developed toequip the RISCAL model checker with theorem proving capabilities. The RISCTP softwareis implemented in Java with an API that enables the implementation of such connections;however, RISCTP also provides a text-based frontend that allows its use as a theorem proveron its own. RISCTP already implements a backend that translates a proving problem intoSMT-LIB and solves it by the "black box" application of Z3; in the future, RISCTP shall alsoprovide built-in proving capabilities with greater transparency.},
number = {22-07},
year = {2022},
month = {June},
keywords = {automated reasoning, theorem proving, model checking, first-order logic, RISCAL, SMT-LIB, Z3},
length = {31},
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)}
}
[Schneider]

Computer Algebra and Hypergeometric Structures for Feynman Integrals

J. Bluemlein, M. Saragnese, C. Schneider

Technical report no. 22-08 in RISC Report Series, Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, Austria. ISSN 2791-4267 (online). July 2022. arXiv:2207.08524 [math-ph]. Licensed under CC BY 4.0 International. [doi] [pdf]
[bib]
@techreport{RISC6524,
author = {J. Bluemlein and M. Saragnese and C. Schneider},
title = {{Computer Algebra and Hypergeometric Structures for Feynman Integrals}},
language = {english},
abstract = {We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by hypergeometric products and more generally by indefinite nested sums defined over such products. Special cases are hypergeometric structures such as Appell-functions or generalizations of them that arise frequently when dealing with parameter Feynman integrals.},
number = {22-08},
year = {2022},
month = {July},
note = { arXiv:2207.08524 [math-ph]},
keywords = {hypergeometric series, Appell-series, symbolic summation, coupled systems, partial linear difference equations},
length = {11},
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)}
}

Loading…