Related papers: Solving Parameterized Polynomial Systems with Deco…

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…

In this paper we develop a general method to prove independence of algebraic monodromy groups in compatible systems of representations, and we apply it to deduce independence results for compatible systems both in automorphic and in…

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…

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 use the Galois module structure for the classical parameterizing spaces for elementary p-abelian extensions of a field K to give necessary and sufficient conditions for the solvability of any embedding problem which is an…

For many finite groups, the Inverse Galois Problem can be approached through modular/automorphic Galois representations. This is a report explaining the basic strategy, ideas and methods behind some recent results. It focusses mostly on the…

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…

Representation learning seeks meaningful sensory representations without supervision and can model aspects of human development. Although many neural networks empirically learn useful features, a principled account of what makes a…

We propose an approach for the computation of multi-parameter families of Galois extensions with prescribed ramification type. More precisely, we combine existing deformation and interpolation techniques with recently developed strong tools…

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…

We study the problem of existence of one-parameter, linear families of polynomials of degree n all of whose polynomials have Galois group A_n. The methods we use have a strong geometric flavour.

I discuss a seemingly unlikely confluence of topics in algebra, numerical computation, and computer vision. The motivating problem is that of solving multiples instances of a parametric family of systems of algebraic (polynomial or rational…

The automorphism group of the Galois covering induced by a pluri-canonical generic covering of a projective space is investigated. It is shown that by means of such coverings one obtains, in dimensions one and two, serieses of specific…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

Let $p$ be prime, and $n,m \in \mathbb{N}$. When $K/F$ is a cyclic extension of degree $p^n$, we determine the $\mathbb{Z}/p^m\mathbb{Z}[\text{Gal}(K/F)]$-module structure of $K^\times/K^{\times p^m}$. With at most one exception, each…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let $X$ be a smooth, separated, geometrically connected scheme defined over a number field $K$ and $\{\rho_\lambda\}_\lambda$ a system of n-dimensional semisimple $\lambda$-adic representations of the \'etale fundamental group of $X$ such…

The aim of this paper is to investigate the algebraicity behavior of reductions of $D$-finite power series modulo prime numbers. For many classes of D-finite functions, such as diagonals of multivariate algebraic series or hypergeometric…