相关论文: Antichain generating polynomials of posets

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author.…

We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…

We investigate the existence of closed polylines (also known as closed polygonal chains or self-crossing polygons) that intersect each of their edges the same number of times. The most general question in this corner of combinatorial…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

In this paper we show that for any poset $P$ that is not an antichain, the number of induced $P$-free families in the Boolean lattice $2^{[n]}$ is at most $ 2^{O(\mathrm{La}^*(n,P))}$, where $\mathrm{La}^*(n,P)$ denotes the the largest size…

We conjecture that, if the quotient of two $q$-binomial coefficients with the same top argument is a polynomial, then it has non-negative coefficients. We summarise what is known about the conjecture and prove it in two non-trivial cases.…

For n=1,2,3,... let N_n(q) denote the number of monic irreducible polynomials over the finite field F_q. We mainly show that the sequence N_n(q)^{1/n} (n>e^{3+7/(q-1)^2}) is strictly increasing and the sequence…

We consider the multivariate generating series $F_P$ of $P$-partitions in infinitely many variables $x_1, x_2 , \dots$. For some family of ranked posets $P$, it is natural to consider an analog $N_P$ with two infinite alphabets. When we…

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…

We study the Poincare polynomials of isotypic components of a natural family of graded GL(n)-modules supported in the closure of a nilpotent conjugacy class. These polynomials generalize the Kostka-Foulkes and are q-analogues of…

A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be a composition of $n$ which has no mirror symmetry amongst…

We describe various aspects of the Al-Salam-Chihara $q$-Laguerre polynomials. These include combinatorial descriptions of the polynomials, the moments, the orthogonality relation and a combinatorial interpretation of the linearization…

Let $\mathfrak q$ be a finite-dimensional Lie algebra, $\vartheta\in Aut(\mathfrak q)$ a finite order automorphism, and $\mathfrak q_0$ the subalgebra of fixed points of $\vartheta$. Using $\vartheta$ one can construct a pencil $\mathcal P$…

Let $K(\gamma)$ be the weakly equilibrium Cantor type set introduced in [10]. It is proven that the monic orthogonal polynomials $Q_{2^s}$ with respect to the equilibrium measure of $K(\gamma)$ coincide with the Chebyshev polynomials of the…

We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…

We give a short and self-contained argument that shows that, for any positive integers $t$ and $n$ with $t =O\Bigl(\frac{n}{\log n}\Bigr)$, the number $\alpha([t]^n)$ of antichains of the poset $[t]^n$ is at most…

In this paper we consider the classical problem of computing linear extensions of a given poset which is well known to be a difficult problem. However, in our setting the elements of the poset are multivariate polynomials, and only a small…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

A poset $I=(\{1,\ldots, n\}, \leq_I)$ is called non-negative if the symmetric Gram matrix $G_I:=\frac{1}{2}(C_I + C_I^{tr})\in\mathbb{M}_n(\mathbb{R})$ is positive semi-definite, where $C_I\in\mathbb{M}_n(\mathbb{Z})$ is the $(0,1)$-matrix…

We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…