Regularity and multiplicity of Veronese type algebras

Abstract In this article, we study the algebra of Veronese type. We show that the presentation ideal of this algebra has an initial ideal whose Alexander dual has linear quotients. As an application, we explicitly obtain the Castelnuovo–Mumford regularity of the Veronese type algebra. Furthermore, we give an effective upper bound on the multiplicity of this algebra.

Authors

Institutions

Publication Details

Journal
Canadian Mathematical Bulletin
Published
2025-08-08
DOI
https://doi.org/10.4153/s0008439525100970
Citations
1
Primary Topic
Advanced Topics in Algebra
Type
article
Field-Weighted Citation Impact
5.38
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Regularity and multiplicity of Veronese type algebras

Yi-Huang Shen, Kuei-Nuan Lin
1 citations
Canadian Mathematical Bulletin
Advanced Topics in Algebra
5.38
article

Regularity and multiplicity of Veronese type algebras

Yi-Huang Shen, Kuei-Nuan Lin
article en
1 citations

Abstract

Abstract In this article, we study the algebra of Veronese type. We show that the presentation ideal of this algebra has an initial ideal whose Alexander dual has linear quotients. As an application, we explicitly obtain the Castelnuovo–Mumford regularity of the Veronese type algebra. Furthermore, we give an effective upper bound on the multiplicity of this algebra.

Canadian Mathematical BulletinVol. 69(1)
University of Science and Technology of China (CN), Pennsylvania State University (US)
Openalex Percentile: Top 5%
Advanced Topics in Algebra
5.38
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.