Related papers: On scattered posets with finite dimension
Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\)…
Resolving a conjecture of Methuku and the first author we determine the size of the largest family of subsets of an $n$-element set avoiding both $Y_k$ and $Y_k'$ as induced subposets. The result follows as a consequence of the analogous…
We introduce iposets---posets with interfaces---equipped with a novel gluing composition along interfaces and the standard parallel composition. We study their basic algebraic properties as well as the hierarchy of gluing-parallel posets…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
For posets $P$ and $Q$, extremal and saturation problems about weak and strong $P$-free subposets of $Q$ have been studied mostly in the case $Q$ is the Boolean poset $Q_n$, the poset of all subsets of an $n$-element set ordered by…
We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational…
We investigate extension of a measure to a very general set of undetermined structure. Structure may be imposed on this set in special cases
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
We give a short and elementary proof of the fact that every metric space of finite asymptotic dimension can be embedded into a finite product of trees.
We create a framework for studying symmetric chain decompositions of families of finite posets based on the geometry of polytopes. Our framework unifies almost all known results regarding symmetric chain decompositions of the Young posets…
The queue number of a poset is the queue number of its cover graph when the vertex order is a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has queue number at most $w$. The conjecture has been…
There are Quillen equivalent Thomason model structures on the category of small categories, the category of small acyclic categories and the category of posets. These share the property that cofibrant objects are posets. In fact, they share…
We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…
Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…
We provide a characterization of the finite dimensionality of vector spaces in terms of the right-sided invertibility of linear operators on them.
For a finite poset $P$, we study the expected size of the intersection of two independent uniformly random antichains. Equivalently, we evaluate the sum of $|A\cap A'|$ over all ordered pairs of antichains. For general posets this statistic…
In this paper we investigate the conformation statistics of a Gaussian chain embedded in a medium of finite size, in the presence of quenched random obstacles. The similarities and differences between the case of random obstacles and the…
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…
According to Kearnes and Oman (2013), an ordered set $P$ is \emph{J\'onsson} if it is infinite and the cardinality of every proper initial segment of $P$ is strictly less than the cardinaliy of $P$. We examine the structure of J\'onsson…