Related papers: Fixed-point proportion of geometric iterated Galoi…

The goal of this article is to provide a general multivariate framework that synthesizes well-known non-tensorial polnomial interpolation schemes on the Padua points, the Morrow-Patterson-Xu points and the Lissajous node points into a…

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…

We compute the Galois group of a polynomial whose roots are determined by the critical points of a scalar potential in type IIB compactifications. We focus our study on certain perturbative models where it is feasible to construct a de…

Let $\varphi:\mathbb{P}^1(\mathbb F_q)\to\mathbb{P}^1(\mathbb F_q)$ be a rational map of degree $d>1$ on a fixed finite field. We give asymptotic formulas for the size of image sets $\varphi^n(\mathbb{P}^1(\mathbb F_q))$ as a function of…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems in finite model theory and database theory. Partial results…

We estimate several probability distributions arising from the study of random, monic polynomials of degree $n$ with coefficients in the integers of a general $p$-adic field $K_{\mathfrak{p}}$ having residue field with $q= p^f$ elements. We…

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

The study of arboreal Galois representations (that is, Galois groups arising from iteration of polynomial and rational functions) originated with work of Odoni in the 1980s. Beginning in the early 2000s it underwent a period of renewed…

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

Geyer and Jarden proved several results for torsion points of elliptic curves defined over the fixed field by finitely many elements in the absolute Galois group of a finitely generated field over the prime field in its algebraic closure.…

For a fixed prime power $q$ and natural number $d$ we consider a random polynomial $$f=x^n+a_{n-1}(t)x^{n-1}+\ldots+a_1(t)x+a_0(t)\in\mathbb F_q[t][x]$$ with $a_i$ drawn uniformly and independently at random from the set of all polynomials…

Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$…

Let $Z \to X$ be a finite branched Galois cover of normal projective geometrically integral varieties of dimension $d \geq 2$ over a perfect field $k$. For such a cover, we prove a Chebotarev-type density result describing the decomposition…

In this paper, we first introduce and study the notion of random Chebyshev centers. Further, based on the recently developed theory of stable sets, we introduce the notion of random complete normal structure so that we can prove the two…

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…

In this paper we study the behavior of finite dimensional fixed point iterations, induced by discretization of a continuous fixed point iteration defined within a Banach space setting. We show that the difference between the discrete…

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

For a differential field $F$ having an algebraically closed field of constants, we analyze the structure of Picard-Vessiot extensions of $F$ whose differential Galois groups are unipotent algebraic groups and apply these results to study…

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…