Year: 2026
Type: preprint
Abstract: In 1983, Daykin and Frankl conjectured that if $P$ is a convex subset of $Q_n$, then it contains at least $|P|\binom{n}{\lfloor n/2\rfloor}2^{-n}$ pairwise incomparable elements. We verify and communicate an LLM-generated proof of this conjecture.
Source: arXiv (Cornell University)
Author: Williams, Kada
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7208732395