Related papers: Moebius transforms and cyclic equations
We study the Galois groups of polynomials arising from a compatible family of representations with big orthogonal monodromy. We show that the Galois groups are usually as large as possible given the constraints imposed on them by a…
We extend Kovacic's algorithm to compute the differential Galois group of some second order parameterized linear differential equation. In the case where no Liouvillian solutions could be found, we give a necessary and sufficient condition…
Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…
In this paper we introduce and study the concept of cyclic factorization number of a finite group G. By using the Mobius inversion formula and other methods involving the cyclic subgroup structure, this is explicitly computed for some…
We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.
We present the solutions of equations of degrees 3 and 4 using Galois theory and some simple Fourier analysis for finite groups, together with historical comments on these and other solution methods.
We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…
In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the…
Using Galois representations attached to elliptic curves, we construct Galois extensions of $\mathbb{Q}$ with group $GL_2(p)$ in which all decomposition groups are cyclic. This is the first such realization for all primes $p$.
Using the free graded Lie algebras we introduce a natural subcomlex of the Loday's complex of a Leibniz algebra. Our conjecture says, that for free Leibniz algebras, the complex is acyclic.
We present a number of examples to illustrate the use of small quotient dessins as substitutes for their often much larger and more complicated Galois (minimal regular) covers. In doing so we employ several useful group-theoretic…
In this paper, the changes of representations of a group are used in order to describe its action as algebraic Galois group of an univariate polynomial on the roots of factors of any Lagrange resolvent. By this way, the Galois group of…
Let $f(x)=x^8+ax^4+b \in \mathbb{Q}[x]$ be an irreducible polynomial where $b$ is a square. We give a method that completely describes the factorization patterns of a linear resolvent of $f(x)$ using simple arithmetic conditions on $a$ and…
We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.
We construct and study two series of curves whose Jacobians admit complex multiplication. The curves arise as quotients of Galois coverings of the projective line with Galois group metacyclic groups $G_{q,3}$ of order $3q$ with $q \equiv 1…
We establish a quantum Galois correspondence for compact Lie groups of automorphisms acting on a simple vertex operator algebra.
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…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In 2013 Elkies described a method for bounding the transitivity degree of Galois groups. Our goal is to give additional applications of this technique, in particular verifying that the monodromy group of the degree-276 cover defined over a…
In this paper we study a certain class of polycyclic groups. We outline a method for constructing a poly-$\mathbb{Z}$ group $G_n$ by describing a process for selecting maps that are used to extend $G_i$ to $G_{i+1}$ for $1 \leq i \leq n-1$…