I would like to construct (or determine the existence/inexistence) of a polynomial $p(x_1,...,x_k, y_1,...,y_n)$ satisfying the following properties:
- $p$ is symmetric with relation to the variables $x_1,...,x_k$, in the sense that swapping any two of these variables do not alter the polynomial. Observe that for the variables $y_i$ no symmetry condition is imposed.
- $p$ has degree at most $k-1$.
- each variable in $\{x_1,...,x_k,y_1,...,y_n\}$ appears in at most $k-2$ monomials.
- $p$ is connected. By connectedness I mean that the graph whose vertices are monomials, and whose edges connect monomials having a common variable, is connected.
My question is: Given $k\in \mathbb{N}$, does such a polynomial $p(x_1,...,x_k,y_1,...,y_n)$ exists? Here the number $n$ of $y$ variables can be as large as needed.
Observation: The problem becomes trivial if any of the conditions above are removed. In particular no y variable is needed in this case.
- If p is not required to be connected, just take the polynomial $p=x_1+ x_2 + ... + x_k$
- If p can have degree k, then just take $p= x_1x_2...x_k$
- If a variable can appear in k-1 monomials, then take the polynomial $p=\sum_{i\neq j} x_1x_j$.
I would appreciate any proof of existence/inexistence of such polynomials, or a construction. References dealing with polynomials that are symmetric only in some variables are also welcome.