Related papers: Two Useful Facts About Generating Functions
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
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…
Some of the classical orthogonal polynomials such as Hermite, Laguerre, Charlier, etc. have been shown to be the generating polynomials for certain combinatorial objects. These combinatorial interpretations are used to prove new identities…
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 function for the number of purely crossing partitions of {1,...,n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
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 formulas for generating functions of many types of paths in various rooted tree structures. We compute the $k$th moment of the generating functions for various types of vertical paths. In two specific familes of trees we find…
Graph compositions generalize both integer compositions and partitions of a finite set. We develop formulas, generating functions and recurrence relations for composition counting functions for several families of graphs.
We study the enumerative and analytic properties of some sequences constructed using tensor invariant theory. The octant sequences are constructed from the exceptional Lie group $G_2$ and the quadrant sequences from the special linear group…
In this paper, we give a generate function for the $\sigma_1$ function. Then we find some connections between the $\sigma_1$ function and the Ramanujan's tau function. We hope this connection will give some insights into the unsolved…
In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…
We extend the notion of mex, which is central in combinatorial number theory, to an arbitrary combinatorial structure, and we prove a general theorem to determine the generating function of the objects having fixed mex. We then study this…
We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…
The article studies a class of generalized factorial functions and symbolic product sequences through Jacobi type continued fractions (J-fractions) that formally enumerate the divergent ordinary generating functions of these sequences. The…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…
Probabilistic programs are typically normal-looking programs describing posterior probability distributions. They intrinsically code up randomized algorithms and have long been at the heart of modern machine learning and approximate…