New upper bounds on Castelnuovo-Mumford regularity of monomial curves are given that are tighter than Lvovsky's bound under specific conditions, using Apery sets and Frobenius numbers, along with algorithms and sumset applications.
Brauer,On a problem of partitions
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
New bounds on Castelnuovo--Mumford regularity of monomial curves and application to sumsets
New upper bounds on Castelnuovo-Mumford regularity of monomial curves are given that are tighter than Lvovsky's bound under specific conditions, using Apery sets and Frobenius numbers, along with algorithms and sumset applications.