Deletion bounds for expected ranks in width-two posets

For finite posets of width at most two, we bound the sum of the absolute changes in the surviving elements' expected ranks when one element is deleted. Expected ranks are taken under the uniform linear-extension law of each poset. For an n-element poset the bound is n−1 for raw ranks and (n−1)/(n+1) for ranks normalized by one more than the size of the corresponding poset. Both results are provisional. The support archive contains a verification and reproducibility report and exact finite checks.

Authors

Publication Details

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

Deletion bounds for expected ranks in width-two posets

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

Deletion bounds for expected ranks in width-two posets

Robert Barritz
preprint en

Abstract

For finite posets of width at most two, we bound the sum of the absolute changes in the surviving elements' expected ranks when one element is deleted. Expected ranks are taken under the uniform linear-extension law of each poset. For an n-element poset the bound is n−1 for raw ranks and (n−1)/(n+1) for ranks normalized by one more than the size of the corresponding poset. Both results are provisional. The support archive contains a verification and reproducibility report and exact finite checks.

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