Related papers: Computing Galois groups of Ehrhart polynomials in …
In this paper, we construct, for some $2$-groups $G$, explicit Galois extensions $E/\mathbb{Q}(T)$ of group $G$ with $E\cap\overline{\mathbb{Q}}=\mathbb{Q}$. We also provide explicit arithmetic progressions of integers $t_0$ such that the…
We describe algorithms to compute fixed fields, splitting fields and towers of radical extensions without using polynomial factorisation in towers or constructing any field containing the splitting field, instead extending Galois group…
Arithmetic Kleinian groups are arithmetic lattices in PSL_2(C). We present an algorithm which, given such a group Gamma, returns a fundamental domain and a finite presentation for Gamma with a computable isomorphism.
Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
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…
In this paper we introduce a new method for finding Galois groups by computer. This is particularly effective in the case of Galois groups of p-extensions ramified at finitely many primes but unramified at the primes above p. Such Galois…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
The Krawtchouck polynomials arise naturally in both coding theory and probability theory and have been studied extensively from these points of view. However, very little is known about their irreducibility and Galois properties. Just like…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
In this article, we construct a generating set of rational invariants for the action of the orthogonal group $\text{O}(n)$ on the space $\mathbb{R}[x_1,\dots,x_n]_{2d}$ of real homogeneous polynomials of even degree $2d$. This generalizes a…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…
We compute equations for the families of elliptic curves 9-congruent to a given elliptic curve. We use these to find infinitely many non-trivial pairs of 9-congruent elliptic curves over Q, i.e. pairs of non-isogenous elliptic curves over Q…
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.
For odd square-free n > 1 the n-th cyclotomic polynomial satisfies an identity of Gauss. There are similar identity of Aurifeuille, Le Lasseur and Lucas. These identities all involve certain polynomials with integer coefficients. We show…
We consider some examples of superintegrable system which were recently isolated through a differential Galois group analysis. The identity of these systems is clarified and the corresponding Poisson algebras derived.
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…
We construct, over any CM field, compatible systems of l-adic Galois representations that appear in the cohomology of algebraic varieties and have (for all l) algebraic monodromy groups equal to the exceptional group of type E6.
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…