Related papers: Consistent posets
We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…
We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…
We consider a lattice equation (Salerno model) combining onsite self-focusing and intersite self-defocusing cubic terms, which may describe a Bose-Einstein condensate of dipolar atoms trapped in a strong periodic potential. In the continuum…
Although d-complete posets arose along the interface between algebraic combinatorics and Lie theory, they are defined using only requirements on their local structure. These posets are a mutual generalization of rooted trees, shapes, and…
For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…
Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}ynicki-Birula type partitions of $P$…
We consider overdetermined systems of difference equations for a single function $u$ which are consistent, and propose a general framework for their analysis. The integrability of such systems is defined as the existence of higher order…
In recent work, generalized persistence modules have proved useful in distinguishing noise from the legitimate topological features of a data set. Algebraically, generalized persistence modules can be viewed as representations for the poset…
The set of all permutations, ordered by pattern containment, forms a poset. This paper presents the first explicit major results on the topology of intervals in this poset. We show that almost all (open) intervals in this poset have a…
Given a complemented poset P, we can assign to every element x of P the set x^+ of all its complements. We study properties of the operator ^+ on P, in particular, we are interested in the case when x^+ forms an antichain or when ^+ is…
We prove a number of dualities between posets and (pseudo)bases of open sets in locally compact Hausdorff spaces. In particular, we show that (1) Relatively compact basic sublattices are finitely axiomatizable. (2) Relatively compact basic…
We investigate a certain class of posets arising from semilattice actions. Let $S$ be a semilattice with identity. Let $S$ act on a set $C$. For $c,d\in C$ put $c\leq d$ iff there is some $s\in S$ with $ds=c$. Then $(C,\leq)$ is a poset.…
A modular or distributive lattice is `diamond-colored' if its order diagram edges are colored in such a way that, within any diamond of edges, parallel edges have the same color. Such lattices arise naturally in combinatorial representation…
A class of new type graded infinite posets with minimal element are considered. These so called cobweb posets introduced recently by the present author provide a wide range of new noncommutative prefab combinatorial schema with…
This paper studies the poset of eigenspaces of elements of an imprimitive unitary reflection group, for a fixed eigenvalue, ordered by the reverse of inclusion. The study of this poset is suggested by the eigenspace theory of Springer and…
An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…
Given functors $F,G:\mathcal C\to\mathcal D$ between small categories, when is it possible to say that $F$ can be "continuously deformed" into $G$ in a manner that is not necessarily reversible? In an attempt to answer this question in…
The jeu de taquin process produced a standard Young tableau from a skew standard Young tableau by shifting its entries to the northwest. We generalize this process to posets: certain partial numberings of any poset are shifted upward. A…