Related papers: Computing Galois groups of Ehrhart polynomials in …

The $p$-group generation algorithm from computational group theory is used to obtain information about large quotients of the pro-2 group $G = \text{Gal} (k^{nr,2}/k)$ for $k = \mathbb{Q}(\sqrt{d})$ with $d = -445, -1015, -1595, -2379$. In…

In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We…

In this paper we describe an algorithm for computing mod $\ell$ Galois representations associated to modular forms of weight $k$ when $\ell <k-1$. As applications, we use this algorithm to explicitly compute the cases with $\Delta_{k}$ for…

Given a family of lattice polytopes, a common endeavor in Ehrhart theory is the classification of those polytopes in the family that are Gorenstein, or more generally level. In this article, we consider these questions for…

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for…

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…

We investigate on some Appel-type orthogonal polynomial sequences on q-quadratic lattices and we provide some entire new characterizations of the Al-Salam Chihara polynomials (including the Rogers q-Hermite polynomials). The corresponding…

This article is on the inverse Galois problem in Galois theory of linear iterative differential equations in positive characteristic. We show that it has an affirmative answer for reduced algebraic group schemes over any iterative…

We construct \'etale generalized Heisenberg group covers of hyperelliptic curves over number fields. We use these to produce infinite families of quadratic extensions of cyclotomic fields that admit everywhere unramified generalized…

We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…

The purpose of this article is to describe explicitly the polylogarithm class in absolute Hodge cohomology of a product of multiplicative groups, in terms of the Bloch-Wigner-Ramakrishnan polylogarithm functions. We will use the logarithmic…

This paper studies the number of monic integer polynomials $f$ of height at most $H$ whose Galois group, endowed with the action on the roots, is isomorphic to a prescribed permutation group $(G,\Omega)$. New upper bounds are obtained for…

We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We consider Galois/monodromy groups arising in computer vision applications, with a view towards building more efficient polynomial solvers. The Galois/monodromy group allows us to decide when a given problem decomposes into algebraic…

In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…

We exhibit algorithms for calculating Tits' buildings and orbits of vectors in a lattice $L$ for certain subgroups of $\operatorname{O}(L)$. We discuss how these algorithms can be applied to understand the configuration of boundary…

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…