Search arXivSearch

arXiv · 2402.03643

Generating functions for fixed points of the Mullineux map

Abstract

Mullineux defined an involution on the set of $e$-regular partitions of $n$. When $e=p$ is prime, these partitions label irreducible symmetric group modules in characteristic $p$. Mullineux's conjecture, since proven, was that this ``Mullineux map" described the effect on the labels of taking the tensor product with the one-dimensional signature representation. Counting irreducible modules fixed by this tensor product is related to counting irreducible modules for the alternating group $A_n$ in prime characteristic. In 1991, Andrews and Olsson worked out the generating function counting fixed points of Mullineux's map when $e=p$ is an odd prime (providing evidence in support of Mullineux's conjecture). In 1998, Bessenrodt and Olsson counted the fixed points in a $p$-block of weight $w$. We extend both results to arbitrary $e$, and determine the corresponding generating functions. When $e$ is odd but not prime the extension is immediate, while $e$ even requires additional work and the results, which are different, have not appeared in the literature.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David J. Hemmer. 2025-02-21. Generating functions for fixed points of the Mullineux map. https://arxiv.org/abs/2402.03643

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

KEEP EXPLORING

Related papers

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

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