arXiv subjects

Carsten Schneider

Publications and source records attributed to Carsten Schneider.

At least 19 recordsLinked to original sources

arXiv2026

The Ramanujan Challenge For AI

To help evaluate the mathematical skills of current AI systems, we present a set of formulas for fundamental mathematical constants. These problems are attractive for AI evaluation because they are concrete and can be checked numerically to arbitrary precision, yet proving them may require non-obvious mathematics. Mathematical constants such as $π$, $e$, Catalan's constant, and special values of the Riemann zeta function have fascinated mathematicians for centuries. The search for formulas evaluating mathematical constants has produced some of the most beautiful mathematics in the field, especially in cases that yield irrationality proofs or fast convergence rates. Ramanujan's legacy is emblematic of this tradition. The list we provide contains two types of problems: formulas whose proofs are known to the authors but will remain encrypted for a short initial period; and formulas that are not yet proven. We are curious to see the achievements of AI in both cases.

math.HO↗

arXiv2025

Telescoping Algorithms for $Σ^*$-Extensions via Complete Reductions

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 that the 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 $Σ^*$-extensions that turns to a new efficient framework for the parameterized telescoping problem. Special instances of such $Σ^*$-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.

cs.SC↗

arXiv2024

Asymptotics for the reciprocal and shifted quotient of the partition function

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition function, namely $p(n+k)/p(n)$ with $k\in \mathbb{N}$, which generalizes a result of Gomez, Males, and Rolen. In order to do so, we derive asymptotic expansions with error bounds for the shifted version $p(n+k)$ and the multiplicative inverse $1/p(n)$, which is of independent interest.

math.NT↗

arXiv2024

Creative Telescoping for Hypergeometric Double Sums

We present efficient methods for calculating linear recurrences of hypergeometric double sums and, more generally, of multiple sums. In particular, we supplement this approach with the algorithmic theory of contiguous relations, which guarantees the applicability of our method for many input sums. In addition, we elaborate new techniques to optimize the underlying key task of our method to compute rational solutions of parameterized linear recurrences.

cs.SC↗

arXiv2023

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

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.

hep-ph↗

arXiv2023

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

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 \to \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.

hep-ph↗

arXiv2023

Refined telescoping algorithms in $RΠΣ$-extensions to reduce the degrees of the denominators

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ΠΣ$-ring extensions that are built over general $ΠΣ$-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.

cs.SC↗

arXiv2023

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

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.

hep-th↗

arXiv2023

The SAGEX Review on Scattering Amplitudes

This is an introduction to, and invitation to read, a series of review articles on scattering amplitudes in gauge theory, gravity, and superstring theory. Our aim is to provide an overview of the field, from basic aspects to a selection of current (2022) research and developments.

hep-th↗

arXiv2022

Error bounds for the asymptotic expansion of the partition function

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion for $p(n)$ with an explicit error bound is not known. Recently O'Sullivan studied the asymptotic expansion of $p^{k}(n)$-partitions into $k$th powers, initiated by Wright, and consequently obtained an asymptotic expansion for $p(n)$ along with a concise description of the coefficients involved in the expansion but without any estimation of the error term. Here we consider a detailed and comprehensive analysis on an estimation of the error term obtained by truncating the asymptotic expansion for $p(n)$ at any positive integer $n$. This gives rise to an infinite family of inequalities for $p(n)$ which finally answers to a question proposed by Chen. Our error term estimation predominantly relies on applications of algorithmic methods from symbolic summation.

math.NT↗

arXiv2022

Computer Algebra and Hypergeometric Structures for Feynman Integrals

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.

math-ph↗

arXiv2021

Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

A general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and the formal difference ring setting. In particular, canonical (unique) representations and their refinements in the introduced term algebra are explored by utilizing the available difference ring theory. Based on that, precise input-output specifications of the available tools of the summation package Sigma are provided.

cs.SC↗

arXiv2021

Solving linear difference equations with coefficients in rings with idempotent representations

We introduce a general reduction strategy that enables one to search for solutions of parameterized linear difference equations in difference rings. Here we assume that the ring itself can be decomposed by a direct sum of integral domains (using idempotent elements) that enjoys certain technical features and that the coefficients of the difference equation are not degenerated. Using this mechanism we can reduce the problem to find solutions in a ring (with zero-divisors) to search solutions in several copies of integral domains. Utilizing existing solvers in this integral domain setting, we obtain a general solver where the components of the linear difference equations and the solutions can be taken from difference rings that are built e.g., by $RΠΣ$-extensions over $ΠΣ$-fields. This class of difference rings contains, e.g., nested sums and products, products over roots of unity and nested sums defined over such objects.

cs.SC↗

arXiv2021

On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in $Π\mathbfΣ^*$-field extensions

We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $ΠΣ^*$-fields. More generally, we provide a flexible framework for a big class of difference fields that is built by a tower of $ΠΣ^*$-field extensions over a difference field that satisfies certain algorithmic properties. As a consequence one can compute all solutions in terms of indefinite nested sums and products that arise within the components of a parameterized linear difference equation, and one can find all hypergeometric solutions that are defined over the arising sums and products of a homogeneous linear difference equation.

cs.SC↗

arXiv2020

Evaluation of binomial double sums involving absolute values

We show that double sums of the form $$ \sum_{i,j=-n} ^{n} |i^sj^t(i^k-j^k)^β| \binom {2n} {n+i} \binom {2n} {n+j} $$ can always be expressed in terms of a linear combination of just four functions, namely $\binom {4n}{2n}$, ${\binom {2n}n}^2$, $4^n\binom {2n}n$, and $16^n$, with coefficients that are rational in $n$. We provide two different proofs: one is algorithmic and uses the second author's computer algebra package Sigma; the second is based on complex contour integrals. In many instances, these results are extended to double sums of the above form where $\binom {2n}{n+j}$ is replaced by $\binom {2m}{m+j}$ with independent parameter $m$.

math.CO↗

arXiv2020

Representation of hypergeometric products of higher nesting depths in difference rings

A non-trivial symbolic machinery is presented that can rephrase algorithmically a finite set of nested hypergeometric products in appropriately designed difference rings. As a consequence, one obtains an alternative representation in terms of one single product defined over a root of unity and nested hypergeometric products which are algebraically independent among each other. In particular, one can solve the zero-recognition problem: the input expression of nested hypergeometric products evaluates to zero if and only if the output expression is the zero expression. Combined with available symbolic summation algorithms in the setting of difference rings, one obtains a general machinery that can represent (and simplify) nested sums defined over nested products.

cs.SC↗

arXiv2020

A case study for $ζ(4)$

Using symbolic summation tools in the setting of difference rings, we prove a two-parametric identity that relates rational approximations to $ζ(4)$.

math.NT↗

arXiv2020

The Absent-Minded Passengers Problem: A Motivating Challenge Solved by Computer Algebra

In (S.B. Ekhad and D. Zeilberger, 2020) an exciting case study has been initiated in which experimental mathematics and symbolic computation are utilized to discover new properties concerning the so-called Absent-Minded Passengers Problem. Based on these results, Doron Zeilberger raised some challenging tasks to gain further probabilistic insight. In this note we report on this enterprise. In particular, we demonstrate how the computer algebra packages of RISC can be used to carry out the underlying heavy calculations.

math.CO↗