3
$\begingroup$

Let $\Lambda_n$ be the algebra of all symmetric polynomials in $n$ variables, which we also consider as an infinite-dimensional vector $\mathbb{Q}$-space, whose basis is the Schur polynomials.

The product of two elements from $\Lambda_n$ can always be expressed as a linear combination of Schur polynomials, for example ($n=3$):

$$ (\boldsymbol{s}_{2,1,1}+2\boldsymbol{s}_{3,2,1})(\boldsymbol{s}_{2,0,0}+\boldsymbol{s}_{1,1,1})= 2\,\boldsymbol{s}_{{5,2,1}}+2\,\boldsymbol{s}_{{4,3,2}}+2\,\boldsymbol{s}_{{4,3,1} }+2\,\boldsymbol{s}_{{4,2,2}}+\boldsymbol{s}_{{4,1,1}}+2\,\boldsymbol{s}_{{3,3,2}} +\boldsymbol{s}_{{3,2,2}}+\boldsymbol{s}_{{3,2,1}} $$

On the other hand, $$ \boldsymbol{s}_{{3,0,0}}-\,\boldsymbol{s}_{{2,1,0}} +\boldsymbol{s}_{{1,1,1}} $$ cannot be expressed as a product of two non trivial elements from $\Lambda_n$.

Question: Consider an arbitrary element of $\Lambda_n$: $$ A= \sum_{\lambda} c_\lambda \boldsymbol{s}_{\lambda}, c_\lambda \in \mathbb{Q}, $$ where the sum is taken over a certain set of partitions $\lambda$.

Is there any criterion, in terms of the coefficients $c_\lambda$, that $A$ be the product of two symmetric polynomials?

Of course, we can express $A$ as polynomials in terms of, for example, the elementary symmetric polynomials $\boldsymbol{e}_i$ and then try to factorize it in the ring of polynomials, but I am interested in an intrinsic criterion, in terms of the coefficients $c_\lambda$.

Thank you.

$\endgroup$
5
  • $\begingroup$ Are you looking for an if and only if criterion, or maybe just a sufficient and/or necessary condition? It seems highly implausible that there would be any useful exact condition. $\endgroup$ Commented Dec 3, 2023 at 9:22
  • $\begingroup$ I would be content with a sufficient and/or necessary condition. While I understand that an if and only if criterion might be overly ambitious or implausible, any insights or partial conditions that could be applied to identify whether an element is a product of two symmetric polynomials would be valuable . $\endgroup$ Commented Dec 3, 2023 at 10:28
  • 3
    $\begingroup$ This looks very difficult, in any basis. In the elementary symmetric function basis, one is asking for criteria for an ordinary polynomial to be irreducible, which is a highly nontrivial problem. In the Schur basis, even determining whether a given symmetric function can be factored as $s_\lambda s_\mu$ requires the Littlewood–Richardson rule, which again is highly nontrivial. $\endgroup$ Commented Dec 3, 2023 at 14:08
  • $\begingroup$ How did you show that your example can't be expressed as a product? $\endgroup$ Commented Jun 21 at 19:56
  • $\begingroup$ The polynomial is ${x_{{1}}}^{3}+{x_{{2}}}^{3}+{x_{{3}}}^{3}.$ $\endgroup$ Commented Jun 23 at 11:30

0

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.