Related papers: Large Galois groups with applications to Zariski d…

This paper introduces a novel approach to understanding Galois theory, one of the foundational areas of algebra, through the lens of machine learning. By analyzing polynomial equations with machine learning techniques, we aim to streamline…

The problem of computing \emph{the exponent lattice} which consists of all the multiplicative relations between the roots of a univariate polynomial has drawn much attention in the field of computer algebra. As is known, almost all…

Let G be a locally compact Hausdorff group in which every element is of finite order, and let P(G) denote the class of all regular probability measures on G. In this note, it is observed that a characterization of algebraically regular…

Based on a result of Singh--Venkataramana, Bajpai--Dona--Singh--Singh gave a criterion for a discrete Zariski-dense subgroup of Sp(2n,Z) to be a lattice. We adapt this criterion so that it can be used in some situations that were previously…

We present a difference analogue of a result given by Hrushovski on differential Galois groups under specialization. Let $k$ be an algebraically closed field of characteristic zero and $\mathbb{X}$ an irreducible affine algebraic variety…

The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…

We prove that generic Hitchin representations are strongly dense: every pair of non commuting elements in their image generate a Zariski-dense subgroup of SL_n(R). The proof uses a theorem of Rapinchuk, Benyash-Krivetz and Chernousov, to…

Let $E \subset \mathbb{Z}^N$ be a set of positive upper Banach density and let $\Gamma < \operatorname{GL}_N(\mathbb{Z})$ be a finitely generated, strongly irreducible subgroup whose Zariski closure in $\operatorname{GL}_N(\mathbb{R})$ is a…

We begin by showing that commensurators of Zariski dense subgroups of isometry groups of symmetric spaces of non-compact type are discrete provided that the limit set on the Furstenberg boundary is not invariant under the action of a…

It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…

Tkachenko and Yaschenko [34] characterized the abelian groups G such that all proper unconditionally closed subsets of G are finite, these are precisely the abelian groups G having cofinite Zariski topology (they proved that such a G is…

The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…

Let $K/F$ be a finite Galois extension of number fields. It is well known that the Tchebotarev density theorem implies that an irreducible, finitely ramified $p$-adic representation $\rho$ of the absolute Galois group of $K$ is determined…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

Let $\Ga$ be a connected, solvable linear algebraic group over a number field~$K$, let $S$ be a finite set of places of~$K$ that contains all the infinite places, and let $\theints$ be the ring of $S$-integers of~$K$. We define a certain…

In 2015, Guth proved that if $S$ is a collection of $n$ $g$-dimensional semi-algebraic sets in $\mathbb{R}^d$ and if $D\geq 1$ is an integer, then there is a $d$-variate polynomial $P$ of degree at most $D$ so that each connected component…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We give a deterministic polynomial-time algorithm to check whether the Galois group $\Gal{f}$ of an input polynomial $f(X) \in \Q[X]$ is nilpotent: the running time is polynomial in $\size{f}$. Also, we generalize the Landau-Miller…

This article is the third and last part of a series of three articles about compatible systems of symplectic Galois representations and applications to the inverse Galois problem. This part proves the following new result for the inverse…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…