arXiv News

First-hand information for everyone

Site

AboutPrivacy PolicyTerms of Use

© 2026 arXiv News

Researchers prove tighter lower bounds on inversions for highly connected permutation graphs | arXiv News

arXiv News

EnglishJapanese

Switch language

EnglishJapanese
Loading account…

First-hand information for everyone

Back to front page
MathematicsEnglishPublished

Researchers prove tighter lower bounds on inversions for highly connected permutation graphs

November 16, 2026arXiv: 2611.17237v1

A recent study shows that any permutation whose inversion graph is k‑connected contains at least

\(\frac{k+1}{2}\,|\pi| - C\) inversions, where the constant C depends only on k. This bound is strictly stronger than the generic \(kn/2\) lower limit known for all k‑connected graphs.

The proof starts by taking the k lowest and the k highest vertices of the graph, then using Menger’s theorem to extract k disjoint induced paths between them. Counting the vertices along these paths yields the linear term \((k+1)/2|\pi|\). The method is detailed in the paper’s methodological section.

The authors further characterize the permutation patterns that allow an even higher bound of \(k|\pi| - C\). They prove that this exact collection is the avoidance class \(\mathrm{Av}(321,2341,4123)\), a result that holds for all k≥2.

To test tightness, permutations are constructed that meet the bound up to an additive constant. For each k≥2, the coefficient k is shown to be optimal, but the constants C supplied by the proofs are far from minimal. For example, the computation for the pattern 1324 yields C=36 in the paper, whereas the best possible value is known to be 6. Likewise, the generic construction gives C=⌈(k+1)/2⌉, while experimental data suggest that C=k would suffice.

Future work will aim to sharpen these constants and explore whether the same techniques can improve bounds for other graph classes.

Source paper

Permutation patterns and higher connectivity in inversion graphs

Mathematics
View on arXiv