相关论文: Chain enumeration, partition lattices and polynomi…

We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

A chain poset, by definition, consists of chains of ordered elements in a poset. We study the chain posets associated to two posets: the Boolean algebra and the poset of isotropic flags. We prove that, in both cases, the chain posets…

A polynomial is real-rooted if all of its roots are real. This note gives a simple proof of the Hermite-Sylvester theorem that a polynomial $f(x) \in {\mathbf R}[x]$ is real-rooted if and only if an associated quadratic form is positive…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

The divisibility and congruence of usual and generalized central trinomial coefficients have been extensively investigated. The present paper is devoted to analytic properties of these numbers. We show that usual central trinomial…

We extend the notion of chain algebra, originally defined in \cite{GN} for finite distributive lattices, to that of finite pure posets. We show this algebra corresponds to the Ehrhart ring of a (0,1)-polytope, termed the chain polytope, and…

Given a real cubic function $f(x)$ with three roots, take an equilateral triangle $ABC$, the projections of which vertices are the roots of $f(x)$. There is a folklore fact that the vertical lines through the extrema of $f(x)$ are tangent…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

We introduce and study the lattice of generalized partitions, called weighted partitions. This lattice possesses similar properties of the lattice of partitions. By use of the pictorial representation of a weighted partition, the total…

The $h$-polynomial of the barycentric subdivision of any $n$-dimensional cubical complex with nonnegative cubical $h$-vector is shown to have only real roots and to be interlaced by the Eulerian polynomial of type $B_n$. This result applies…

A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…

We compute the characteristic polynomials of the posets of hypertrees. We show that the generating series of the polynomials can be expressed using cyclic hypertrees. We also propose a conjecture on the action of the symmetric groups on the…

In the present study, we propose necessary and sufficient assumptions on the coefficients in order to only get distinct real roots of polynomials.

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

We prove the existence of Hall polynomials for prinjective representations of finite partially ordered sets of finite prinjective type. In Section 4 we shortly discuss consequences of the existence of Hall polynomials, in particular, we are…

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…

In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…