F-positivity for posets with interval feet

For all-weak posets generated by a common chain and arbitrary interval feet, we give a complete criterion for fundamental positivity of the difference of their P-partition generating functions. The criterion compares the numbers of attachment intervals contained in every window. It is equivalent both to containment of fundamental supports and to support containment in the maximum-descent layer. A product of interval sums gives necessity. A self-contained integer-matrix switch construction reduces sufficiency to interval widenings and exchanges, and an explicit ordinarily labeled poset certifies positivity of every exchange in arbitrary unchanged context. Repeated intervals and feet comparable through the spine are allowed. The result resolves the window-count conjecture in its stated all-weak domain with common chain length and foot count. The principal results are provisional candidates supported by complete written proofs and exact finite diagnostics; no human mathematical examination or formal verification is recorded.

Authors

Publication Details

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

F-positivity for posets with interval feet

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

F-positivity for posets with interval feet

Robert Barritz
preprint en

Abstract

For all-weak posets generated by a common chain and arbitrary interval feet, we give a complete criterion for fundamental positivity of the difference of their P-partition generating functions. The criterion compares the numbers of attachment intervals contained in every window. It is equivalent both to containment of fundamental supports and to support containment in the maximum-descent layer. A product of interval sums gives necessity. A self-contained integer-matrix switch construction reduces sufficiency to interval widenings and exchanges, and an explicit ordinarily labeled poset certifies positivity of every exchange in arbitrary unchanged context. Repeated intervals and feet comparable through the spine are allowed. The result resolves the window-count conjecture in its stated all-weak domain with common chain length and foot count. The principal results are provisional candidates supported by complete written proofs and exact finite diagnostics; no human mathematical examination or formal verification is recorded.

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