Related papers: A generalization of Eulerian numbers via rook plac…
We identify the scaling region of a width O(n^{-1}) in the vicinity of the accumulation points $t=\pm 1$ of the real roots of a random Kac-like polynomial of large degree n. We argue that the density of the real roots in this region tends…
We show that the pair (des, ides) of statistics on the set of permu- tations has the same distribution as the pair (asc, row) of statistics on the set of inversion tables, proving a conjecture of Visontai. The common generating function of…
We discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of…
We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or…
An important theorem of Beck says that any point set in the Euclidean plane is either ``nearly general position'' or ``nearly collinear'': there is a constant C>0 such that, given n points in the plane with at most r$ of them collinear, the…
In this paper, we explore (slightly generalized) $f$-Eulerian polynomials introduced by Stanley and frequently appearing in combinatorics. Notable special cases include the classical Eulerian polynomials, the generating polynomials of order…
Goulden and Jackson introduced a very powerful method to study the distributions of certain consecutive patterns in permutations, words, and other combinatorial objects which is now called the cluster method. There are a number of natural…
This paper develops methods to study the distribution of Eulerian statistics defined by second-order recurrence relations. We define a random process to decompose the statistics over compositions of integers. It is shown that the numbers of…
The P-Eulerian polynomial counts the linear extensions of a labeled partially ordered set, P, by their number of descents. It is known that the P-Eulerian polynomials are real-rooted for various classes of posets P. The purpose of this…
We study global distribution of zeros for a wide range of ensembles of random polynomials. Two main directions are related to almost sure limits of the zero counting measures, and to quantitative results on the expected number of zeros in…
In this paper we consider the generalized anchored configuration spaces on $n$ labeled points on a~graph. These are the spaces of all configurations of $n$ points on a~fixed graph $G$, subject to the condition that at least $q$ vertices in…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
We explain and generalise row-removal phenomena for Schur algebras via isomorphisms between subquotients of these algebras. In particular, we prove a new reduction formulae for $p$-Kostka numbers and extension groups between Weyl and simple…
A tangled-diagram over $[n]=\{1,...,n\}$ is a graph of degree less than two whose vertices $1,...,n$ are arranged in a horizontal line and whose arcs are drawn in the upper halfplane with a particular notion of crossings and nestings.…
In this paper we define generalizations of boson normal ordering. These are based on the number of contractions whose vertices are next to each other in the linear representation of the boson operator function. Our main motivation is to…
This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…
The first aim of this paper is to construct new generating functions for the generalized {\lambda}-Stirling type numbers of the second kind, generalized array type polynomials and generalized Eulerian type polynomials and numbers, attached…
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
We study two generalizations of the gamma-expansion of Eulerian polynomials from the viewpoint of the decompositions of statistics. We first present an expansion formula of the trivariate Eulerian polynomials, which are the enumerators for…