Related papers: The m-step Solvable Mono-anabelian Geometry of Num…
In 1976, Onabe discovered that, in contrast to the Neukirch-Uchida results that were proved around the same time, a number field $K$ is not completely characterized by its absolute abelian Galois group $A_K$. The first examples of…
In this paper we give a survey of recent methods for the asymptotic and exact enumeration of number fields with given Galois group of the Galois closure. In particular, the case of fields of degree up to 4 is now almost completely solved,…
We present a family of algorithms for computing the Galois group of a polynomial defined over a $p$-adic field. Apart from the "naive" algorithm, these are the first general algorithms for this task. As an application, we compute the Galois…
By exploiting the arithmetic homotopy of the moduli spaces of curves, Galois-Teichm\"uller theory stands at the interface of braid-mapping class groups and of anabelian geometry. Starting from the classical braid-theoretic construction of…
For an integer $m\geq 2$, we aim to investigate the realizability of types of metacyclic-nonmodular groups, whose abelianization is $\mathbb{Z}/2 \mathbb{Z}\times\mathbb{Z}/2^m \mathbb{Z}$, as the Galois group of the maximal unramified…
Let $\mathcal{E}$ be a CM elliptic curve defined over a number field $K$, with Weiestrass form $y^3=x^3+bx$ or $y^2=x^3+c$. For every positive integer $m$, we denote by ${\mathcal{E}}[m]$ the $m$-torsion subgroup of ${\mathcal{E}}$ and by…
Let K be a number field and let $\mathcal{E}$ be an elliptic curve defined over $K$. Let $m$ be a positive integer. We denote by $K(\mathcal{E}[m])$ the number fields obtained by adding to $K$ the coordinates of the $m$-torsion points of…
The aim of this paper is to present an algorithm the complexity of which is polynomial to compute the semi-simplified modulo $p$ of a semi-stable $\Q_p$-representation of the absolute Galois group of a $p$-adic field (\emph{i.e.} a finite…
We give a new general technique for constructing and counting number fields with an ideal class group of nontrivial m-rank. Our results can be viewed as providing a way of specializing the Picard group of a variety V over $\mathbb{Q}$ to…
The goal of this paper is to demonstrate the use of techniques from hyperbolic geometry to compute generating sets of certain subgroups of $SL^+(2,\mathbb{C})$; specifically, $SO^+(Q,\mathbb{Z})$ for $Q$ some integral quadratic form of…
The $p$-group generation algorithm from computational group theory is used to obtain information about large quotients of the pro-2 group $G = \text{Gal} (k^{nr,2}/k)$ for $k = \mathbb{Q}(\sqrt{d})$ with $d = -445, -1015, -1595, -2379$. In…
For quadratic fields \(k=\mathbb{Q}(\sqrt{d})\) with discriminant \(d\), \(3\)-class group \(\mathrm{Cl}_3(k)\simeq (\mathbb{Z}/3\mathbb{Z})^2\), and four \textit{simple} \(3\)-principalization types \(\varkappa(k)\in\lbrace…
A finite group G is admissible over a field M if there is a division algebra whose center is M with a maximal subfield G-Galois over M. We consider nine possible notions of being admissible over M with respect to a subfield K of M, where…
Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$…
We fix a prime number $p$ and $\K$ a number field, we denote by $M$ the maximal abelian $p$-extension of $\Ko$ unramified outside $p$. The aim of this paper is to study the $\Z_p$-module $\gal(M/\Ko)$ and to give a method to effectively…
Unit group computations are a cryptographic primitive for which one has a fast quantum algorithm, but the required number of qubits is $\tilde O(m^5)$. In this work we propose a modification of the algorithm for which the number of qubits…
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…
We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…
The objective of this paper is to study the anabelian object referred to as \emph{pointed virtual curves}. Namely, given a family of curves $Y \rightarrow X$ over a field $k$ under suitable conditions, we consider the…
This work provides a method(an algorithm) for solving the solvable unary algebraic equation $f(x)=0$ ($f(x)\in\mathbb{Q}[x]$) of arbitrary degree and obtaining the exact radical roots. This method requires that we know the Galois group as…