相关论文: Gessel polynomials, rooks, and extended Linial arr…

We propose and develop a theory of Ferrers diagrams and their $q$-rook polynomials solely based on their diagonals. We show that the cardinalities of the diagonals of a Ferrers diagram are equivalent information to their rook numbers,…

For a graph $G$ with $n$ vertices and a positive integer $k \leq n$, let $s_k(G)$ be the number of subtrees (subgraphs that are trees, not necessarily induced) of $G$ with $k$ vertices. The subtree polynomial of $G$ is $S(G;x) =…

For each integer $k \geq 2$, we introduce a sequence of $k$-ary discrete trees constructed recursively by choosing at each step an edge uniformly among the present edges and grafting on "its middle" $k-1$ new edges. When $k=2$, this…

The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…

In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled…

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…

We consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations $P_0(x)=1$, $P_1(x)=x$, $x P_n(x)=(1-c_n)P_{n+1}(x)+c_n P_{n-1}(x),$ $n\in\mathbb{N}$ with…

We study the distribution of the length of longest increasing subsequences in random permutations of $n$ integers as $n$ grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by…

Very recently, Green and Sawhney obtained a quasipolynomial bound in the Furstenberg--S\'ark\"ozy theorem for square differences by proving an ''arithmetic level-$d$'' inequality, thereby yielding a greatly improved density increment…

We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…

We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic…

Let $\mathcal{T}^{(p)}_n$ be the set of $p$-ary labeled trees on $\{1,2,\dots,n\}$. A maximal decreasing subtree of an $p$-ary labeled tree is defined by the maximal $p$-ary subtree from the root with all edges being decreasing. In this…

Given a subspace arrangement, there are several De Concini-Procesi models associated to it, depending on distinct sets of initial combinatorial data (building sets). The first goal of this paper is to describe, for the root arrangements of…

We propose a novel mathematical paradigm for the study of genetic variation in sequence alignments. This framework originates from extending the notion of pairwise relations, upon which current analysis is based on, to k-ary dissimilarity.…

Given a connected undirected graph $G$, a spanning tree is a subgraph $T$ of $G$ such that $V(T) = V(G)$ and $T$ is a tree. A collection of $\ell$ spanning trees $T_1,\ldots,T_\ell$ is pairwise $k$-diverse if for every $i \neq j$, $|E(T_i)…

Motivated by the study of Macdonald polynomials, J. Haglund and A. Wilson introduced a nonsymmetric polynomial analogue of the chromatic quasisymmetric function called the \emph{chromatic nonsymmetric polynomial} of a Dyck graph. We give a…

We introduce two new bases of the ring of polynomials and study their relations to known bases. The first basis is the quasiLascoux basis, which is simultaneously both a $K$-theoretic deformation of the quasikey basis and also a lift of the…

Tutte founded the theory of enumeration of planar maps in a series of papers in the 1960s. Rooted non-separable planar maps are in bijection with West-2-stack-sortable permutations, beta(1,0)-trees introduced by Cori, Jacquard and Schaeffer…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…