644 research outputs found
Algorithms in algebraic number theory
In this paper we discuss the basic problems of algorithmic algebraic number
theory. The emphasis is on aspects that are of interest from a purely
mathematical point of view, and practical issues are largely disregarded. We
describe what has been done and, more importantly, what remains to be done in
the area. We hope to show that the study of algorithms not only increases our
understanding of algebraic number fields but also stimulates our curiosity
about them. The discussion is concentrated of three topics: the determination
of Galois groups, the determination of the ring of integers of an algebraic
number field, and the computation of the group of units and the class group of
that ring of integers.Comment: 34 page
A Reduced Form for Linear Differential Systems and its Application to Integrability of Hamiltonian Systems
Let with be a differential linear
system. We say that a matrix is a {\em reduced
form} of if and there exists such that . Such a form is
often the sparsest possible attainable through gauge transformations without
introducing new transcendants. In this article, we discuss how to compute
reduced forms of some symplectic differential systems, arising as variational
equations of hamiltonian systems. We use this to give an effective form of the
Morales-Ramis theorem on (non)-integrability of Hamiltonian systems.Comment: 28 page
Definability of linear equation systems over groups and rings
Motivated by the quest for a logic for PTIME and recent insights that the
descriptive complexity of problems from linear algebra is a crucial aspect of
this problem, we study the solvability of linear equation systems over finite
groups and rings from the viewpoint of logical (inter-)definability. All
problems that we consider are decidable in polynomial time, but not expressible
in fixed-point logic with counting. They also provide natural candidates for a
separation of polynomial time from rank logics, which extend fixed-point logics
by operators for determining the rank of definable matrices and which are
sufficient for solvability problems over fields. Based on the structure theory
of finite rings, we establish logical reductions among various solvability
problems. Our results indicate that all solvability problems for linear
equation systems that separate fixed-point logic with counting from PTIME can
be reduced to solvability over commutative rings. Moreover, we prove closure
properties for classes of queries that reduce to solvability over rings, which
provides normal forms for logics extended with solvability operators. We
conclude by studying the extent to which fixed-point logic with counting can
express problems in linear algebra over finite commutative rings, generalising
known results on the logical definability of linear-algebraic problems over
finite fields
Computing N\'eron-Severi groups and cycle class groups
Assuming the Tate conjecture and the computability of \'etale cohomology with
finite coefficients, we give an algorithm that computes the N\'eron-Severi
group of any smooth projective geometrically integral variety, and also the
rank of the group of numerical equivalence classes of codimension p cycles for
any p.Comment: 22 pages; to appear in Compositio Mat
- …