Related papers: Evaluating Generating Functions for Periodic Multi…
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input…
Let G be the space of generating functions of a periodic infinite order linear recurrence. In this paper we provide an explicit procedure for computing a basis of G.
We introduce a class of functions which constitutes an obvious elliptic generalization of multiple polylogarithms. A subset of these functions appears naturally in the \epsilon-expansion of the imaginary part of the two-loop massive sunrise…
In 2019, Butler, Choi, Kim, and Seo introduced a new type of juggling card that represents multiplex juggling patterns in a natural bijective way. They conjectured a formula for the generating function for the number of multiplex juggling…
We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…
In this paper, we study the generating functions of multiple $t$-star values with an arbitrary number of blocks of twos, which are based on the results of the corresponding generating functions of multiple $t$-harmonic star sums. These…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
The generating functionals (GF) method in Bogolyubov's formulation and its application for particle physics is considered. Effectiveness of the method is illustrated by two examples. So, GF method can be used as the technical trick solving…
A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…
We survey various results and conjectures concerning multiple polylogarithms and the multiple zeta function. Among the results, we announce our resolution of several conjectures on multiple zeta values. We also provide a new integral…
Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…
We provide a multidimensional weighted Euler--MacLaurin summation formula on polytopes and a multidimensional generalization of a result due to L. J. Mordell on the series expansion in Bernoulli polynomials. These results are consequences…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
The $p$-th power of the logarithm of the Catalan generating function is computed using the Stirling cycle numbers. Instead of Stirling numbers, one may write this generating function in terms of higher order harmonic numbers.
Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…
Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…
In this paper an algorithm is given to determine all possible structurally different linearly conjugate realizations of a given kinetic polynomial system. The solution is based on the iterative search for constrained dense realizations…
We review a method for the algebraic treatment of a family of functions which contains the multiple polylogarithms, with applications to the symbolic calculation of Feynman integrals.