Search arXiv⌕ Search

arXiv · 2403.03443

Hook restriction coefficients

Abstract

The permutation matrices form a subgroup of $\text{GL}_n(\mathbb{C})$ that is isomorphic to the symmetric group $S_n$. Let $r_{μλ}$ denote the multiplicity of the irreducible representation $V_μ$ of $S_n$, corresponding to a partition $μ$ of $n$, in the restriction of an irreducible polynomial representation $W_λ(\mathbb{C})$ of $\text{GL}_n(\mathbb{C})$, corresponding to a partition $λ$ with at most $n$ parts. Finding a combinatorial interpretation for $r_{μλ}$ remains an open problem in algebraic combinatorics, called the \emph{restriction problem}. We derive a new nonrecursive expression for a character polynomial called the \emph{Specht polynomial} and use it to find a combinatorial interpretation of $r_{μλ}$ when $λ$ is a hook-shaped partition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sridhar P. Narayanan. 2025-12-17. Hook restriction coefficients. https://arxiv.org/abs/2403.03443

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

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗