Related papers: N-free posets and orthomodularity

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…

We prove that the 18-element non-lattice orthomodular poset depicted in the paper is the smallest one and unique up to isomorphism. Since not every Boolean poset is orthomodular, we consider the class of the so-called generalized…

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…

A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…

We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to…

Let $m$ and $n$ be cardinals with $3\leq m,n\leq\omega$. We show that the class of posets that can be embedded into a distributive lattice via a map preserving all existing meets and joins with cardinalities strictly less than $m$ and $n$…

Topological Ramsey spaces are spaces which support infinite dimensional Ramsey theory similarly to the Ellentuck space. Each topological Ramsey space is endowed with a partial ordering which can be modified to a $\sigma$-closed `almost…

We provide a new combinatorial approach to studying the collection of N-infinity-operads in G-equivariant homotopy theory for G a finite cyclic group. In particular, we show that for G the cyclic group of order p^n the natural order on the…

We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

We prove that every finite group $G$ can be realized as the automorphism group of a poset with $4|G|$ points. We also provide bounds for the minimum number of points of a poset with cyclic automorphism group of a given prime power order.

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…

It is proved that if $\varphi\colon A\to B$ is a local homomorphism of commutative noetherian local rings, a nonzero finitely generated $B$-module $N$ whose flat dimension over $A$ is at most $\mathrm{edim}\, A - \mathrm{edim}\, B$, is free…

In this paper we consider the characteristic polynomial of not necessarily ranked posets. We do so by allowing the rank to be an arbitrary function from the poset to the nonnegative integers. We will prove two results showing that the…

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…

We show that the order complex of the poset of all cosets of all proper subgroups of a finite group $G$ is never $\mathbb{F}_{2}$-acyclic and therefore never contractible. This settles a question of K. S. Brown.

Let $B_n$ be the poset generated by the subsets of $[n]$ with the inclusion as relation and let $P$ be a finite poset. We want to embed $P$ into $B_n$ as many times as possible such that the subsets in different copies are incomparable. The…

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…