Related papers: Posets arising from decompositions of objects in a…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
Let $\mathbf{C}$ be a Cauchy-complete category. The subtoposes of $[\mathbf{C}^{\mathrm{op}},\mathbf{Set}]$ are sometimes all of the form $[\mathbf{D}^{\mathrm{op}},\mathbf{Set}]$ where $\mathbf{D}$ is a full subcategory of $\mathbf{C}$.…
In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…
For P a poset or lattice, let Id(P) denote the poset, respectively, lattice, of upward directed downsets in P, including the empty set, and let id(P)=Id(P)-\{\emptyset\}. This note obtains various results to the effect that Id(P) is always,…
Toric posets are cyclic analogues of finite posets. They can be viewed combinatorially as equivalence classes of acyclic orientations generated by converting sources into sinks, or geometrically as chambers of toric graphic hyperplane…
In this note we introduce the poset of $m$-multichains of a given poset $\mathcal{P}$. Its elements are the multichains of $\mathcal{P}$ consisting of $m$ elements, and its partial order is the componentwise partial order of $\mathcal{P}$.…
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…
We study the classification of submodules of module categories over monoidal categories, extending ideas of Coulembier on the classification of tensor ideals in monoidal categories. We develop a framework that applies to module categories…
We provide a characterisation of the category $\mathsf{KOrd}$ of Nachbin's compact ordered spaces as a poset-enriched category. Up to equivalence, $\mathsf{KOrd}$ is the only non-degenerate poset-enriched pretopos whose terminal object is a…
Examples of exact categories in representation theory are given by the category of Delta-filtered modules over quasi-hereditary algebras, but also by various categories related to matrix problems, such as poset representations or…
Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…
A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…
This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…
Anders Bjorner characterized which finite graded partially ordered sets arise as the posets of closure relations on cells of a finite, regular CW complex. His characterization of these "CW posets" required each open interval $(\hat{0},u)$…
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…
We introduce the notion of a poset scheme and study the categories of quasi-coherent sheaves on such spaces. We then show that smooth poset schemes may be used to obtain categorical resolutions of singularities for usual singular schemes.…
We show that the well known {\em homotopy complementation formula} of Bj\"orner and Walker admits several closely related generalizations on different classes of topological posets (lattices). The utility of this technique is demonstrated…
This is the first in a series of papers math.AG/0503029, math.AG/0410267, math.AG/0410268 on "configurations" in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite…
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…