A smooth everywhere-finite counterexample for linear constraints on symmetric functions
Statement
Consider the system of equations
where for all . Suppose that this system is solvable with the in modulo every prime . Fix , and let be the -th symmetric function of . (E.g., .) Must this system have integer solutions for ? What happens if we add more rows or columns?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.