Cube Height, Cube Width and Related Extremal Problems for Posets

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Bastide, Paul, Hodor, Jędrzej, La, Hoang, Trotter, William T.
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916982898556928
author Bastide, Paul
Hodor, Jędrzej
La, Hoang
Trotter, William T.
author_facet Bastide, Paul
Hodor, Jędrzej
La, Hoang
Trotter, William T.
contents Given a poset $P$, a family $\mathcal{S}=\{S_x:x\in P\}$ of sets indexed by the elements of $P$ is called an inclusion representation of $P$ if $x\leqslant y$ in $P$ if and only if $S_x\subseteq S_y$. The cube height of a poset is the least non-negative integer $h$ such that $P$ has an inclusion representation for which every set has size at most $h$. In turn, the cube width of $P$ is the least non-negative integer $w$ for which there is an inclusion representation $\mathcal{S}$ of $P$ such that $|\bigcup\mathcal{S}|=w$ and every set in $\mathcal{S}$ has size at most the cube height of $P$. In this paper, we show that the cube width of a poset never exceeds the size of its ground set, and we characterize those posets for which this inequality is tight. Our research prompted us to investigate related extremal problems for posets and inclusion representations. Accordingly, the results for cube width are obtained as extensions of more comprehensive results that we believe to be of independent interest.
format Preprint
id arxiv_https___arxiv_org_abs_2510_00928
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Cube Height, Cube Width and Related Extremal Problems for Posets
Bastide, Paul
Hodor, Jędrzej
La, Hoang
Trotter, William T.
Combinatorics
Discrete Mathematics
Given a poset $P$, a family $\mathcal{S}=\{S_x:x\in P\}$ of sets indexed by the elements of $P$ is called an inclusion representation of $P$ if $x\leqslant y$ in $P$ if and only if $S_x\subseteq S_y$. The cube height of a poset is the least non-negative integer $h$ such that $P$ has an inclusion representation for which every set has size at most $h$. In turn, the cube width of $P$ is the least non-negative integer $w$ for which there is an inclusion representation $\mathcal{S}$ of $P$ such that $|\bigcup\mathcal{S}|=w$ and every set in $\mathcal{S}$ has size at most the cube height of $P$. In this paper, we show that the cube width of a poset never exceeds the size of its ground set, and we characterize those posets for which this inequality is tight. Our research prompted us to investigate related extremal problems for posets and inclusion representations. Accordingly, the results for cube width are obtained as extensions of more comprehensive results that we believe to be of independent interest.
title Cube Height, Cube Width and Related Extremal Problems for Posets
topic Combinatorics
Discrete Mathematics
url https://arxiv.org/abs/2510.00928