Related papers: Consistent posets
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
We investigate the representation of the symmetric group afforded by the action on its conjugacy class of fixed point free involutions, over an algebraically closed field of finite characteristic p. We discuss the general form of the set of…
We propose definitions of the common bases complex, the poset of decompositions, and the poset of partial decompositions for arbitrary spherical buildings. We show that the poset of decompositions is Cohen-Macaulay, and that the poset of…
The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec…
The anti-continuum limit of a monotone variational recurrence relation consists of a lattice of uncoupled particles in a periodic background. This limit supports many trivial equilibrium states that persist as solutions of the model with…
This paper analyzes the representation theoretic stability, in the sense of Thomas Church and Benson Farb, of the rank-selected homology of the Boolean lattice and the partition lattice, proving sharp uniform representation stability bounds…
We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective…
We introduce a set of combinatorial techniques for studying the simplicial bounded cohomology of semi-simplicial sets, simplicial complexes and posets. We apply these methods to prove several new bounded acyclicity results for…
Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…
In this paper we consider representations of certain combinatorial categories, including the poset $\D$ of positive integers and division, the Young lattice $\mathscr{Y}$ of partitions of finite sets, the opposite category of the orbit…
A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any automorphism of a zircon is itself a zircon. This provides a…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…
We introduce a property of compact complex manifolds under which the existence of balanced metric is stable by small deformations of the complex structure. This property, which is weaker than the $\partial\overline\partial$-Lemma, is…
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…
Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected…
The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…
The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…
We discuss applications of exact structures and relative homological algebra to the study of invariants of multiparameter persistence modules. This paper is mostly expository, but does contain a pair of novel results. Over finite posets,…