English
Related papers

Related papers: Computing the fixing group of a rational function

200 papers

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

Number Theory · Mathematics 2007-08-16 Pietro Corvaja

In this paper we obtain new quantitative forms of Hilbert's Irreducibility Theorem. In particular, we show that if $f(X, T_1, \ldots, T_s)$ is an irreducible polynomial with integer coefficients, having Galois group $G$ over the function…

Number Theory · Mathematics 2016-02-02 Abel Castillo , Rainer Dietmann

In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…

Number Theory · Mathematics 2012-09-27 Jens-Dietrich Bauch

We compute explicit polynomials having the sporadic Higman-Sims group HS and its automorphism group Aut(HS) as Galois groups over the rational function field Q(t).

Number Theory · Mathematics 2016-12-20 Dominik Barth , Andreas Wenz

We construct extensions of the field of rational numbers with the Galois group G_2(F_p) by reducing p-adic representations attached to automorphic representations.

Number Theory · Mathematics 2014-06-17 Kay Magaard , Gordan Savin

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

Number Theory · Mathematics 2025-08-28 Thomas W. Mattman , Dylan Robertson-Figaniak , Zoe Steele

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Group Theory · Mathematics 2023-07-28 Mallika Roy , Enric Ventura

Given a global field K and a rational function phi defined over K, one may take pre-images of 0 under successive iterates of phi, and thus obtain an infinite rooted tree T by assigning edges according to the action of phi. The absolute…

Number Theory · Mathematics 2014-02-26 Rafe Jones

Let $k$ be a fixed finite geometric extension of the rational function field $\mathbb{F}_q(t)$. Let $F/k$ be a finite abelian extension such that there is an $\Fq$-rational place $\infty$ in $k$ which splits in $F/k$ and let $\mathcal{O}_F$…

Number Theory · Mathematics 2014-03-27 Ming-Deh Huang , Anand Kumar Narayanan

For a number field K with absolute Galois group G_K, we consider the action of G_K on the infinite tree of preimages of a point in K under a degree-two rational function phi, with particular attention to the case when phi commutes with a…

Number Theory · Mathematics 2015-08-18 Rafe Jones , Michelle Manes

We study the distribution of the Galois group of a random $q$-additive polynomial over a rational function field: For $q$ a power of a prime $p$, let $f=X^{q^n}+a_{n-1}X^{q^{n-1}}+\ldots+a_1X^q+a_0X$ be a random polynomial chosen uniformly…

Number Theory · Mathematics 2024-02-12 Lior Bary-Soroker , Alexei Entin , Eilidh McKemmie

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

Group Theory · Mathematics 2014-01-16 Oleg Bogopolski , Olga Maslakova

The main purpose of this paper is to describe the abelian part $\mathcal G^{ab}_{K}$ of the absolute Galois group of a global function field $K$ as pro-finite group. We will show that the characteristic $p$ of $K$ and the non $p$-part of…

Number Theory · Mathematics 2017-03-17 Bart de Smit , Pavel Solomatin

In our previous paper we describe the Galois module structures of $p$th-power class groups $K^\times/{K^{\times p}}$, where $K/F$ is a cyclic extension of degree $p$ over a field $F$ containing a primitive $p$th root of unity. Our…

Number Theory · Mathematics 2007-05-23 Jan Minac , John Swallow

We consider deterministic algorithms for the well-known hidden subgroup problem ($\mathsf{HSP}$): for a finite group $G$ and a finite set $X$, given a function $f:G \to X$ and the promise that for any $g_1, g_2 \in G, f(g_1) = f(g_2)$ iff…

Data Structures and Algorithms · Computer Science 2022-11-22 Zekun Ye , Lvzhou Li

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

Number Theory · Mathematics 2008-08-21 John McKay , David Sevilla

We determine the absolute differential Galois group of the field $\mathbb{C}(x)$ of rational functions: It is the free proalgebraic group on a set of cardinality $|\mathbb{C}|$. This solves a longstanding open problem posed by B.H. Matzat.…

Algebraic Geometry · Mathematics 2022-03-22 Annette Bachmayr , David Harbater , Julia Hartmann , Michael Wibmer

For any finite Galois field extension $\mathsf{K}/\mathsf{F}$, with Galois group $G = \mathrm{Gal}(\mathsf{K}/\mathsf{F})$, there exists an element $\alpha \in \mathsf{K}$ whose orbit $G\cdot\alpha$ forms an $\mathsf{F}$-basis of…

Symbolic Computation · Computer Science 2020-12-24 Mark Giesbrecht , Armin Jamshidpey , Éric Schost

We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…

Computational Complexity · Computer Science 2007-05-23 V. Arvind , Piyush P Kurur

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…

Computational Complexity · Computer Science 2009-02-08 Gábor Ivanyos , Marek Karpinski , Lajos Rónyai , Nitin Saxena