Related papers: Computing Galois groups of Ehrhart polynomials in …

We present a simple method for the construction of polynomials with cyclic Galois groups, hoping to encourage a reader with some background in algebra to make computations of his/her own.

We develop a computational framework for the statistical characterization of Galois characters with finite image, with application to characterizing Galois groups and establishing equivalence of characters of finite images of…

We report on the computer implementation for toric geometry in the computer algebra system $\texttt{OSCAR}$. The main architectural feature of $\texttt{OSCAR}$ is that its four fundamental tools $\texttt{Antic}$ (Hecke, Nemo),…

We develop a Galois theory for systems of linear difference equations with an action of an endomorphism {\sigma}. This provides a technique to test whether solutions of such systems satisfy {\sigma}-polynomial equations and, if yes, then…

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

In this paper we show an explicit polynomial in Q[x] that has Galois group SL2(F16), filling in a gap in the tables of Juergen Klueners and Gunther Malle. The computation of this polynomial uses modular forms and their Galois…

This paper presents some algorithmic techniques to compute explicitly the noetherian operators associated to a class of ideals and modules over a polynomial ring. The procedures we include in this work can be easily encoded in computer…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…

We show how the output of the algorithm to compute modular Galois representations described in our previous article can be certified. We have used this process to compute certified tables of such Galois representations obtained thanks to an…

We show that the use of generalized multivariable forms of Hermite polynomials provide an useful tool for the evaluation of families of elliptic type integrals often encountered in electrostatic and electrodynamics

The program Ortocartan for algebraic calculations in relativity has just been implemented in the Codemist Standard Lisp and can now be used under the Windows 98 and Linux operating systems. The paper describes the new facilities and…

Let G be a linear algebraic group, not necessarily connected or reductive, over the field of real numbers R. We describe a method, implemented on computer, to find the first Galois cohomology set H^1(R,G). The output is a list of 1-cocycles…

We formulate a general question regarding the size of the iterated Galois groups associated to an algebraic dynamical system and then we discuss some special cases of our question.

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…

We determine the Galois group of the 2-class field tower for two particular families of imaginary quadratic number fields $k$ with $2$-class field tower of length $2$.

We study semigroup algebras arising from lattice polytopes, compute their volume polynomials (particularizing work of Hochster), and establish strong Lefschetz properties (generalizing work of the first three authors). This resolves several…

In high dimensional regression, feature clustering by their effects on outcomes is often as important as feature selection. For that purpose, clustered Lasso and octagonal shrinkage and clustering algorithm for regression (OSCAR) are used…

This article studies the Galois groups that arise from division points of the lemniscate. We compute these Galois groups two ways: first, by class field theory, and second, by proving the irreducibility of lemnatomic polynomials, which are…