Related papers: Algorithms in algebraic number theory
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
Algorithms for continuous optimization problems have a rich history of design and innovation over the past several decades, in which mathematical analysis of their convergence and complexity properties plays a central role. Besides their…
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost…
There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of…
This Ph.D. thesis contains original contributions to several areas within the disciplines of disordered systems, numerical linear algebra, and scientific computing: (1) Theoretical and numerical study of the errors caused by using certain…
Our Chapter in the upcoming Volume I: Computer Science and Software Engineering of Computing Handbook (Third edition), Allen Tucker, Teo Gonzales and Jorge L. Diaz-Herrera, editors, covers Algebraic Algorithms, both symbolic and numerical,…
In this paper we discuss the problem of performing elementary finite field arithmetic on a quantum computer. Of particular interest, is the controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms…
Given a number field, it is an important question in algorithmic number theory to determine all its subfields. If the search is restricted to abelian subfields, one can try to determine them by using class field theory. For this, it is…
The rapid development of artificial intelligence (AI) systems has created an urgent need for their scientific quantification. While their fluency across a variety of domains is impressive, AI systems fall short on tests requiring…
We deliver a call to arms for probabilistic numerical methods: algorithms for numerical tasks, including linear algebra, integration, optimization and solving differential equations, that return uncertainties in their calculations. Such…
In this exposition we discuss the theory of algebraic extensions of valued fields. Our approach is mostly through Galois theory. Most of the results are well-known, but some are new. No previous knowledge on the theory of valuations is…
This is a survey of algorithmic problems in group theory, old and new, motivated by applications to cryptography.
I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…
The main objective of this paper is to show that the notion of type which was developed within the frames of logic and model theory has deep ties with geometric properties of algebras. These ties go back and forth from universal algebraic…
We give an overview on recent results concerning additive unit representations. Furthermore the solutions of some open questions are included. The central problem is whether and how certain rings are (additively) generated by their units.…