Related papers: Relative blocking in posets
A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
Right and left thick, syndetic, piecewise syndetic, and fat sets in groups are studied. The main concern is the interplay between such sets in Boolean groups. Natural topologies closely related to fat sets are also considered, which leads…
We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We…
We investigate the partial orderings of the form (P(X),\subset), where X is a relational structure and P(X) the set of the domains of its isomorphic substructures. A rough classification of countable binary structures corresponding to the…
We study two constructions related to the intervals of finite posets. The first one is a poset. The second one is more complicated. Loosely speaking it can be seen as a poset with some extra zero-relations. As main result, we show that…
The blocker $A^{*}$ of an antichain $A$ in a finite poset $P$ is the set of elements minimal with the property of having with each member of $A$ a common predecessor. The following is done: 1. The posets $P$ for which $A^{**}=A$ for all…
We recall some abstract connectivity concepts, and apply them to special chains in partially ordered sets, called veins, that are defined as order-convex chains that are contained in every maximal chain they meet. Veins enable us to define…
We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godberson's conjecture, near-optimal…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…
In this paper we give some basic results on blocking sets on minimum size for a finite chain geometry.
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
The standard notion of poset probability of a finite poset P involves calculating, for incomparable $\alpha$, $\beta$ in P, the number of linear extensions of P for which $\alpha$ precedes $\beta$. The fraction of those linear extensions…
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 introduce a formal definition of a pattern poset which encompasses several previously studied posets in the literature. Using this definition we present some general results on the M\"obius function and topology of such pattern posets.…
In this paper we show that several classes of partially ordered structures having paraorthomodular reducts, or whose sections may be regarded as paraorthomodular posets, admit a quite natural notion of implication, that admits a suitable…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
A tope committee K* for a simple oriented matroid M is a subset of its maximal covectors such that every positive halfspace of M contains more than half of the covectors from K*. The structures of the family of all committees for M, and of…
In section 1 we consider a 3-tuple $S=(|S|,\preccurlyeq,E)$ where $|S|$ is a finite set, $\preccurlyeq$ a partial ordering on $|S|,$ and $E$ a set of unordered pairs of distinct members of $|S|,$ and study, as a function of $n\geq 0,$ the…