F-positivity for two-foot posets

This note characterizes fundamental positivity and fundamental-support containment for naturally labeled posets formed from a longest chain by adding one two-sided foot and one lower or upper foot. An endpoint criterion is proved using a two-descent support kernel, relation deletion and a descent-preserving endpoint-swap injection with an explicit complement. Every nontrivial swap is also shown to lie beyond relation deletion under any vertex bijection. The main results are presented as provisional candidate theorems. A broader window-count criterion for fixed spine length and equal foot count is stated as an unproved conjecture, supported by finite computational exploration. The accompanying support archive contains the manuscript source, verification and reproducibility report, exact claims and dependency records, diagnostic programs and retained results.

Authors

Publication Details

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

F-positivity for two-foot posets

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

F-positivity for two-foot posets

Robert Barritz
preprint en

Abstract

This note characterizes fundamental positivity and fundamental-support containment for naturally labeled posets formed from a longest chain by adding one two-sided foot and one lower or upper foot. An endpoint criterion is proved using a two-descent support kernel, relation deletion and a descent-preserving endpoint-swap injection with an explicit complement. Every nontrivial swap is also shown to lie beyond relation deletion under any vertex bijection. The main results are presented as provisional candidate theorems. A broader window-count criterion for fixed spine length and equal foot count is stated as an unproved conjecture, supported by finite computational exploration. The accompanying support archive contains the manuscript source, verification and reproducibility report, exact claims and dependency records, diagnostic programs and retained results.

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