English
Related papers

Related papers: Computing Galois groups of Ehrhart polynomials in …

200 papers

We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…

Number Theory · Mathematics 2023-04-11 Nicolas Mascot

We propose an explicit and practical algorithm for computing Galois conjugates and irreducible polynomials for special values of modular functions evaluated at CM points associated with imaginary quadratic orders. Our approach builds upon…

Number Theory · Mathematics 2025-06-18 Ja Kyung Koo , Dong Hwa Shin , Dong Sung Yoon

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

Number Theory · Mathematics 2016-12-20 Joachim König

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…

Algebraic Geometry · Mathematics 2016-07-26 Annette Bachmayr , Michael Wibmer

Counting number fields with prescribed Galois group is an enduring challenge in arithmetic statistics. Using the determinant method, we provide an upper bound for even groups, which is new in some cases.

Number Theory · Mathematics 2026-04-06 Sam Chow , Rainer Dietmann

We construct plane models of the modular curve $X_H(\ell)$, and use their explicit equations to compute Galois representations associated to modular forms for values of $\ell$ that are significantly higher than in prior works.

Number Theory · Mathematics 2014-03-19 Maarten Derickx , Mark van Hoeij , Jinxiang Zeng

First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…

Combinatorics · Mathematics 2011-11-07 Eugen J. Ionascu

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

Symbolic Computation · Computer Science 2020-05-06 Tao Zheng

Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…

History and Overview · Mathematics 2011-08-24 Leonid Lerner

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

Algebraic Geometry · Mathematics 2016-05-26 Jonathan D. Hauenstein , Jose Israel Rodriguez , Frank Sottile

We present a method for computing complete lists of number fields in cases where the Galois group, as an abstract group, appears as a Galois group in smaller degree. We apply this method to find the twenty-five octic fields with Galois…

Number Theory · Mathematics 2016-11-11 John W. Jones , David P. Roberts

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

Number Theory · Mathematics 2023-10-11 Zoé Yvon

We study Ehrhart series with coefficients in Abelian group rings. This opens new enumeration applications and unifies earlier variants, in particular, polynomial weighted, $q$-weighted, and equivariant Ehrhart series.

Combinatorics · Mathematics 2025-11-14 Robert Davis , Jesús A. De Loera , Alexey Garber , Katharina Jochemko , Josephine Yu

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…

Group Theory · Mathematics 2026-01-12 Willem A. de Graaf

In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…

Number Theory · Mathematics 2016-03-18 Eugen J. Ionascu

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…

Number Theory · Mathematics 2025-04-24 Fabrice Etienne

Based on the analogies between mapping class groups and absolute Galois groups, we introduce an arithmetic pro-$\ell$ analogue of Orr invariants for a Galois element associated with Galois action on \'etale fundamental groups of punctured…

Number Theory · Mathematics 2022-04-29 Hisatoshi Kodani , Yuji Terashima

We classify Galois objects for the dual of a group algebra of a finite group over an arbitrary field.

Quantum Algebra · Mathematics 2010-06-22 Cesar Galindo , Manuel Medina

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Mathematical Physics · Physics 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

For each of the groups PSL2(F25), PSL2(F32), PSL2(F49), PGL2(F25), and PGL2(F27), we display the first explicitly known polynomials over Q having that group as Galois group. Each polynomial is related to a Galois representation associated…

Number Theory · Mathematics 2011-10-03 Johan Bosman