Related papers: Bivariate Generating Functions for a Class of Line…
The subject of this paper are polynomials in multiple non-commuting variables. For polynomials of this type orthogonal with respect to a state, we prove a Favard-type recursion relation. On the other hand, free Sheffer polynomials are a…
We develop a toolbox for the error analysis of linear recurrences with constant or polynomial coefficients, based on generating series, Cauchy's method of majorants, and simple results from analytic combinatorics. We illustrate the power of…
The aim of this paper is to study generating functions for the coefficients of the classical superoscillatory function associated with weak measurements. We also establish some new relations between the superoscillatory coefficients and…
The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…
Using the approach suggested in [arXiv:1002.2761] we present below a sufficient condition guaranteeing that two collections of patterns of permutations have the same exponential generating functions for the number of permutations avoiding…
We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…
An algorithm for calculating two-loop propagator type Feynman diagrams with arbitrary masses and external momentum is proposed. Recurrence relations allowing to express any scalar integral in terms of basic integrals are given. A minimal…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors,…
We apply the theory of disconjugate linear recurrence relations to the study of irrational quantities in number theory. In particular, for an irrational number associated with solutions of three-term linear recurrence relations we show that…
The concept of a composed product for univariate polynomials has been explored extensively by Brawley, Brown, Carlitz, Gao, Mills, et al. Starting with these fundamental ideas and utilizing fractional power series representation (in…
In this note we investigate mixed partitions with extra condition on the sizes of the blocks. We give a general formula and the generating function. We consider in more details a special case, determining the generating functions, some…
A large family of linear, usually overdetermined, systems of partial differential equations that admit a multiplication of solutions, i.e, a bi-linear and commutative mapping on the solution space, is studied. This family of PDE's contains…
We investigate a class of combinatorial sums involving reciprocals of central binomial coefficients , employing generating functions as the primary solution technique to formulate and analyze series involving the Catalan's constant. Using a…
This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
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,…
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…