Related papers: Computational class field theory
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.
We classify all division algebras that are principal Albert isotopes of a cyclic Galois field extension of degree $n>2$ up to isomorphisms. We achieve a ``tight'' classification when the cyclic Galois field extension is cubic. The…
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great…
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is…
We study the problem of computer-assisted teaching with explanations. Conventional approaches for machine teaching typically only provide feedback at the instance level e.g., the category or label of the instance. However, it is intuitive…
Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…
We obtain the extended genus field of an abelian extension of a rational function field. We follow the definition of Angl\`es and Jaulent, which uses class field theory. First we show that the natural definition of extended genus field of a…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We survey some results relating noncommutative geometry to the class field theory of number fields. These results appear within the context of quantum statistical mechanics where some arithmetic properties of a given number field can be…
Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…
We construct in a rigorous mathematical way interacting quantum field theories on a p-adic spacetime. The main result is the construction of a measure on a function space which allows a rigorous definition of the partition function. The…
In this article we prove lower and upper bounds for class numbers of algebraic curves defined over finite fields. These bounds turn out to be better than most of the previously known bounds obtained using combinatorics. The methods used in…
We study isogeny classes of abelian varieties over a function field in one variable over the field of complex numbers.
Lenstra introduced the notion of the Euclidean ideal class, a generalization of the Euclidean domain that captures cyclic class groups. In this article, we establish the existence of Euclidean ideal classes in abelian quartic fields. As a…
We give an algebraic proof of a class number formula for dihedral extensions of number fields of degree $2q$, where $q$ is any odd integer. Our formula expresses the ratio of class numbers as a ratio of orders of cohomology groups of units…
We prove, under some mild hypothesis, that an \'etale cover of curves defined over a number field has infinitely many specializations into an everywhere unramified extension of number fields. This constitutes an "absolute" version of the…
Machine learning presents a general, systematic framework for the generation of formal theoretical models for physical description and prediction. Tentatively standard linear modeling techniques are reviewed; followed by a brief discussion…
This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…
This book describes some computational methods to deal with modular characters of finite groups. It is the theoretical background of the MOC system of the same authors. This system was, and is still used, to compute the modular character…