{"paper":{"title":"An improved bound on the diamond-free poset problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lucas Kramer, Ryan R. Martin","submitted_at":"2015-03-02T17:37:58Z","abstract_excerpt":"In the theory of partially-ordered sets, the two-dimensional Boolean lattice is known as the diamond. In this paper, we show that, if $\\mathcal{F}$ is a family in the $n$-dimensional Boolean lattice that has no diamond as a subposet, then $|\\mathcal{F}|\\leq 2.206653{n\\choose \\lfloor n/2\\rfloor}$, improving a bound by the authors and Michael Young."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00631","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}