|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
26 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
The Qth-power algorithm in characteristic 0 | | Douglas A. Leonard
; | | Date: |
25 Jan 2013 | | Abstract: | The Qth-power algorithm produces a useful canonical P-module presentation for
the integral closures of certain integral extensions of
$P:=mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field
$mathbf{F}:=mathbf{Z}_q$ of $q$ elements. Here it is shown how to use this
for several small primes $q$ to reconstruct similar integral closures over the
rationals $mathbf{Q}$ using the Chinese remainder theorem to piece together
presentations in different positive characteristics, and the extended Euclidean
algorithm to reconstruct rational fractions to lift these to presentations over
$mathbf{Q}$. | | Source: | arXiv, 1301.6104 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER