Related papers: A Recurrence Relation Associated with Unit-Primiti…
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky.…
In terms of the $q$-Saalsch\"{u}tz identity and the Chinese remainder theorem for coprime polynomials, we establish some $q$-supercongruences modulo the third power of a cyclotomic polynomial. In particular, we give a $q$-analogue of a…
The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.
We present new and streamlined proofs of various formulae for products and ratios of characteristic polynomials of random Hermitian matrices that have appeared recently in the literature.
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
In this paper, we investigate the umbral representation of the Fubini polynomials $F_{x}^{n}:=F_{n}(x)$ to derive some properties involving these polynomials. For any prime number $p$ and any polynomial $f$ with integer coefficients, we…
We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…
We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…
We give a short proof of the log-concavity of the coefficients of the reduced characteristic polynomial of a matroid. The proof uses an extension of the theory of Lorentzian polynomials to convex cones, and reproves the Hodge-Riemann…
Given a finite Markov chain, we investigate the first minors of the transition matrix of a lifting of this Markov chain to covering trees. In a simple case we exhibit a nice factorisation of these minors, and we conjecture that it holds…
A new recurrence relation for exceptional orthogonal polynomials is proposed, which holds for type 1, 2 and 3. As concrete examples, the recurrence relations are given for Xj-Hermite, Laguerre and Jacobi polynomials in j = 1,2 case.
For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…
In this paper we prove in a constructing way that exceptional Charlier, Meixner, Hermite and Laguerre polynomials satisfy higher order recurrence relations. Our conjecture is that the recurrence relations provided in this paper have minimal…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…
The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…
In this paper, we extend properties Going Up and Lying Over from ring theory to the general setting of congruence--modular equational classes, using the notion of prime congruence defined through the commutator. We show how these two…
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…