Related papers: Updown Categories
A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
We develop a direct method to recover an orthoalgebra from its poset of Boolean subalgebras. For this a new notion of direction is introduced. Directions are also used to characterize in purely order-theoretic terms those posets that are…
Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the…
We introduce new methods for understanding the topology of $\Hom$ complexes (spaces of homomorphisms between two graphs), mostly in the context of group actions on graphs and posets. We view $\Hom(T,-)$ and $\Hom(-,G)$ as functors from…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…
As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
An orthoset is a non-empty set together with a symmetric and irreflexive binary relation $\perp$, called the orthogonality relation. An orthoset with 0 is an orthoset augmented with an additional element 0, called falsity, which is…
We propose the representation principle to study physical systems with a given symmetry. In the context of symmetry enriched topological orders, we give the appropriate representation category, the category of SET orders, which include SPT…
We show that every poset P=(P,\le) satisfying the Ascending Chain Condition can be isomorphically embedded into the poset of all mappings from P to the set A(P) of all antichains of P equipped with a certain partial order relation. This…
This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
We study computably enumerable equivalence relations (abbreviated as ceers) under computable reducibility, and we investigate the resulting degree structure Ceers, which is a poset with a smallest and a greatest element. We point out a…
In this note, we establish an equivalence of categories between the category of all eight-dimensional composition algebras with any given quadratic form $n$ over a field $k$ of characteristic not two, and a category arising from an action…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
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…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
An extension of order theory is presented that serves as a formalism for the study of dendroidal sets analogously to way the formalism of order theory is used in the study of simplicial sets.