On the computation of graded components of Laurent polynomial rings
Sonia L. Rueda
Abstract
In this paper, we present several algorithms for dealing with graded components of Laurent polynomial rings. To be more precise, let S be the Laurent polynomial ring k[x1,...,xr,xr+1 1,..., xn 1], k algebraicaly closed field of characteristic 0. We define the multigrading of S by an arbitrary finitely generated abelian group A. We construct a set of fans compatible with the multigrading and use this fans to compute the graded components of S using polytopes. We give an algorithm to check whether the graded components of S are finite dimensional. Regardless of the dimension, we determine a finite set of generators of each graded component as a module over the component of homogeneous polynomials of degree 0.
Create a lesson
Related papers
On the weak Lefschetz property of Artinian Gorenstein algebras of codimension three in arbitrary characteristic
Omkar Javadekar
Linear Independence of Polynomial Compositions and Identifiability of Deep Neural Networks
Kathlén Kohn, Giovanni Luca Marchetti, Alex Massarenti et al.
Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals
Trung Chau, Tài Huy Hà, A. V. Jayanthan et al.
Polynomial extensions do not preserve the strong finite type property
Viet-Hoang Tran, Phan Thanh Toan, Thieu N. Vo et al.
Reduction numbers for witnesses to the generalized Loewy length
Richard Bartels, Sarah Dajani, Gabriel Koomson
Multi-graded generic initial ideals, regularity, and the optimal colorful fractional Helly theorem for d-Leray complexes
Daniel McGinnis