Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stillman's conjecture via generic initial ideals (1802.10139v2)

Published 27 Feb 2018 in math.AC and math.AG

Abstract: Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse lexicographic order. We then combine this result with the first author's work on topological Noetherianity of polynomial functors to give an algorithmic proof of the following statement: ideals in polynomial rings generated by a fixed number of homogeneous polynomials of fixed degrees only have a finite number of possible generic initial ideals, independently of the number of variables that they involve and independently of the characteristic of the ground field. Our algorithm outputs not only a finite list of possible generic initial ideals, but also finite descriptions of the corresponding strata in the space of coefficients.

Summary

We haven't generated a summary for this paper yet.