Related papers: Multivariate Kawtchouk polynomials as Birth and De…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
Motivated by recent work of Hanser and Mayers, we study two combinatorial puzzles arising from the theory of Kohnert polynomials. Such polynomials are defined as generating polynomials for certain collections of diagrams consisting of unit…
The two-matrix model is defined on pairs of Hermitian matrices $(M_1,M_2)$ of size $n\times n$ by the probability measure $$\frac{1}{Z_n} \exp\left(\textrm{Tr} (-V(M_1)-W(M_2)+\tau M_1M_2)\right)\ dM_1\ dM_2, $$ where $V$ and $W$ are given…
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on…
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…
The Ramanujan polynomials arise in three intertwined contexts. As remarked by BerndtEvans-Wilson, no combinatorial perspective seems to be alluded to in the original definition of Ramanujan. On a different stage, Dumont-Ramamonjisoa…
This paper presents a stochastic approach to theorems concerning the behavior of iterations of the Bernstein operator $B_n$ taking a continuous function $f \in C[0,1]$ to a degree-$n$ polynomial when the number of iterations $k$ tends to…
We obtain strong converse inequalities for the Bernstein operators with explicit constants. One of the main ingredients in our approach is the representation of the derivatives of the Bernstein operators in terms of the orthogonal…
Karlin and McGregor's d-variable Hahn polynomials are shown to arise in the (d+1)-dimensional singular oscillator model as the overlap coefficients between bases associated to the separation of variables in Cartesian and hyperspherical…
We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…
We study the probabilistic evolution of a birth and death continuous time measure-valued process with mutations and ecological interactions. The individuals are characterized by (phenotypic) traits that take values in a compact metric…
Derivative polynomials in two variables are defined by repeated differentiation of the tangent and secant functions. We establish the connections between the coefficients of these derivative polynomials and the numbers of interior and left…
We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps. These statements…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
We study a family of bivariate orthogonal polynomials associated to the deltoid curve. These polynomials arise when classifying bivariate diffusion operators that have discrete spectral decomposition given by orthogonal polynomials with…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function…