Fences do not maximise orbits of linear extensions

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24365602
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Fences do not maximise orbits of linear extensions

Vamshi Jandhyala
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Fences do not maximise orbits of linear extensions

Vamshi Jandhyala
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon