Related papers: Computing subfields of number fields and applicati…
Recently, we have introduced and studied the topic of sub-indices and sub-factors of groups. During those studies, an algorithm for obtaining the sub-factors of a finite group was stated and proved, which has a particular case for…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…
We give a complete characterization of all Galois subfields of the generalized Giulietti--Korchm\'aros function fields $\mathcal C_n / \fqn$ for $n\ge 5$. Calculating the genera of the corresponding fixed fields, we find new additions to…
We prove lower semicontinuity of the Galois groupoid of a vector field dependingon parameters. Apply to Painlev{\'e} equations, this result can be used to compute theirsGalois groupoids for general values of parameters.
In the first part of this paper we try to explain to a general mathematical audience some of the remarkable web of conjectures linking representations of Galois groups with algebraic geometry, complex analysis and discrete subgroups of Lie…
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a…
We describe a new algorithm for computing the ideal class group, the regulator and a system of fundamental units in number fields under the generalized Riemann hypothesis. We use sieving techniques adapted from the number field sieve…
A Galois theory of differential fields with parameters is developed in a manner that generalizes Kolchin's theory. It is shown that all connected differential algebraic groups are Galois groups of some appropriate differential field…
In this article we survey and examine the realizability of $p$-groups as Galois groups over arbitrary fields. In particular we consider various cohomological criteria that lead to necessary and sufficient conditions for the realizability of…
We introduce a criterion on the presentation of finitely presented pro-$p$ groups which allows us to compute their cohomology groups and infer quotients of mild groups of cohomological dimension strictly larger than two, from (non-free)…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
Given a field F, one may ask which finite groups are Galois groups of field extensions E/F such that E is a maximal subfield of a division algebra with center F. This question was originally posed by Schacher, who gave partial results over…
We show that a finite-dimensional tame division algebra D over a Henselian field F has a maximal subfield Galois over F if and only if its residue division algebra has a maximal subfield Galois over the residue field of F. This generalizes…
We enhance the analogy between field extensions and covering spaces by introducing the concept of splitting covering which correspondences to the splitting field in Galois theory. We define semi-topological Galois groups for Weierstrass…
We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
In this paper we give an algorithm to determine all finite matrix groups over a number field. Our algorithm is based on the representation theory of finite groups.
We study the Galois symbol map associated to the multiplicative group and an abelian variety which has good ordinary reduction over a $p$-adic field. As a byproduct, one can calculate the "class group" in the view of the class field theory…
This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…