arXiv (All)
open access
The Minimum Number of Generators of Symmetric Ideals
We study equigenerated symmetric ideals in polynomial rings and the minimum number of polynomials required to generate them up to permutations of the variables. We give a representation-theoretic formula for this number and determine a sharp threshold on the number of variables needed for a general
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Equal knapsack identities between symmetric group character degrees#1012061
- Simple generators of rational function fields#1104413
- The differential properties of certain permutation polynomials over finite fields#684157
- The differential properties of certain permutation polynomials over finite fields#682382
- Vanishing Ideals and the Computational Tractability of Sum-of-Squares over Boolean Domains#1142234
Record · ID 927130
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive