Related papers: Computing Galois groups of Ehrhart polynomials in …

We construct an Euler system for Galois representations associated to cohomological cuspidal automorphic representations of the group GSp(4), using the pushforwards of Eisenstein classes for GL(2) x GL(2).

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are…

In this paper, we describe a new Las Vegas algorithm to solve the elliptic curve discrete logarithm problem. The algorithm depends on a property of the group of rational points of an elliptic curve and is thus not a generic algorithm. The…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

In this paper we will give the calculus, the criterion, and the existence of the arithmetic Galois covers of higher relative dimensions.

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We develop a computational framework for classifying Galois groups of irreducible degree-7 polynomials over~$\mathbb{Q}$, combining explicit resolvent methods with machine learning techniques. A database of over one million normalized…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

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.

We describe explicit multiplicative excellent families of rational elliptic surfaces with Galois group isomorphic to the Weyl group of the root lattices E_7 or E_8. The Weierstrass coefficients of each family are related by an invertible…

We introduce and develop a structure theory of a new class of noncommutative rings - Galois orders, that generalize classical orders in noncommutative rings. Galois orders realized as certain subrings of invariants in skew semigroup rings.…

We develop a Galois theory for systems of linear difference equations with periodic parameters, for which we also introduce linear difference algebraic groups. We then apply this to constructively test if solutions of linear q-difference…

The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…

We present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. Concerning the coefficients of the Ehrhart series of a lattice polytope we show that Hibi's lower bound is not true…

We introduce a theory of cohomological invariants with mod $p^r$ coefficients for algebraic stacks in characteristic $p$. Using these new tools we complete the computation of the Brauer group and cohomological invariants of the stack of…

We present a detailed and simplified version of Hrushovski's algorithm that determines the Galois group of a linear differential equation. There are three major ingredients in this algorithm. The first is to look for a degree bound for…

In this article, we present a new algorithm for computing a generating set of a lattice ideal. This algorithm is based on a project-and-lift approach and is implemented in 4ti2. We also include a computational comparison of several existing…