Search arXivSearch

arXiv · 2507.06220

On the generalised Foulkes conjecture for $\mathrm{SL}_2(\mathbb{C})$ under divisibility conditions

Abstract

The generalised Foulkes conjecture for $\mathrm{SL}_2(\mathbb{C})$ was recently proved under mild divisibility conditions by Raicu, Sam, Weyman, and Yang, who showed surjectivity of the Foulkes--Howe map through a geometric and homological approach. As an immediate corollary, we note partial proofs of related conjectures by Bergeron, Zanello, and Troyka. The main result of this paper is that the dual of the (geometric) Foulkes--Howe map is the (combinatorial) $k$-fold plethystic substitution, which admits an explicit and straightforward definition. We derive several formulas and combinatorial interpretations for its structure constants. We briefly remark on an unexpected corollary that settles a conjecture in condensed matter physics. Finally, we use the combinatorial properties of the $k$-fold map to propose candidate maps towards other variants of Foulkes' conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Moritz Gangl, Álvaro Gutiérrez, Michał Szwej. 2026-07-01. On the generalised Foulkes conjecture for $\mathrm{SL}_2(\mathbb{C})$ under divisibility conditions. https://arxiv.org/abs/2507.06220

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