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

Castelnuovo-Mumford regularity up to symmetry (1806.00457v3)

Published 1 Jun 2018 in math.AC

Abstract: We study the asymptotic behavior of the Castelnuovo-Mumford regularity along chains of graded ideals in increasingly larger polynomial rings that are invariant under the action of symmetric groups. A linear upper bound for the regularity of such ideals is established. We conjecture that their regularity grows eventually precisely linearly. We establish this conjecture in several cases, most notably when the ideals are Artinian or squarefree monomial.

Summary

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