Search arXivSearch

arXiv · 2203.08279

Splitting the square of homogeneous and elementary functions into their symmetric and anti-symmetric parts

Abstract

We consider the expansion of the square of a complete homogeneous function $h_λ$, or of an elementary symmetric function $e_λ$, in the basis of Schur functions. This square also decomposes into two plethysms, $s_2[h_λ]$ and $s_{11}[h_λ]$ (resp. $s_2[h_λ]$ and $s_{11}[h_λ]$), which are called its symmetric and anti-symmetric parts, respectively. We define a sign statistic on the set of tableaux that index the Schur functions appearing in the square of those symmetric functions. This sign statistic allows to determine to which plethysm each Schur function contributes. We use mainly combinatorial tools on tableaux (product on tableau and RSK) and basic manipulations on plethysm and symmetric functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florence Maas-Gariépy, Étienne Tétreault. 2022-03-15. Splitting the square of homogeneous and elementary functions into their symmetric and anti-symmetric parts. https://arxiv.org/abs/2203.08279

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