Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.14931

Minimal Inversions in Integer Matrices of Fixed RSK Shape

Nimisha Pahuja
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Robinson-Schensted-Knuth (RSK) algorithm maps an integer matrix to a pair of semi-standard Young tableaux (SSYTs) whose underlying shape has the same integer partition. We study the set of matrices associated with a given partition $λ$ vis-a-vis the number of inversions of the matrix. In the case where the integer matrix is a permutation matrix, the resulting tableaux are standard Young tableaux or SYTs. Han (EJC, 2005) combinatorially studied the set of permutations that map to SYTs of shape $λ$ under the RSK algorithm and counted the permutations with the minimum number of inversions in that set, as well as formulated the minimal number of inversions. Han's work can be extended to a case where the matrix is a general integer matrix and the tableaux are semi-standard Young tableaux. We have conjectured a formula for the minimal number of inversions in the set of matrices with a fixed shape $λ$. We further provide a conjecture for the characterisation of the minimal generalised matrices.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nimisha Pahuja. 2026-02-16. Minimal Inversions in Integer Matrices of Fixed RSK Shape. https://arxiv.org/abs/2602.14931

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗