arXiv (All)
open access
An inclusion coupling of prefix laws and the Chan-Pak rank inequality for all finite posets
Let $P$ be a finite poset, let $x\in P$, and let $N_k$ count its linear extensions in which $x$ occupies position $k$. We prove Chan and Pak's conjecture that, for all integers $a,h\ge1$, \[ (a+h-1)N_{a+h-1}N_a\ \ge\ (a-1)N_{a-1}N_{a+h}+hN_aN_{a+h}. \] The key result is an inclusion coupling of the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Combinatorics of descent algebras and graph coverings#971114
- A lower bound for the Call-Silverman height in cyclotomic extensions#822176
- Lower bound for the canonical height on abelian varieties over totally p-adic extensions#984091
- Effective Dimensions in Grothendieck--Hölder Inequalities#1200049
- On the Perversity of Chern Classes for Compactified Jacobians#1131404
Record · ID 1400059
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive