Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13218Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Thoma, A. | en |
| dc.date.accessioned | 2015-11-24T17:26:31Z | - |
| dc.date.available | 2015-11-24T17:26:31Z | - |
| dc.identifier.issn | 0003-889X | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13218 | - |
| dc.rights | Default Licence | - |
| dc.subject | theoretic complete-intersections | en |
| dc.title | On the binomial arithmetical rank | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | <Go to ISI>://000085111400004 | - |
| heal.identifier.secondary | http://www.springerlink.com/content/4vuwxx4xa6bx6mxc/fulltext.pdf | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 2000 | - |
| heal.abstract | The binomial arithmetical rank of a binomial ideal I is the smallest integer s for which there exist binomials f(l)....,f(s), in I such that rad (I) = rad (f(l),...,f(s)). We completely determine the binomial arithmetical rank for the ideals of monomial curves in P-K(n). In particular we prove that. if the characteristic of the field K is zero, then bar (I(C)) = n - 1 if C is complete intersection, otherwise bar (I(C)) = n. While it is known that if the characteristic or the field K is positive, then bar (I(C)) = n - 1 always. | en |
| heal.publisher | Springer Verlag (Germany) | en |
| heal.journalName | Archiv Der Mathematik | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Thoma-2000-On the binomial arit.pdf | 66.75 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
