Related papers: Constructions using Galois Theory

We study toric varieties over a field k that split in a Galois extension K/k using Galois cohomology with coefficients in the toric automorphism group. Part of this Galois cohomology fits into an exact sequence induced by the presentation…

A Hopf Galois structure on a finite field extension L/K is given by a finite cocommutative K-Hopf algebra and a Hopf action. In this paper we present an algorithm written in the computational algebra system Magma which gives all Hopf Galois…

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

Constructing lattice isomorphic line arrangements that are not lattice isotopic is a complex yet fundamental task. In this paper, we focus on such pairs but which are not Galois conjugated, referred to as nonarithmetic pairs. Splitting…

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…

This is a guide to the construction of nonlinear number fields, which includes new points not found in our earlier article ``Geometric Galois theory, nonlinear number fields and a Galois group interpretation of the idele class group''.

Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division…

We classify all cubic extensions of any field of arbitrary characteristic, up to isomorphism, via an explicit construction involving three fundamental types of cubic forms. We deduce a classification of any Galois cubic extension of a…

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…

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 show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

This paper provides a realization of all classical and most exceptional finite groups of Lie type as Galois groups over function fields over F_q and derives explicit additive polynomials for the extensions. Our unified approach is based on…

The paper presents an algebraic technique for derivation of fast discrete cosine transform (DCT) algorithms. The technique is based on the algebraic signal processing theory (ASP). In ASP a DCT associates with a polynomial algebra…

For prime $p$ and small $n$, Jones and Roberts have developed a database recording invariants for $p$-adic extensions of degree $n$. We contributed to this database by computing the Galois slope content, Galois mean slope, and inertia…

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

Galois connections are a foundational tool for structuring abstraction in semantics and their use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois connections remains limited to restricted modes of…