Related papers: Combinatorial interpretation of the recurrence rel…
In this paper, we consider the problem of treating linear regression equation coefficients in the case of correlated predictors. It is shown that in general there are no natural ways of interpreting these coefficients similar to the case of…
We consider combinatorial properties of the Mills' ratio, and explore the interplay between a continued fraction expansion for the Mills' ratio, the Laplace polynomials and a new family of combinatorial identities.
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We prove several congruences for trinomial coefficients.
In this paper, we present a probabilistic extension of the Fubini polynomials and numbers associated with a random variable satisfying some appropriate moment conditions. We obtain the exponential generating function and an integral…
We survey interactions between the topology and the combinatorics of complex hyperplane arrangements. Without claiming to be exhaustive, we examine in this setting combinatorial aspects of fundamental groups, associated graded Lie algebras,…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
In this paper we consider a semi-classical variation of the weight related to the little $q$-Laguerre polynomials and obtain a second order second degree discrete equation for the recurrence coefficients in the three-term recurrence…
The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
Recent progress in string theory has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be understood in topological terms. We describe in detail how to…
The combinatorial interpretation of the persistence diagram as a M\"obius inversion was recently shown to be functorial. We employ this discovery to recast the Persistent Homology Transform of a geometric complex as a representation of a…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
A simple recurrence relation for the even order moments of the Fabius function is proven. Also, a very similar formula for the odd order moments in terms of the even order moments is proved. The matrices corresponding to these formulas (and…
We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…
In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.
The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…