Related papers: Evaluating Generating Functions for Periodic Multi…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In this paper we present a generating function approach to two counting problems in elementary quantum mechanics. The first is to find the total ways of distributing identical particles among different states. The second is to find the…
In this article, a class of analytic functions is investigated and their some properties are established. Several recurrence relations and various classes of bilinear and bilateral generating functions for these analytic functions are also…
A polygon is called rational if the angle between each pair of sides is a rational multiple of $\pi.$ The main theorem we will prove is Theorem 1: For rational polygons, periodic points of the billiard flow are dense in the phase space of…
We define motivic multiple polylogarithms and prove the double shuffle relations for them. We use this to study the motivic fundamental group of the multiplicative group - {N-th roots of unity} and relate it to geometry of modular…
This note examines linear combinations of multi-indexed sequences and derives the multivariate generating function of such a linear combination in terms of the original sequence's m.g.f. Applications include finding distributions and…
We give a formula for the bivariate generating function of a stationary 1-dependent counting process in terms of its run probability generating function, with a probabilistic proof. The formula reduces to the well known bivariate generating…
This paper proves four conjectured generating series, due to Chapoton, which concern invariants of posets and polytopes associated with a specific sequence of arbors. Two of these conjectures provide closed-form formulas for the generating…
Accurate modeling of spin-orbit coupling and noncollinear magnetism requires noncollinear density functionals within the two-component generalized Kohn-Sham (GKS) framework, yet constructing and implementing noncollinear functionals remains…
For a fixed dimension $N$ we compute the generating function of the numbers $t_N(n)$ (respectively $\bar{t}_N(n)$) of $PGL_{N+1}(k)$-orbits of rational $n$-sets (respectively rational $n$-multisets) of the projective space $\mathb{P}^N$…
The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…
We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…
This is the first of two articles devoted to a comprehensive exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product…
The main object of this paper is to construct a new generating function of the (q-) Bernstein type polynomials. We establish elementary properties of this function. By using this generating function, we derive recurrence relation and…
We describe the geometric structures involved in the variational formulation of physical theories. In presence of these structures, the constitutive set of a physical system can be generated by a family of functions. We discuss conditions,…
Using realisations of the positive discrete series representations of the Lie algebra su(1,1) in terms of Meixner-Pollaczek polynomials, the action of su(1,1) on Poisson kernels of these polynomials is considered. In the tensor product of…
Polylogrithmic functions, such as the logarithm or dilogarithm, satisfy a number of algebraic identities. For the logarithm, all the identities follow from the product rule. For the dilogarithm and higher-weight classical polylogarithms,…
In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
In this paper, we enumerate parallelogram polycubes according to several parameters. After establishing a relation between Multiple Zeta Function and the Dirichlet generating function of parallelogram polyominoes, we generalize it to the…