Related papers: Generating functions of substitutions
Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
The concept of a configuration graph associated to a primitive, aperiodic substitution is introduced in [1] as a convenient graphical representation of the infinite indeterminism of the shift space of the substitution. The main result of…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
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.…
Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…
A table of sums useful for generating function applications (discrete Laplace transforms or z-transforms). Related definitions and formulas (including Lagrange's expansion), and reference to formulas in Abramowitz and Stegun, Handbook of…
In this article we study the local structure of the Fibonacci Partition Function by relating it to a cocycle over an irrational rotation.
Divide-and-conquer functions satisfy equations in F(z),F(z^2),F(z^4)... Their generated sequences are mainly used in computer science, and they were analyzed pragmatically, that is, now and then a sequence was picked out for scrutiny. By…
In this paper, we define a new type multivariable hypergeometric function. Then, we obtain some generating functions for these functions. Furthermore, we derive various families of multilinear and multilateral generating functions for these…
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,…
We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by frequency conditions on the parts. We then show that when…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
We make an asymptotic analysis via singularity analysis of generating functions of a number sequence that involves the Fibonacci numbers and generalizes the binomial coefficients.
In this paper, we find several determinants expressing the Fibonomial coefficients. We also give the generating functions, Vandermonde identity, and continued fractions about Fibonomial coefficients.
We study a generating function for the sum over fatgraphs with specified valences of vertices and faces, inversely weighted by the order of their symmetry group. A compact expression is found for general (i.e. non necessarily connected)…
We review old and new uses of exchangeability, emphasizing the general theme of exchangeable representations of complex random structures. Illustrations of this theme include processes of stochastic coalescence and fragmentation; continuum…
In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…
We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are…
We examine the family of nestohedra resulting from the complete bipartite graph through the medium of a generating function and demonstrate some of their combinatorial invariants.