Related papers: A Cayley theorem for posets
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
We investigate a category of quantum posets that generalizes the category of posets and monotone functions. Up to equivalence, its objects are hereditarily atomic von Neumann algebras equipped with quantum partial orders in Weaver's sense.…
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…
To r ideals on a germ of smooth variety X one attaches a rational polytope in the r-dimensional Euclidean space (the LCT-polytope) that generalizes the notion of log canonical threshold in the case of one ideal. We study these polytopes,…
We introduce and study additive posets. We show that the top homology group (with coefficients in Z/2Z) of a finite dimensional CW-complex carries a structure of an additive poset invariant under subdivisions. Applications to CW-complexes…
Cayley's theorem tells us that all groups $\mathbf{G}$ occur as subgroups of the group of automorphisms over some set $X$. In this paper we consider a `sort-of' converse to this question: given a set $X$ and some transformation group…
For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…
Aharoni and Korman (Order 9 (1992) 245--253) have conjectured that every ordered set without infinite antichains possesses a chain and a partition into antichains so that each part intersects the chain. The conjecture is verified for posets…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order $\langle {\mathbb P} ({\mathbb X}) ,\subset \rangle$, where ${\mathbb P} ({\mathbb X})=\{ Y\subset X: {\mathbb Y} \cong {\mathbb X}\}$. Investigating the…
Let $P$ and $Q$ be bounded posets. In this note, a lemma is introduced that provides a set of sufficient conditions for the proper part of $P$ being homotopy equivalent to the suspension of the proper part of~$Q$. An application of this…
We demonstrate that all good asymptotic entanglement measures are either identical or place a different ordering on the set of all quantum states.
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,…
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby's description of such posets by…
A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…
Let $P$ be a finite poset. We will show that for any reasonable $P$-persistent object $X$ in the category of finite topological spaces, there is a $P-$ weighted graph, whose clique complex has the same $P$-persistent homology as $X$.
A graded poset structure is defined for the sets of Littlewood-Richardson (LR) tableaux that count the multiplicity of an irreducible GL(n)-module in the tensor product of irreducibles indexed by a sequence of rectangular partitions. This…
We prove the $K(\pi,1)$ conjecture for affine Artin groups: the complexified complement of an affine reflection arrangement is a classifying space. This is a long-standing problem, due to Arnol'd, Pham, and Thom. Our proof is based on…
We prove that for a chainable continuum $X$ and every non-zigzag $x\in X$ there exists a planar embedding $\phi:X\to \phi(X)\subset\mathbb R^2$ such that $\phi(x)$ is accessible, partially answering the question of Nadler and Quinn from…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…