The sharp height-six cutoff for P-partition uniqueness

For finite naturally labeled posets of Greene shape (6,2,2,1^k), the P-partition generating function distinguishes all orders up to isomorphism for k at most four. Exact comparisons separate 855,582,262 classes at k=4. An explicit fifteen-point pair and common isolated elements give nonisomorphic examples with equal series for every k at least five. This is a computational candidate theorem.

Authors

Publication Details

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

The sharp height-six cutoff for P-partition uniqueness

Robert Barritz
6 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

The sharp height-six cutoff for P-partition uniqueness

Robert Barritz
preprint en

Abstract

For finite naturally labeled posets of Greene shape (6,2,2,1^k), the P-partition generating function distinguishes all orders up to isomorphism for k at most four. Exact comparisons separate 855,582,262 classes at k=4. An explicit fifteen-point pair and common isolated elements give nonisomorphic examples with equal series for every k at least five. This is a computational candidate theorem.

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