The divisor classes of the surface \(z^ p=G(x,y)\), a programmable problem
type: Item
instance of: scholarly article
title: The divisor classes of the surface \(z^ p=G(x,y)\), a programmable problem
zbMATH Open document ID: 0627.14001
DOI: 10.1016/0021-8693(86)90108-0
author: Jeffrey Lang
author: Piotre Blass
author: David Joyce
published in: Journal of Algebra
publication date: 1986-01-01T00:00:00Z
review text: The twin fields of research, computational algebraic geometry and computational number theory, have during the last ten years been the scene of an increasing and lively research activity. Drawing from the enormous wealth of mathematical substance accumulated in two of the oldest mathematical disciplines, number theory and algebraic geometry, on the one hand, and the vast open possibilities of the newest of our sciences, computer science, on the other, this should not be surprising. - The mutual enrichment of the two sides of this dialogue can hardly be overemphasized: Techniques from algebraic geometry and number theory can for instance yield new information in complexity theory or in coding theory, while the computational tools developed and under development in computer science, such as symbolic manipulation and computer algebra, parallel processing or more advanced ideas from research in artificial intelligence, carry a great potential for the advancement of mathematics in general and algebraic geometry and number theory in particular. On a more modest level one frequently finds that rather simple mathematical techniques can acquire new and increased power when utilized in a modern computational setting. Even if no ``new theorems'' are proved, new information is gained in several ways: Computations of explicit examples may show patterns, and pave the road for future theoretical advances. The computational techniques employed may carry over to similar situations, and thus be of general significance even if the work in question is of a rather special nature. The paper under review falls into this last category. Let k be an algebraically closed field of characteristic \(p>0.\) Let \(F\subset {\mathbb{A}}^ 3_ k\) be an affine surface defined by an equation of the form \(z^ p=G(x,y)\) where \(G(x,y)\in k[x,y]\). The article develops an algorithm for computing the divisor class group \(Cl(F)\) of F. It is assumed that \(\partial G/\partial x\) and \(\partial G/\partial…
Mathematics Subject Classification ID: 14-04
Mathematics Subject Classification ID: 14J25
Mathematics Subject Classification ID: 14C20
zbMATH DE Number: 4019198
zbMATH Keywords: algorithm for computing the divisor class group
reviewed by: Audun Holme
MaRDI profile type: MaRDI publication profile
full work available at URL: 0021-8693(86)90108-0
OpenAlex ID: W2087925141
cites work: Q3674819
cites work: Q3762444
cites work: Q5670698
cites work: Q5328221
cites work: An example related to the affine theorem of Castelnuovo
cites work: The Divisor Classes of the Hypersurface z p m = G(x 1 , � ,x n ) in Characteristic p > 0
cites work: The divisor class group of the surface \(\exp(p^ n\cdot \log Z)=G(X,Y)\) over fields of characteristic \(p>0\)
cites work: Lectures on unique factorization domains. Notes by M. Pavman Murthy
cites work: Classes de diviseurs et dérivées logarithmiques
Recommended article: The divisor class group of splittable Zariski surfaces
Recommended article: THE DIVISOR CLASS GROUP OF SURFACES OVER FINITE FIELDS
Recommended article: Q3000088
Recommended article: A new algorithm for computing class groups of Zariski surfaces
Recommended article: Q4204807
Recommended article: Q5506320
Recommended article: Divisors on some generic hypersurfaces
Recommended article: Divisors of bielliptic surfaces and embeddings in \({\mathbb{P}}^ 4\)
Recommended article: Some Classical Problems in Number Theory via the Theory of K3 Surfaces
Recommended article: Computing Class Polynomials for Abelian Surfaces
description: scientific article; zbMATH DE number 4019198