Fences do not maximise orbits of linear extensions
Year: 2026
Type: preprint
Abstract: For a finite poset P let f(P) = e(P)/#Aut(P) be the number of orbits of the automorphism group on the linear extensions, and g(n) the largest value of f over n-element posets. Stanley asked whether the maximisers are disjoint unions of fences. By exhaustive computation we find g(n) and every maximiser for n ≤ 11: fence unions maximise exactly for n ≤ 7 and n = 9. We prove that for n = 12 and every n ≥ 14 no maximiser is a union of fences, so fence unions maximise for no other n except possibly n = 13. For 12 ≤ n ≤ 57 the proof sets a seven- or eight-element component beside an optimal fence union; for larger n it uses a construction posted by Graham and the chain-partition bound. Part of Theorem 2 (n ≥ 181) and its lemmas are formally verified in Lean 4; the rest is exact computation, checked by two independent programs. This record is identical to the folder fences-orbit-maximisers at tag fences-orbit-maximisers-v2 of https://github.com/jvvk/mathematics. Version 2 of the preprint; version 1 (23 October 2026) was released on GitHub only.
Author: Jandhyala, Vamshi
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7236619371
