Related papers: Ghost Kohnert posets
One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…
Landau's work on the singularities of Feynman diagrams suggests that they can only be of three types: either poles, logarithmic divergences, or the roots of quadratic polynomials. On the other hand, many Feynman integrals exist whose…
A collection of linear orders on $X$, say $\mathcal{L}$, is said to \emph{realize} a partially ordered set (or poset) $\mathcal{P} = (X, \preceq)$ if, for any two distinct $x,y \in X$, $x \preceq y$ if and only if $x \prec_L y$, $\forall L…
Given a finite set of lattice points, we compare its sumsets and lattice points in its dilated convex hulls. Both of these are known to grow as polynomials. Generally, the former are subsets of the latter. In this paper, we will see that…
We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to posets whose cover graphs have bounded treewidth, as the…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…
We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…
We investigate the ways in which fundamental properties of the weak Bruhat order on a Weyl group can be lifted (or not) to a corresponding highest weight crystal graph, viewed as a partially ordered set; the latter projects to the weak…
Let $T$ be a tree on $n$ vertices with $q$-Laplacian $L_T^q$ and Laplacian matrix $L_T$. Let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees on $n$ vertices. Inequalities are known between coefficients of the…
A dominating set $S$ of a graph is a metric-locating-dominating set if each vertex of the graph is uniquely distinguished by its distances from the elements of $S$, and the minimum cardinality of such a set is called the…
We introduce and develop the theory of UMEL-shellable posets. These are posets equipped with an edge-lexicographical labeling satisfying certain uniformity and monotonicity properties. This framework encompasses classical families of…
We show that a group admits a non-zero homogeneous quasimorphism if and only if it admits a certain type of action on a poset. Our proof is based on a construction of quasimorphisms which generalizes Poincar\'e--Ghys' construction of the…
Recently, Gross, Mansour and Tucker introduced the partial-dual genus polynomial of a ribbon graph as a generating function that enumerates the partial duals of the ribbon graph by genus. It is analogous to the extensively-studied…
In the early 1970's, Richard Stanley and Kenneth Johnson introduced and laid the groundwork for studying the order polynomial of partially ordered sets (posets). Decades later, Hamaker, Patrias, Pechenik, and Williams introduced the term…
We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
The aim of this paper is twofold. The first part is concerned with the associated and the so-called co-polynomials, i.e. new sequences obtained when finite perturbations of the recurrence coefficients are considered. In the second part we…
The natural pseudo-distance of spaces endowed with filtering functions is precious for shape classification and retrieval; its optimal estimate coming from persistence diagrams is the bottleneck distance, which unfortunately suffers from…
We propose a matrix approach for generating naturally labeled posets by representing each poset $P$ on the set $[n]$ as a Boolean poset matrix $A$. This algebraic representation enables a systematic handling of partial orderings through…