Related papers: On monic abelian trace-one cubic polynomials

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…

Let $G$ be a subgroup of the symmetric group $S_n$, and let $\delta_G=|S_n/G|^{-1}$ where $|S_n/G|$ is the index of $G$ in $S_n$. Then there are at most $O_{n, \epsilon}(H^{n-1+\delta_G+\epsilon})$ monic integer polynomials of degree $n$…

In the paper we obtain the asymtotic number of integral quadratic polynomials with bounded heights and discriminants as the upper bound of heights tends to infinity.

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…

Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$…

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…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we enumerate self-reciprocal irreducible monic polynomials over a finite field with prescribed leading coefficients.…

Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…

We prove that the arboreal Galois representations attached to certain unicritical polynomials have finite index in an infinite wreath product of cyclic groups, and we prove surjectivity for some small degree examples, including a new family…

A new method of algebraic nature is proposed for the study of the asymptotic properties of special polynomials. The technique we foresee is based on the use of umbral operators, allowing a unified treatment of a large body of polynomial…

Let $A$ be an abelian variety over $\mathbb{Q}$ of dimension $g$ such that the image of its associated absolute Galois representation $\rho_A$ is open in $\operatorname{GSp}_{2g}(\hat{\mathbb{Z}})$. We investigate the arithmetic of the…

We explore families of pairs of quadratic polynomials $f(x)=x^2+c\in \mathbb{Q}$ and $a\in \mathbb{Q}$ with $a$ being a strictly preperiodic point of $f$ to provide infinitely many new examples for which the associated arboreal Galois…

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

The Galois/monodromy group of a family of geometric problems or equations is a subtle invariant that encodes the structure of the solutions. Computing monodromy permutations using numerical algebraic geometry gives information about the…

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…