Related papers: A Table of Generating Functions
We present a formalism that represents pure states, mixtures and generalized states as functionals on an algebra containing the observables of the system. Along these states, there are other functionals that decay exponentially at all times…
The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential…
In this paper we talk about the so-called SuperMathematics Functions (SMF), which often constiture the base for generating technical neo-geometrical objects.
Ohno's relation states that a certain sum, which we call an Ohno type sum, of multiple zeta values remains unchanged if we replace the base index by its dual index. In view of Oyama's theorem concerning Ohno type sums of finite and…
Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results…
This is a discussion of miscellaneous summation, integration and transformation formulas obtained using Fourier analysis. The topics covered are: Series of the form $\sum_{n\in\mathbb{Z}} c_ne^{\pi i \gamma n^2}$; Fusion of integrals, and…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
We obtain exact expressions counting the satisfiable 2-SAT formulae and describe the structure of associated implication digraphs. Our approach is based on generating function manipulations. To reflect the combinatorial specificities of the…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
We write a generating function for all spherical functions on the product of several copies of SU(2).
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
An extensive table of pairs of functions linked by the Legendre transformation is presented. Many special functions and formulas that are used in the sciences are included in the pairs. Formulations are provided for finding the Legendre…
We calculate some infinite sums containing the digamma function in closed-form. These sums are related either to the incomplete beta function or to the Bessel functions. The calculations yield interesting new results as by-products, such as…
Rational inner functions are a generalization of finite Blaschke products to several variables. In this article we survey a variety of results about rational inner functions related to interpolation, sums of squares formulas, and boundary…
The floor and ceiling functions appear often in mathematics and manipulating sums involving floors and ceilings is a subtle game. Fortunately, the well-known textbook Concrete Mathematics provides a nice introduction with a number of…
A classification is provided of functors, in particular polynomial ones, from a category with a zero object in which every object is a finite sum of copies of a generating object, into an abelian category. This classification is extended to…
Two methods of constructing 2D Toda $\tau$-functions that are generating functions for certain geometrical invariants of a combinatorial nature are related. The first involves generation of paths in the Cayley graph of the symmetric group…