SearcharxivSearch

arXiv · 1603.05037

The involutive nature of the Littlewood-Richardson commutativity bijection

Abstract

Littlewood-Richardson (LR) coefficients $c_{\mu\nu}^\lambda$ may be evaluated by means of several combinatorial models, including the original LR tableaux of skew shape $\lambda/\mu$ and weight $\nu$ and the LR hives with boundary edge labels $\lambda$, $\mu$ and $\nu$. Unfortunately, neither of these reveal in any obvious way the well-known symmetry property $c_{\mu\nu}^\lambda=c_{\nu\mu}^\lambda$. Here we introduce two maps, $\rho^{(n)}$ on LR tableaux and $\sigma^{(n)}$ on LR hives, that each interchange contributions to $c_{\mu\nu}^\lambda$ and $c_{\nu\mu}^\lambda$ for any partitions $\lambda$, $\mu$, $\nu$ of lengths no greater than $n$, and then prove not only that each of them is a bijection, thereby making manifest the required symmetry property, but also that both maps are involutions. The map $\rho^{(n)}$ involves the iterative action of deletion operators on a given LR tableau of skew shape $\lambda/\mu$ and weight $\nu$, that produce a sequence of successively smaller tableaux whose consecutive inner shapes define a certain Gelfand-Tsetlin pattern and determine a partner LR tableau of skew shape $\lambda/\nu$ and weight $\mu$. Similarly, the map $\sigma^{(n)}$ involves repeated path removals from a given LR hive with boundary edge labels $(\lambda,\mu,\nu)$ that give rise to a sequence of hives whose left-hand boundary edge labels define the same Gelfand-Tsetlin pattern as before, which is sufficient to determine a partner LR hive with boundary edge labels $(\lambda,\nu,\mu)$. The deletions in tableaux are organised so as to preserve the semistandard and lattice permutation properties of LR tableaux, while the path removals in hives are designed to preserve both the triangle condition on edge labels and the hive rhombus gradient positivity conditions. At all stages illustrative examples are provided.

Explore related subjects

Keep this discovery

BibTeXRIS

O. Azenhas, R. C. King, I. Terada. 2016-03-16. The involutive nature of the Littlewood-Richardson commutativity bijection. https://arxiv.org/abs/1603.05037

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

KEEP EXPLORING

Related papers

Balanced even cycles in signed graphs:Tur\'an bounds, double covers, and parity obstructions

We study Tur\'an problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Tur\'an numbers differ by at most a factor of two. Our main structural results concern the underlying graphs that admit a signing in which every $2k$-cycle is unbalanced. We characterize these graphs by the absence of an odd dependence among their $2k$-cycle incidence vectors, give a cohomological formulation, and construct subgraph-minimal obstructions of arbitrarily large order. In particular, there is no finite forbidden-subgraph characterization. We also give an exact closed-walk criterion for cycles in double covers and derive a direct signed breadth-first-search upper bound. As applications, we prove \[ \hex(n,C_{+4})=\left(\frac{\sqrt2}{2}+o(1)\right)n^{3/2} \] and study the signed hexagon number $R_6(n)=\hex(n,\{C_{-3},C_{+6}\})$. We characterize the underlying graphs counted by $R_6$ and express it as an extremal problem for ordinary $C_6$-free graphs with a prescribed involution. For every sufficiently large $n$, we construct examples with $\Omega(n^{4/3})$ edges, and we give an equivariant construction attaining the coefficient obtained from the F\"uredi--Naor--Verstra\"ete lower bound by double-cover transfer. Finally, we give $n$-vertex $C_{+10}$-free signed graphs with $\Omega(n^{6/5})$ edges and use octagon examples to illustrate the limitations of theta-freeness as a signing criterion.

math.CO

Fractional DP-colorings of $d$-degenerate locally sparse graphs

Bernshteyn, Kostochka, and Zhu (2020) introduced the notion of fractional DP-coloring, which generalizes both fractional coloring and fractional list coloring. Among several foundational results, they proved that every $d$-degenerate bipartite graph $G$ satisfies $\chi_f^{\mathrm{DP}} \le (1 + o(1))\frac{d}{\log d}$, and that this bound is optimal---a stark contrast to ordinary fractional coloring. In this paper, we extend this upper bound to all $d$-degenerate triangle-free graphs, proving that $\chi_f^{\mathrm{DP}} \le (4 + o(1))\frac{d}{\log d}$. This generalizes a recent result of Martinsson and Steiner (2025) for ordinary fractional coloring. We derive this result as a corollary of a more general upper bound concerning locally sparse graph orderings. Specifically, a $d$-degenerate graph $G$ is left $k$-locally-sparse if it admits a degeneracy ordering in which, for every vertex $v$, the subgraph induced by its back-neighbors contains at most $k$ edges. We show that if a $d$-degenerate graph $G$ is left $\frac{d^2}{f}$-locally-sparse, then \[ \chi_f^{\mathrm{DP}}(G) \le (8 + o(1))\frac{d}{\log f}. \] This immediately yields an identical upper bound on the ordinary fractional chromatic number $\chi_f(G)$, improving upon the leading constants of previously known bounds. Additionally, we establish the asymptotic sharpness of this result up to the leading constant. For any $1 \ll f \le d^2$, we construct $d$-degenerate graphs that are left $\frac{d^2}{f}$-locally-sparse and satisfy $\chi_f(G) \ge (1 - o(1))\frac{d}{\log f}$. Finally, as applications of our main theorem, we obtain improved upper bounds on the fractional DP-chromatic number of $d$-degenerate $K_{1,t,t}$-free graphs, as well as $K_{t,t,t}$-free graphs with maximum degree $\Delta$. Notably, these bounds improve upon existing results even in the setting of ordinary fractional coloring.

math.CO

Erd\H{o}s-S\'{o}s for digraphs

It is shown that every Eulerian digraph on $n$ vertices with more than $(t-1)n$ arcs contains every oriented tree with $t$ edges. The digraphs have no loops or repeated arcs, but opposite arcs are permitted. The bound is sharp for each fixed oriented tree, as witnessed by disjoint unions of complete bidirected graphs. Previously, such tight bounds were not known, even just for directed paths. This can be considered as a directed analog of the recently proved Erd\H{o}s-S\'os conjecture. The result was proved by GPT-6 Astra.

math.CO