Polynomials with $S_n \times \mathbb{Z}_2$ symmetry Suppose that a polynomial $p(x_1\ldots x_n, y_1\ldots y_n)$ in $2n$ variables is invariant under the following operations:
1) $p(x_1\ldots x_n, y_1\ldots y_n)=p(y_1\ldots y_n, x_1\ldots x_n)$
2) $\forall \sigma\in S_n, p(x_1\ldots x_n, y_1\ldots y_n)=p(y_{\sigma(1)}\ldots y_{\sigma(n)}, x_{\sigma(1)}\ldots x_{\sigma(n)})$
In other words, the polynomial has a symmetry group $S_n \times \mathbb{Z}_2$.
My question is: is there a simple polynomial basis for polynomials of degree $\leq d$ with this symmetry? 
Clearly one can find a linear basis for such polynomials by taking monomials and applying all elements of the symmetry group. For example, a linear basis for this space is given by polynomials of the form 
$\displaystyle\sum_{i_1\neq i_2 \neq \ldots i_d =1}^{n} \left(x_{i_1}^{\alpha_1} x_{i_2}^{\alpha_2} \ldots x_{i_d}^{\alpha_d} y_{i_1}^{\beta_1} y_{i_2}^{\beta_2} \ldots y_{i_d}^{\beta_d}+ y_{i_1}^{\alpha_1} y_{i_2}^{\alpha_2} \ldots y_{i_d}^{\alpha_d} x_{i_1}^{\beta_1} x_{i_2}^{\beta_2} \ldots x_{i_d}^{\beta_d} \right)$
where $\alpha_1,\ldots, \alpha_d, \beta_1, \ldots \beta_d$ are a string of integers summing to $\leq d$. The size of this basis scales exponentially with $d$.
I'm asking if there's a much simpler polynomial basis. (In other words, if every such polynomial $p$ can be written as a polynomial $q$ in some simple basis elements, where $q$ is a generic polynomial). Ideally the number of elements in the basis would grow only polynomially with $d$. For example, in the case of polynomials on $n$ variables with symmetry group $S_n$, the elementary symmetric polynomials of degree $\leq  d$ are a simple polynomial basis for the space of $S_n$-symmetric polynomials of degree $\leq d$, with merely $d$ elements in the basis. (In contrast, a linear basis for this space has many elements, namely the number of partitions of $d$.) I'm asking if there is an analogous polynomial basis known for the case of $2n$ variables and symmetry group $S_n\times \mathbb{Z}_2$. Any suggestions are much appreciated.
 A: A) If by "polynomial basis" you mean, by analogy with the $S_n$ case, that there are invariants such that any invariant is uniquely a polynomial in them, then no, there is no such basis. This is the condition that the invariant subring is isomorphic to a polynomial algebra, and this happens if and only if the (permutation) group in question is generated by transpositions, by the Chevalley-Shephard-Todd theorem. So, the invariant rings for Young subgroups of $S_n$ (i.e. of the form $S_{n_1}\times S_{n_2} \times\dots\times S_{n_r}$ for some $n_1+\dots+n_r = n$, and each $S_{n_i}$ factor acting on a distinct set of $n_i$ indices) have a basis in this sense, but for no other permutation groups is there such a basis.
B) BUT, if you just want a set of generators, i.e. invariants such that every invariant is a polynomial in these ones (but not uniquely), then, by a general result of Manfred Gobel for all permutation groups (see here), your answer is supplied by:


*

*The product of all the variables $x_1\dots x_ny_1\dots y_n$, AND

*The set of orbit sums of "special monomials." A "special monomial" is a monomial such that the sequence of exponents in descending order never drops by more than 1, and contains zero. For example $x_1^3x_2x_6^3y_3^2$ is a special monomial, but $x_1^3x_6^3y_3^2$ is not special because the sequence of exponents is $3,3,2,0,\dots$, containing a drop of size 2. The highest-degree special monomials are the ones like $x_1^{2n-1}x_2^{2n-2}\dots x_n^ny_1^{n-1}\dots y_{n-1}$, of degree $\binom{2n}{2}$, so all in all you get a generating set in maximum degree $\binom{2n}{2}$.
There is lots of redundancy in this generating set, and it is only specific to your group in the sense that the orbit sums are for orbits of your group. The same method gives generators for any permutation group, with the same degree bound.
