Related papers: Local dimension of a Boolean lattice
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs of objects are incomparable. This generalization is relevant…
Given a poset $\mathcal{P}$, a family $\mathcal{F}$ of elements in the Boolean lattice is said to be $\mathcal{P}$-saturated if $\mathcal{F}$ does not contain an induced copy $\mathcal P$, but every proper superset of $\mathcal{F}$ contains…
We consider the finiteness problem for central configurations of the $n-$body problem. We prove that, for $n\geq4$, there exists a (Zariski) closed subset $B$ in the mass space $\mathbb{R}^{n}$, such that if $(m_1,...,m_n) \in…
The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…
In a recent study by Tenner, the concept of the interval poset of a permutation was introduced to effectively represent all intervals and their inclusions within a permutation. In this paper, we present a new geometric viewpoint on interval…
The Ordered Set Theory is a branch of Mathematics that studies partially ordered sets (usually posets) and lattices. The meaning of dimension is one of the main parts of this eld. Dimensions of partially ordered sets and lattices have been…
We construct partitions of $\mathbb{R}^n$ into three sets $\{\mathscr{X}(1),\mathscr{X}(2),\mathscr{X}(3)\}$ that locally minimize interfacial area among compactly supported volume preserving variations and that blow down at infinity to…
We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…
Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions: (1) the size of $P$ is a power…
The Boolean lattice $\mathcal{P}(n)$ consists of all subsets of $[n] = \{1,\dots, n\}$ partially ordered under the containment relation. Sperner's Theorem states that the largest antichain of the Boolean lattice is given by a middle layer:…
A well known result by Lagarias and Ziegler states that there are finitely many equivalence classes of d-dimensional lattice polytopes having volume at most K, for fixed constants d and K. We describe an algorithm for the complete…
Given a finite poset $X$, we find necessary and sufficient conditions for there to exist a local Noetherian UFD $A$ and a saturated embedding of posets $\phi : X \longrightarrow \mbox{Spec}(A)$ such that $\dim(X)=\dim(A)$. The conditions…
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…
The support poset of a monomial ideal $I\subseteq\mathbf{k}[x_1,\dots,x_n]$ encodes the relation between the variables $x_1,\dots,x_n$ and the minimal monomial generators of $I$. It is known that not every poset is realizable as the support…
We investigate the interplay between the local and asymptotic geometry of a set $A \subseteq \mathbb{R}^n$ and the geometry of model sets $\mathcal{S} \subset \mathcal{P}(\mathbb{R}^n)$, which approximate $A$ locally uniformly on small…
The Coxeter lattices, which we denote $A_{n/m}$, are a family of lattices containing many of the important lattices in low dimensions. This includes $A_n$, $E_7$, $E_8$ and their duals $A_n^*$, $E_7^*$ and $E_8^*$. We consider the problem…
Upper bounds to the size of a family of subsets of an n-element set that avoids certain configurations are proved. These forbidden configurations can be described by inclusion patterns and some sets having the same size. Our results are…
A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…