English

Intersection statistics for antichains in minuscule posets

Combinatorics 2026-02-03 v2

Abstract

For a finite poset PP, we study the expected size of the intersection of two independent uniformly random antichains. Equivalently, we evaluate the sum of AA|A\cap A'| over all ordered pairs of antichains. For general posets this statistic appears to have little structure, but for the classical minuscule posets with uniform combinatorial models it admits closed-form expressions. Though the proofs are elementary and combinatorial, the resulting formulas admit a natural interpretation in terms of weight diagrams of minuscule representations.

Keywords

Cite

@article{arxiv.2601.21127,
  title  = {Intersection statistics for antichains in minuscule posets},
  author = {James Propp},
  journal= {arXiv preprint arXiv:2601.21127},
  year   = {2026}
}

Comments

Proofs are incorrect as stated. I plan to revise and resubmit

R2 v1 2026-07-01T09:24:48.404Z