English
Related papers

Related papers: A database for field extensions of the rationals

200 papers

A Galois scaffold, in a Galois extension of local fields with perfect residue fields, is an adaptation of the normal basis to the valuation of the extension field, and thus can be applied to answer questions of Galois module structure. Here…

Number Theory · Mathematics 2011-06-21 Nigel P. Byott , G. Griffith Elder

In this paper, we develop an explicit method to express finite algebraic numbers (in particular, certain idempotents among them) in terms of linear recurrent sequences, and give applications to the characterization of the splitting primes…

Number Theory · Mathematics 2024-05-14 Julian Rosen , Yoshihiro Takeyama , Koji Tasaka , Shuji Yamamoto

Some aspects of Computer Algebra (notably Computation Group Theory and Computational Number Theory) have some good databases of examples, typically of the form "all the X up to size n". But most of the others, especially on the polynomial…

Symbolic Computation · Computer Science 2022-10-31 James Harold Davenport

We describe several families of permutation polynomials obtained using functions with linear translators.

Number Theory · Mathematics 2009-05-08 Gohar M. Kyureghyan

For every finite field F and every positive integer r, there exists a finite extension F' of F such that either SO(2r+1,F') or its simple derived group can be realized as a Galois group over Q. If the characteristic of F is 3 or 5 (mod 8),…

Number Theory · Mathematics 2008-07-08 Chandrashekhar Khare , Michael Larsen , Gordan Savin

In this paper we discuss applications of our earlier work in studying certain Galois groups and splitting fields of rational functions in $\mathbb Q\left(X_0(N)\right)$ using Hilbert's irreducibility theorem and modular forms. We also…

Number Theory · Mathematics 2022-02-22 Iva Kodrnja , Goran Muić

We prove the existence of certain rationally rigid triples E8 in good characteristic and thereby show that these groups over the prime field occur as Galois groups over the field of rational numbers. We show that these triples give rise to…

Group Theory · Mathematics 2019-02-20 Robert Guralnick , Gunter Malle

We introduce and study a class of field extensions that we call pre-Galois; viz. extensions that become Galois after some linearly disjoint Galois base change. Among them are geometrically Galois extensions of k(T), with k a field:…

Number Theory · Mathematics 2020-06-11 David Harbater , Pierre Dèbes

This paper deals with the Weak Inverse Galois Problem which, for a given field $k$, states that, for every finite group $G$, there exists a finite separable extension $L/k$ such that ${\rm{Aut}}(L/k)=G$. One of its goals is to explain how…

Number Theory · Mathematics 2018-05-14 Bruno Deschamps , François Legrand

This paper extends Hopf-Galois theory to infinite field extensions and provides a natural definition of subextensions. For separable (possibly infinite) Hopf-Galois extensions, it provides a Galois correspondence. This correspondence also…

Number Theory · Mathematics 2024-04-11 Hoan-Phung Bui , Joost Vercruysse , Gabor Wiese

We say a tame Galois field extension $L/K$ with Galois group $G$ has trivial Galois module structure if the rings of integers have the property that $\Cal{O}_{L}$ is a free $\Cal{O}_{K}[G]$-module. The work of Greither, Replogle, Rubin, and…

Number Theory · Mathematics 2007-05-23 Marc Conrad , Daniel R. Replogle

I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…

Computer Vision and Pattern Recognition · Computer Science 2025-07-15 Timothy Duff

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…

Logic · Mathematics 2024-07-08 Wesley Calvert , Valentina Harizanov , Alexandra Shlapentokh

Retrieval-Augmented Generation (RAG) quality depends on many interacting choices across retrieval, ranking, augmentation, prompting, and generation, so optimizing modules in isolation is brittle. We introduce RAGSmith, a modular framework…

Computation and Language · Computer Science 2025-11-04 Muhammed Yusuf Kartal , Suha Kagan Kose , Korhan Sevinç , Burak Aktas

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…

Representation Theory · Mathematics 2020-11-17 Andrei Minchenko , Alexey Ovchinnikov

In this article we present a new method to obtain polynomial lower bounds for Galois orbits of torsion points of one dimensional group varieties.

Number Theory · Mathematics 2019-02-21 Harry Schmidt

We establish several surjectivity theorems regarding the Galois groups of small iterates of $\phi_c(x)=x^2+c$ for $c\in\mathbb{Q}$. To do this, we use explicit techniques from the theory of rational points on curves, including the method of…

Number Theory · Mathematics 2017-09-27 Wade Hindes

In this paper, we present methods to simplify reducible linear differential systems before solving. Classical integrals appear naturally as solutions of such systems. We will illustrate the methods developed in a previous paper on several…

Classical Analysis and ODEs · Mathematics 2021-09-30 Thomas Dreyfus , Jacques-Arthur Weil

We consider rational functions of the form $V(x)/U(x)$, where both $V(x)$ and $U(x)$ are polynomials over the finite field $\mathbb{F}_q$. Polynomials that permute the elements of a field, called {\it permutation polynomials ($PPs$)}, have…

Combinatorics · Mathematics 2021-03-26 Sergey Bereg , Brian Malouf , Linda Morales , Thomas Stanley , I. Hal Sudborough

One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla
‹ Prev 1 8 9 10 Next ›