Related papers: Computability for the absolute Galois group of $\m…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
Let $E$ be an elliptic curve over $\mathbb{Q}$, $p$ an odd prime number and $n$ a positive integer. In this article, we investigate the ideal class group $\mathrm{Cl}(\mathbb{Q}(E[p^n]))$ of the $p^n$-division field $\mathbb{Q}(E[p^n])$ of…
The power classes of a field are well-known for their ability to parameterize elementary $p$-abelian Galois extensions. These classical objects have recently been reexamined through the lens of their Galois module structure. Module…
In the first half of this paper, we outline the construction of a new class of abelian pro-$p$ groups, which covers all countably-based pro-$p$ groups. In the second half, we study them, and classify them up to topological isomorphism and…
Let $X$ be an algebraic scheme over an algebraically closed field and $\ell$ a prime number invertible on $X$. According to classical results (due essentially to A. Grothendieck, M. Artin and P. Deligne), the \'etale cohomology groups…
The goal of this paper is to develop a group-theoretic algorithm, to reconstruct a number field (together with its maximal m-step solvable ex- tension for some positive integer m \geq 3) from the maximal m+9-step solv- able quotient of its…
We describe the Sylow subgroups of Gal(Q) for an odd prime p, by observing and studying their decomposition as a semidirect product of Z_p acting on F, where F is a free pro-p group, and Z_p are the p-adic integers. We determine the finite…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
We give a complete answer to the analogue of Grothendieck conjecture on p-curvatures for q-difference equations defined over K(x), where K is any finitely generated extension of Q and q\in K can be either a transcendental or an algebraic…
Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…
Assume that $X$ and $Y$ are arithmetic schemes, i.e., integral schemes of finite types over $Spec(\mathbb{Z})$. Then $X$ is said to be quasi-galois closed over $Y$ if $X$ has a unique conjugate over $Y$ in some certain algebraically closed…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
Let $F$ be a number field with ring of integers $O_F$ and let $G$ be a finite group. We describe an approach to the study of the set of realisable classes in the locally free class group $Cl(O_FG)$ of $O_FG$ that involves applying the work…
We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.
We prove the Galois correspondence between the subgroups of a finite automorphism group G of a simple vertex operator algebra V and the vertex operator subalgebras of V containing the set V^G of G-invariants.
We apply the differential Galois theory for difference equations developed by Hardouin and Singer to compute the differential Galois group for a second-order linear $q$-difference equation with rational function coefficients. This Galois…
In this paper we will give a computation of the \'{e}tale fundamental group of an integral arithmetic scheme. For such a scheme, we will prove that the \'{e}tale fundamental group is naturally isomorphic to the Galois group of the maximal…