On the computation of graded components of Laurent polynomial rings

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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[x_1,...,x_{r},x_{r+1}^{\pm 1},..., x_n^{\pm 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the computation of graded components of Laurent polynomial rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the computation of graded components of Laurent polynomial rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the computation of graded components of Laurent polynomial rings will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-630874

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.