Affordable Access

Access to the full text

An extremal problem on crossing vectors

Authors
  • Lasoń, Michał
  • Micek, Piotr
  • Streib, Noah
  • Trotter, William T.
  • Walczak, Bartosz
Type
Published Article
Publication Date
Aug 19, 2014
Submission Date
May 08, 2012
Identifiers
DOI: 10.1016/j.jcta.2014.07.009
Source
arXiv
License
Yellow
External links

Abstract

For positive integers $w$ and $k$, two vectors $A$ and $B$ from $\mathbb{Z}^w$ are called $k$-crossing if there are two coordinates $i$ and $j$ such that $A[i]-B[i]\geq k$ and $B[j]-A[j]\geq k$. What is the maximum size of a family of pairwise $1$-crossing and pairwise non-$k$-crossing vectors in $\mathbb{Z}^w$? We state a conjecture that the answer is $k^{w-1}$. We prove the conjecture for $w\leq 3$ and provide weaker upper bounds for $w\geq 4$. Also, for all $k$ and $w$, we construct several quite different examples of families of desired size $k^{w-1}$. This research is motivated by a natural question concerning the width of the lattice of maximum antichains of a partially ordered set.

Report this publication

Statistics

Seen <100 times