Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 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

Explicit Stillman bounds for all degrees (2009.02826v3)

Published 6 Sep 2020 in math.AC

Abstract: In 2016 Ananyan and Hochster proved StiLLMan's conjecture by showing the existence of a uniform upper bound for the projective dimension of all homogeneous ideals, in polynomial rings over a field, generated by n forms of degree at most d. Explicit values of the bounds for forms of degrees 5 and higher are not yet known. The main result of this article is the construction of explicit such bounds, for all degrees d, which behave like power towers of height d3/6+11d/6-4. This is done by establishing a bound D(k,d), which controls the number of generators of a minimal prime over an ideal of a regular sequence of k or fewer forms of degree d, and supplementing it into Ananyan and Hochster's proof in order to obtain a recurrence relation.

Summary

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