Related papers: Computing subfields of number fields and applicati…
We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…
We carry out some of Galois's work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial…
In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we…
Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate…
For every number field and every Cartan Killing type, there is an associated split simple algebraic group. We examine whether the corresponding arithmetic subgroups are profinitely solitary so that the commensurability class of the…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…
We generalise Gabidulin codes to the case of infinite fields, eventually with characteristic zero. For this purpose, we consider an abstract field extension and any automorphism in the Galois group. We derive some conditions on the…
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…
We compute the Galois groups for a certain class of polynomials over the the field of rational numbers that was introduced by S. Mori and study the monodromy of corresponding hyperelliptic jacobians.
We realize infinitely many covering groups $2.A_n$ (where $A_n$ is the alternating group) as the Galois group of everywhere unramified Galois extensions over infinitely many quadratic number fields. After several predecessor works…
Motivated by developing algorithms that decide hypertranscendence of solutions of extensions of the Bessel differential equation, algorithms computing the unipotent radical of a parameterized differential Galois group have been recently…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
In this paper, we will calculate the number of Galois extensions of local fields with Galois group A_n and S_n.
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
In this paper we present the notions of trail (pseudo-)division, generalized subresultants and generalized subresultant algorithm.
We introduce a cohomology set for groups defined by algebraic difference equations and show that it classifies torsors under the group action. This allows us to compute all torsors for large classes of groups. We also develop some tools for…
Over a global field (number field or function field of a curve over a finite field), theorems for the Galois cohomology of algebraic groups have long been known. For $F$ the function field of a curve over the formal series field…