Strict rank log-concavity for intervals of lattice path matroid quotients
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.