Search arXivSearch

arXiv · 1911.12098

Cores and quotients of partitions through the Frobenius symbol

Abstract

The Frobenius symbol was first introduced in 1900 by Frobenius as a way to encode an integer partition. In 1941, motivated by the modular representation theory of the symmetric group, Nakayama introduced the idea of a p-core partition, for p prime, using hook removals. In the following decade, Robinson, Littlewood, Staal and Farahat codified the $p$-quotient of such a partition, using variations of the star diagram. Since the 1970s, the convention has been to build up the theory of both core and quotients with the abacus construction, first introduced by G. James. In this paper we return to the earlier point of view. First we show that, for any positive integer t, the t-core and t-quotient of an integer partition can be directly obtained from its Frobenius symbol. The argument also works in the opposite direction: that is, given the Frobenius symbol of a t-core and a $t$-tuple of Frobenius symbols, one can recover the Frobenius symbol of the corresponding partition. One immediate application is the calculation of the Durfee number of the associated partition from the Frobenius symbols of the core and quotient. In 1991, J. Scopes gathered together the $p$-core partitions into families to prove that Donovan's conjecture holds for the symmetric groups at the prime p. We describe, using our methods, the action of the affine Weyl group W_p of type $A$ on Frobenius symbols, and use this to parametrize and compute the explicit number of Scopes families. In particular we enumerate both the infinite and finite Scopes families. Core partitions have also attracted recent interest in number theory. By constructing explicit and combinatorial bijections, we revisit some well-known identities originally obtained using sophisticated methods. We end with a close study of the relationship between certain hooks in the quotient and certain hooks in the associated partition.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Olivier Brunat, Rishi Nath. 2019-11-27. Cores and quotients of partitions through the Frobenius symbol. https://arxiv.org/abs/1911.12098

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