Related papers: Evaluating Generating Functions for Periodic Multi…
This paper is an introduction to classical polylogarithms and is an expanded version of a talk given by the author at the Motives conference. Topics covered include, monodromy; the polylogarithm local systems; Bloch's constructions of…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
We consider multi-polylogarithm functions which are slightly different from the ordinary ones. These functions have two integral representations and an order structure similar to those of multiple zeta star values. We also give a necessary…
We generalize the definition of the polylogarithm classes to the case of commutative group schemes, both in the sheaf theoretic and the motivic setting. This generalizes and simplifies the existing cases.
We construct algebraic cycles in Bloch's cubical cycle group which correspond to multiple polylogarithms with generic arguments. Moreover, we construct out of them a Hopf subalgebra in the Bloch-Kriz cycle Hopf algebra. In the process, we…
Suppose we have a Nikishin system of $p$ measures with the $k$th generating measure of the Nikishin system supported on an interval $\Delta_k\subset\er$ with $\Delta_k\cap\Delta_{k+1}=\emptyset$ for all $k$. It is well known that the…
In this paper, we study a family of generating functions whose coefficients are polynomials that enumerate partitions in lower order ideals of Young's lattice. Our main result is that this family satisfies a rational recursion and are…
We describe a theoretical and effective algorithm which enables us to prove that rather general hypergeometric series and integrals can be decomposed as linear combinations of multiple zeta values, with rational coefficients.
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We present an overview of the role of generating functions in quantum mechanical contexts, mainly in the modern theory of polarization and in the study of quantum phase transitions. Generating functions enable the derivation of moments and…
In the multicentric calculus one takes a polynomial with simple roots as a new global variable and replaces scalar functions {\varphi} by functions f taking values in C^d with d the degree of the polynomial leading to an efficient…
Motivated by the classical ideas of generating functions for orthogonal polynomials, we initiate a new line of investigation on "generating operators" for a family of differential operators between two manifolds. We prove a novel formula of…
We construct a generating functional for the exact evalutation of a coherent representation of spin network amplitudes. This generating functional is defined for arbitrary graphs and depends only on a pair of spinors for each edge. The…
The aim of this paper is to give a new approach to modified q-Bernstein polynomials for functions of two variables. By using these type polynomials, we derive recurrence formulas and some new interesting identities related to the second…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…