Published November 19, 2026 | Version 1

Strict rank log-concavity for intervals of lattice path matroid quotients

Authors/Creators

  • 1. School of Mathematical Science, Capital Normal University

Description

Every interval in the quotient order on lattice path matroids has a strictly log-concave rank sequence. If aj is the size of an interior layer, then aj−1aj+1 ≤ (aj − 1)2. This answers a question of Benedetti-Velásquez and Knauer. We encode both endpoint comparisons by difference inequalities on two sequences of prefix counts. Translating adjacent layers allows the four-functions theorem to compare them through their coordinatewise maxima and minima. The same argument gives a weighted inequality with explicit correction terms. At rank difference four the middle layer exceeds both adjacent layers by at least two, and the bound is attained.

Notes

OpenAI Codex assisted with the proof, the literature comparison, manuscript preparation, and the finite verification.

Files

P87_signed.pdf

Files (342.1 kB)

Name Size
md5:65e51594cd8be2c13d16e3bef3dd312a
334.4 kB Preview Download
md5:e50a2ef445e6a19ea1422b508805d2a0
7.7 kB Preview Download