For integers , Harman (2018) formulated a weak form of Foulkes' 1950 conjecture: for every multiset of total size , the number of multiset partitions of into blocks each of size is at least the number of multiset partitions of into blocks each of size . Equivalently, the plethysm difference of complete homogeneous symmetric functions has nonnegative coefficients in the monomial basis, whereas the full Foulkes conjecture asserts the same in the Schur basis. Since Schur positivity implies monomial positivity, every known case of full Foulkes (smallest parameter , plus stability and propagation regimes) transfers to the weak form, but no proof or counterexample is known for the general statement.
Background
A symmetric function is a bounded-degree formal power series in variables that is invariant under all permutations of the variables; the symmetric functions of degree form a vector space with several standard bases. The monomial symmetric function is the sum of all distinct monomials obtained by permuting the multiset of exponents given by a partition of . The complete homogeneous symmetric function is the sum of all monomials of total degree . The Schur functions , indexed by partitions , form the basis underlying the representation theory of symmetric groups, since the Frobenius characteristic map sends the irreducible Specht module of shape to . Plethysm is a special substitution operation on symmetric functions, denoted with square brackets , which builds the Frobenius characteristic of a wreath-product induction: for positive integers and , the Foulkes module is the induced representation , where (a wreath product) is the imprimitive subgroup of consisting of permutations that permute blocks of size among themselves; its Frobenius characteristic is the plethysm . In 1950 Foulkes conjectured, equivalently, that for the difference has nonnegative coefficients in the Schur basis; this is the Foulkes conjecture, one of the central open problems on plethysm coefficients. It is classical for the smaller parameter (Thrall, 1942), was settled for by the early 2000s (with Dent and Siemons handling ; surveyed in Pylyavskyy's 2004 paper), and was verified for by Cheung, Ikenmeyer, and Mkrtchyan (2017) using a computer calculation together with a propagation theorem of McKay (2008); Brion (1993) initiated the geometric and stable study of the conjecture, and Müller and Neunhöffer (2005) verified the coefficientwise comparison computationally in a range of degrees. A multiset partition of a multiset is an unordered collection of sub-multisets, called blocks, whose multiset union is . The coefficient of in counts exactly the multiset partitions of a multiset of content into blocks each of size , so the monomial coefficients of the two plethysms carry a purely combinatorial comparison. Because each Schur function expands into the monomial basis with nonnegative Kostka coefficients, Schur positivity of the Foulkes difference implies its monomial positivity, so the statement below is genuinely weaker than the full Foulkes conjecture. Harman (2018) derived this weak form from his study of polynomial representations of the general linear group restricted to the subgroup of monomial matrices (the torus of diagonal matrices semidirect product with permutation matrices): his framework identifies the relevant multiplicities with dimensions of spaces of permutation invariants in symmetrized weight spaces, and his combinatorial interpretation of the restriction of tensor products of symmetric powers reduces the monomial-coefficient comparison to counting multiset partitions. He records the resulting inequality as his Conjecture 4.4, the weak Foulkes conjecture, introduced as a purely combinatorial formulation of a weak version of Foulkes' conjecture for tensor products of symmetric powers; his remark that the formulation seems to be missing from much of the Foulkes literature concerns Conjecture 4.3, the mixed / form of the full conjecture. A nearby but distinct line of work (Black and List 1989; a rank conjecture of Stanley studied by Pylyavskyy 2004 and Sivek 2006) attacks the full conjecture through ranks of 0-1 incidence matrices between set-partition classes; both Stanley's original formulation and Pylyavskyy's reformulation were shown false in general, and that rank-based line leaves the monomial-coefficient inequality untouched.
Problem Statement
Prove or disprove the weak Foulkes conjecture of Harman (arXiv:1804.04702, Conjecture 4.4), a strictly weaker consequence of the 1950 Foulkes conjecture: for all integers and every multiset of total cardinality , the number of multiset partitions of into blocks each of size is at least the number of multiset partitions of into blocks each of size (blocks are sub-multisets and the collection of blocks is unordered). Equivalently: for all , the plethysm difference of complete homogeneous symmetric functions has nonnegative coefficients when expanded in the monomial basis . Currently the inequality is established only in the cases inherited from verified cases of the full (Schur-basis) Foulkes conjecture, namely smallest parameter and the stability/propagation regimes; the general statement is open.
References
- Nate Harman, Representations of monomial matrices and restriction from to , arXiv:1804.04702 (2018). https://arxiv.org/abs/1804.04702
- H. O. Foulkes, Concomitants of the quintic and sextic up to degree four in the coefficients of the ground form, Journal of the London Mathematical Society s1-25 (1950) 205-209, DOI 10.1112/jlms/s1-25.3.205. https://doi.org/10.1112/jlms/s1-25.3.205
- R. M. Thrall, On Symmetrized Kronecker Powers and the Structure of the Free Lie Ring, American Journal of Mathematics 64 (1942) 371-388, DOI 10.2307/2371691. https://doi.org/10.2307/2371691
- S. C. Black and R. J. List, A Note on Plethysm, European Journal of Combinatorics 10 (1989) 111-112, DOI 10.1016/S0195-6698(89)80039-3. https://doi.org/10.1016/S0195-6698(89)80039-3
- Michel Brion, Stable properties of plethysm: on two conjectures of Foulkes, Manuscripta Mathematica 80 (1993) 347-371, DOI 10.1007/BF03026558. https://doi.org/10.1007/BF03026558
- Suzie C. Dent and Johannes Siemons, On a Conjecture of Foulkes, Journal of Algebra 226 (2000) 236-249, DOI 10.1006/jabr.1999.8169. https://doi.org/10.1006/jabr.1999.8169
- Jürgen Müller and Max Neunhöffer, Some Computations Regarding Foulkes' Conjecture, Experimental Mathematics 14 (2005) 277-283, DOI 10.1080/10586458.2005.10128928. https://doi.org/10.1080/10586458.2005.10128928
- Tom McKay, On plethysm conjectures of Stanley and Foulkes, Journal of Algebra 319 (2008) 2050-2071, DOI 10.1016/j.jalgebra.2007.12.003. https://doi.org/10.1016/j.jalgebra.2007.12.003
- Pavlo Pylyavskyy, On Plethysm Conjectures of Stanley and Foulkes: The Case, The Electronic Journal of Combinatorics 11(2) (2004), Article R8, DOI 10.37236/1865, arXiv:math/0406539. https://arxiv.org/abs/math/0406539
- Steven Sivek, Some Plethysm Results related to Foulkes' Conjecture, The Electronic Journal of Combinatorics 13(1) (2006), Article R24, DOI 10.37236/1050. https://doi.org/10.37236/1050
- Man-Wai Cheung, Christian Ikenmeyer, and Sevak Mkrtchyan, Symmetrizing tableaux and the 5th case of the Foulkes conjecture, Journal of Symbolic Computation 80 (2017) 833-843, DOI 10.1016/j.jsc.2016.09.002, arXiv:1509.03944. https://arxiv.org/abs/1509.03944
- Sridhar Narayanan, Digjoy Paul, and Shraddha Srivastava, The Multiset Partition Algebra, arXiv:1903.10809 (2019). https://arxiv.org/abs/1903.10809
- Chris Bowman and Rowena Paget, The partition algebra and the plethysm coefficients I: Stability and Foulkes' conjecture, Journal of Algebra 655 (2024) 110-138, DOI 10.1016/j.jalgebra.2023.08.042, arXiv:1809.08128. https://arxiv.org/abs/1809.08128