Growth of rank 1 valuation semigroups

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages

Scientific paper

We consider the question of which semigroups can occur as the semigroup $S_R(\nu)$ of positive values of a rank 1 valuation dominating a Noetherian local ring $R$. We give a number of bounds of polynomial type on the growth of $\phi(n)=S_R(\nu)\cap (0,n)$ for $n\in\NN$, starting with the upper bound of $P_R(n)$, where $P_R(n)$ is the Hilbert function of $R$. This bound is generalized to an extremely general bound for arbitrary rank valuations in the paper "Semigroups of valuations on local rings, II", by Cutkosky and Teissier, arXiv:0805.3788. This bound is already enough to give simple examples of rank 1 well ordered semigroups which are not the value semigroup $S_R(\nu)$ of a valuation dominating a Noetherian local ring. In the case of rank 1, it is possible to give more precise estimates of $\phi(n)$, which we prove in this paper. We also give examples showing that many different rates of growth are possible for $\phi(n)$ on a regular local ring of dimension 2, such as $n({\alpha}$ for any rational $\alpha$ with $1\le\alpha\le 2$, and $n{log}(n)$.

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

Growth of rank 1 valuation semigroups 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 Growth of rank 1 valuation semigroups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Growth of rank 1 valuation semigroups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-311476

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