Related papers: Palindromicity of the numerator of a statistical g…
We establish exact formulae for the persistence probabilities of an AR(1) sequence with symmetric uniform innovations in terms of certain families of polynomials, most notably a family introduced by Mallows and Riordan as enumerators of…
From the irreducible decompositions' point of view, the structure of the cyclic $GL_n$-module generated by the $\alpha$-determinant degenerates when $\alpha=\pm \frac1k (1\leq k\leq n-1)$. In this paper, we show that $-\frac1k$-determinant…
This paper is a continuation of our papers [EK1, EK2]. In [EK2] we showed that for the root system A_n-1 one can obtain Macdonald's polynomials - a new interesting class of symmetric functions recently defined by I. Macdonald {M1] - as…
This article presents a pedagogical probabilistic exploration of the Newton-Girard identities. We show that the coefficients in these classical relations between power sums and elementary symmetric polynomials can be interpreted as the…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
We exhibit a family of sequences of noncommutative variables, recursively defined using monic palindromic polynomials in $\mathbb Q[x]$, and show that each possesses the Laurent phenomenon. This generalizes a conjecture by Kontsevich.
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
In this paper we look at polynomials arising from statistics on the classes of involutions, $I_n$, and involutions with no fixed points, $J_n$, in the symmetric group. Our results are motivated by F. Brenti's conjecture which states that…
Given an operad P with a finite Groebner basis of relations, we study the generating functions for the dimensions of its graded components P(n). Under moderate assumptions on the relations we prove that the exponential generating function…
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
We show that the chord-length distribution function $[\gamma"(r)]$ of any bounded polyhedron has an elementary algebraic form, the expression of which changes in the different subdomains of the $r$-range. In each of these, the $\gamma"(r)$…
The ring of symmetric functions $\Lambda$, with natural basis given by the Schur functions, arise in many different areas of mathematics. For example, as the cohomology ring of the grassmanian, and as the representation ring of the…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…
We establish the unimodality and the asymptotic strong unimodality of the ordinary multinomials and give their smallest mode leading to the expression of the maximal probability of convolution powers of the discrete uniform distribution. We…
We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate…
Orthogonal polynomials with respect to the hypergeometric distribution on lattices in polyhedral domains in ${\mathbb R}^d$, which include hexagons in ${\mathbb R}^2$ and truncated tetrahedrons in ${\mathbb R}^3$, are defined and studied.…
Discrete dynamical systems defined by the iteration of a polynomial map of the unit simplex to itself appear in the context of population genetic systems evolving under mutation, recombination and weak selection. Although exceptional…
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…