相关论文: Antichain generating polynomials of posets

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n).…

A famous theorem of Dilworth asserts that any finite poset of width $k$ can be decomposed into $k$ chains. We study the following problem: given a Borel poset $P$ of finite width $k$, is it true that it can be decomposed into $k$ Borel…

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

We show how to obtain linear combinations of polynomials in an orthogonal sequence $\{P_n\}_{n\geq 0}$, such as $Q_{n,k}(x)=\sum\limits_{i=0}^k a_{n,i}P_{n-i}(x)$, $a_{n,0}a_{n,k}\neq0$, that characterize quasi-orthogonal polynomials of…

We construct a $k$-fold $q$-series as a generating function of $k$-regular partitions for each positive integer $k$. The $k=1$ case is one of Euler's $q$-series identities pertaining to the partitions into distinct parts. The construction…

For a simple connected graph $G$, the $Q$-generating function of the numbers $N_k$ of semi-edge walks of length $k$ in $G$ is defined by $W_Q(t)=\sum\nolimits_{k = 0}^\infty {N_k t^k }$. This paper reveals that the $Q$-generating function…

An antichain $\mathcal{A}$ in a poset $\mathcal{P}$ is a subset of $\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\mathcal{B}_n = \left\{ 0 < 1 \right\}^n$, is the…

In Parts I-III we showed that the number of ways to place $q$ nonattacking queens or similar chess pieces on an $n\times n$ chessboard is a quasipolynomial function of $n$ whose coefficients are essentially polynomials in $q$. In this part…

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their…

We classify graded pre-Nichols algebras of diagonal type with finite Gelfand-Kirillov dimension. The characterization is made through an isomorphism of posets with the family of appropriate subsets of the set of positive roots coming from…

Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…

Pak and Panova recently proved that the $q$-binomial coefficient ${m+n \choose m}_q$ is a strictly unimodal polynomial in $q$ for $m,n \geq 8$, via the representation theory of the symmetric group. We give a direct combinatorial proof of…

We construct explicit non-isotrivial families of polynomials over $\mathbb{Q}$ satisfying uniform boundedness for their rational preperiodic points.

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Order polytopes of posets have been a very rich topic at the crossroads between combinatorics and discrete geometry since their definition by Stanley in 1986. Among other notable results, order polytopes of graded posets are known to be…

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic…

A combinatorial study of multiple $q$-integrals is developed. This includes a $q$-volume of a convex polytope, which depends upon the order of $q$-integration. A multiple $q$-integral over an order polytope of a poset is interpreted as a…