2000 character limit reached
Big polynomial rings and Stillman's conjecture
Published 30 Jan 2018 in math.AC | (1801.09852v5)
Abstract: The purpose of this paper is to prove that certain limits of polynomial rings are themselves polynomial rings, and show how this observation can be used to deduce some interesting results in commutative algebra. In particular, we give two new proofs of Stillman's conjecture. The first is similar to that of Ananyan-Hochster, though more streamlined; in particular, it establishes the existence of small subalgebras. The second proof is completely different, and relies on a recent noetherianity result of Draisma.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.