Related papers: The Eigenvectors of the Right-Justified Pascal Tri…
This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial…
Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
We present a number of identities involving standard and associated Laguerre polynomials. They include double-, and triple-lacunary, ordinary and exponential generating functions of certain classes of Laguerre polynomials.
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions.…
Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
In this paper, we consider linear differential equations satisfied by the generating function for Hermite polynomials and derive some new identities involving those polynomials.
In this note we present a combinatorial proof of an identity involving poly-Bernoulli numbers and Genocchi numbers. We introduce the combinatorial objects, $m-$barred Callan sequences and show that the identity holds in a more general…
The generating function that records the sizes of directed circuit partitions of a connected 2-in, 2-out digraph D can be determined from the interlacement graph of D with respect to a directed Euler circuit; the same is true of the…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
We present new methods for the study of a class of generating functions introduced by the second author which carry some formal similarities with the Hurwitz zeta function. We prove functional identities which establish an explicit…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…