Metraipolis › archive › dc_a9ecfbfdaf98
Forbidden subposet problems in the linear lattice — arXiv:2609.37748
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37748
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:43.324Z
- SHA-256 of the archived text
0301044e81eef20a18baa3b861a0abaa80c45146ea301b95f50dc8ed2b678d6a- Stable URL of this page
https://metraipolis.com/documento/dc_a9ecfbfdaf98
How to cite
Forbidden subposet problems in the linear lattice — arXiv:2609.37748 — arXiv (en), https://arxiv.org/abs/2609.37748 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a9ecfbfdaf98 (Metraipolis archive dc_a9ecfbfdaf98, sha256 0301044e81eef20a18baa3b861a0abaa80c45146ea301b95f50dc8ed2b678d6a)
BibTeX
@misc{dca9ecfbfdaf98,
title = {Forbidden subposet problems in the linear lattice — arXiv:2609.37748},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37748},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a9ecfbfdaf98; sha256 0301044e81eef20a18baa3b861a0abaa80c45146ea301b95f50dc8ed2b678d6a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37748. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study weak and strong forbidden subposet problems in the linear lattice $L_n(q)$. We show that the $q$-analogues of the Bukh--Griggs--Lu conjecture fail for every prime power $q$. If $q\ge 3$ and $n$ and $d$ have opposite parity, then $La_q(n,L_d(q))=La_q^*(n,L_d(q))=\Sigma_q(n,d)$. We also show that $La_q(n,D_s)=La_q^*(n,D_s)=\Sigma_q(n,2)$ for $2\le s\le q$ and all $n$, and for $s=q+1$ when $n$ is odd. For $n$ even, a maximum strong $D_{q+1}$-free family can be contained from the three middle layers. The case $s=2$ settles the $q$-analog of the diamond conjecture in the affirmative.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.37748 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T17:59:19.232Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).