Papers
Topics
Authors
Recent
Search
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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.