Searcharxiv⌕ Search

arXiv subjects

Alina Ostafe

Publications and source records attributed to Alina Ostafe.

At least 37 records · Page 2Linked to original sources

Counting embeddings of free groups into $\mathrm{SL}_2(\mathbb{Z})$ and its subgroups

We show that if one selects uniformly independently and identically distributed matrices $A_1, \ldots, A_s \in \mathrm{SL}_2(\mathbb{Z})$ from a ball of large radius $X$ then with probability at least $1 - X^{-1 + o(1)}$ the matrices $A_1, \ldots, A_s$ are free generators for a free subgroup of $\mathrm{SL}_2(\mathbb{Z})$. Furthermore, to show the flexibility of our method we do similar counting for matrices from the congruence subgroup $Γ_0(Q)$ uniformly with respect to the positive integer $Q\le X$. This improves and generalises a result of E. Fuchs and I. Rivin (2017) which claims that the probability is $1 + o(1)$. We also disprove one of the statements in their work that has been used to deduce their claim.

math.NT↗

On a Problem of Lang for Matrix Polynomials

In this paper, we consider a problem of Lang about finiteness of torsion points on plane rational curves over $\mathbb C$, and prove some results towards a matrix analogue of this problem.

math.NT↗

Weil Sums over Small Subgroups

We obtain new bounds on short Weil sums over small multiplicative subgroups of prime finite fields which remain nontrivial in the range the classical Weil bound is already trivial. The method we use is a blend of techniques coming from algebraic geometry and additive combinatorics.

math.NT↗

Discriminants of Fields Generated by Polynomials of Given Height

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting square-free parts of polynomial discriminants via two complementing approaches. In turn, this leads to a lower bound on the number of distinct discriminants of fields generated by roots of polynomials of degree $n$ and height at most $H$. We also give an upper bound for the number of trinomials of bounded height with given square-free part of the discriminant, improving previous results of I. E. Shparlinski (2010).

math.NT↗

Additive energy of cyclic matrix groups and character sums with matrix exponential functions

We obtain a nontrivial bound on the number of solutions to the equation $A^{x_1} + A^{x_2} = A^{x_3} + A^{x_4}$, $1 \le x_1,x_2,x_3,x_4 \le τ$, with a fixed $n\times n$ matrix $A$ over a finite field ${\mathbb F}_q$ of $q$ elements of multiplicative order $τ$. For $n=2$ this equation has been considered by Kurlberg and Rudnick (2001) in their study of quantum ergodicity for linear maps over ${\mathbb F}_q$. Furthermore, its multivariate analogue (also with $n=2$) has been studied by Bourgain (2005). We give applications of our result to obtaining a new bound of additive character sums with a matrix exponential function, which is nontrivial beyond the square-root threshold, and also to a certain additive problem with matrices. Our results are especially strong for ${\rm SL}(n,q)$ matrices with an irreducible characteristic polynomial.

math.NT↗

Equations and character sums with matrix powers, Kloosterman sums over small subgroups and quantum ergodicity

We obtain a nontrivial bound on the number of solutions to the equation $$ A^{x_1} + \ldots + A^{x_ν} = A^{x_{ν+1}} + \ldots + A^{x_{2ν}}, \quad 1 \le x_1, \ldots,x_{2ν} \le τ, $$ with a fixed $n\times n$ matrix $A$ over a finite field $\mathbb F_q$ of $q$ elements of multiplicative order $τ$. We give applications of our result to obtaining a new bound of additive character sums with a matrix exponential function, which is nontrivial beyond the square-root threshold. For $n=2$ this equation has been considered by Kurlberg and Rudnick (2001) (for $ν=2$) and Bourgain (2005) (for large $ν$) in their study of quantum ergodicity for linear maps over residue rings. Here we use a new approach to improve their results. We also obtain a bound on Kloosterman sums over small subgroups, of size below the square-root threshold.

math.NT↗

On the Skolem problem and some related questions for parametric families of linear recurrence sequences

We show that in a parametric family of linear recurrence sequences $a_1(α) f_1(α)^n + \ldots + a_k(α) f_k(α)^n$ with the coefficients $a_i$ and characteristic roots $f_i$, $i=1, \ldots,k$, given by rational functions over some number field, for all but a set of $α$ of bounded height in the algebraic closure of $\mathbb Q$, the Skolem problem is solvable, and the existence of a zero in such a sequence can be effectively decided. We also discuss several related questions.

math.NT↗

Multiplicative and linear dependence in finite fields and on elliptic curves modulo primes

For positive integers $K$ and $L$, we introduce and study the notion of $K$-multiplicative dependence over the algebraic closure $\overline{\mathbb{F}}_p$ of a finite prime field $\mathbb{F}_p$, as well as $L$-linear dependence of points on elliptic curves in reduction modulo primes. One of our main results shows that, given non-zero rational functions $φ_1,\ldots,φ_m, \varrho_1,\ldots,\varrho_n\in\mathbb{Q}(X)$ and an elliptic curve $E$ defined over the integers $\mathbb{Z}$, for any sufficiently large prime $p$, for all but finitely many $α\in\overline{\mathbb{F}}_p$, at most one of the following two can happen: $φ_1(α),\ldots,φ_m(α)$ are $K$-multiplicatively dependent or the points $(\varrho_1(α),\cdot), \ldots,(\varrho_n(α),\cdot)$ are $L$-linearly dependent on the reduction of $E$ modulo $p$. As one of our main tools, we prove a general statement about the intersection of an irreducible curve in the split semiabelian variety $\mathbb{G}_{\mathrm{m}}^m \times E^n$ with the algebraic subgroups of codimension at least $2$. As an application of our results, we improve a result of M. C. Chang and extend a result of J. F. Voloch about elements of large order in finite fields in some special cases.

math.NT↗

Perfect powers in value sets and orbits of polynomials

We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the $abc$-Conjecture for number fields, we obtain a finiteness result for powers in ratios of arbitrary elements in orbits.

math.NT↗

On sparsity of representations of polynomials as linear combinations of exponential functions

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such that $$n^2=\sum_{i=1}^m c_i g^{k_i}$$ is $o\left(\left(\log M \right)^{m-1/2}\right)$. We also obtain a similar bound when dealing with more general inequalities $$\left|Q(n)-\sum_{i=1}^m c_iλ^{k_i}\right|\le B,$$ where $Q\in {\mathbb C}[X]$ and also $λ\in {\mathbb C}$ (while $B$ is a real number).

math.NT↗

A sparsity result for the Dynamical Mordell-Lang Conjecture in positive characteristic

We prove a quantitative partial result in support of the Dynamical Mordell-Lang Conjecture (also known as the DML conjecture) in positive characteristic. More precisely, we show the following: given a field $K$ of characteristic $p$, given a semiabelian variety $X$ defined over a finite subfield of $K$ and endowed with a regular self-map $Φ:X \longrightarrow X$ defined over $K$, given a point $α\in X(K)$ and a subvariety $V\subseteq X$, then the set of all non-negative integers $n$ such that $Φ^n(α)\in V(K)$ is a union of finitely many arithmetic progressions along with a subset $S$ with the property that there exists a positive real number $A$ (depending only on $N$, $Φ$, $α$, $V$) such that for each positive integer $M$, we have $$\#\left\{n\in S\colon~ n\le M\right\}\le A\cdot \left(1+\log M\right)^{\dim V}.$$

math.NT↗

Dynamical irreducibility of polynomials modulo primes

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set of primes $p$ such that all iterations of $f$ are irreducible modulo $p$ is of relative density zero. Furthermore, we give an explicit bound on the rate of the decay of the density of such primes in an interval $[1, Q]$ as $Q \to \infty$. For this class of polynomials this gives a more precise version of a recent result of A. Ferraguti (2018), which applies to arbitrary polynomials but requires a certain assumption about their Galois group. Furthermore, under the Generalised Riemann Hypothesis we obtain a stronger bound on this density.

math.NT↗

On algebraic integers of bounded house and preperiodicity in polynomial semigroup dynamics

We consider semigroup dynamical systems defined by several polynomials over a number field $\mathbb{K}$, and the orbit (tree) they generate at a given point. We obtain finiteness results for the set of preperiodic points of such systems that fall in the cyclotomic closure of $\mathbb{K}$. More generally, we consider the finiteness of initial points in the cyclotomic closure for which the orbit contains an algebraic integer of bounded house. This work extends previous results for classical obits generated by one polynomial over $\mathbb{K}$ obtained initially by Dvornicich and Zannier (for preperiodic points), and then by Chen and Ostafe (for roots of unity and elements of bounded house in orbits).

math.NT↗

The Arithmetic of Consecutive Polynomial Sequences over Finite Fields

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of irreducible factors, the number of irreducible factors, as well as for the number of such sequences of fixed length in which all the polynomials are irreducible.

math.NT↗

On multiplicative dependence of values of rational functions and a generalisation of the Northcott theorem

In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical system. We also obtain a broad generalisation of the Northcott theorem replacing the finiteness of preperiodic points from a given number field by the finiteness of initial points with two multiplicatively dependent elements in their orbits.

math.NT↗

On abelian multiplicatively dependent points on a curve in a torus

We show, under some natural conditions, that the set of abelian (and thus also cyclotomic) multiplicatively dependent points on an irreducible curve over a number field is a finite union of preimages of roots of unity by a certain finite set of primitive characters from $\Gm^n$ to $\Gm$ restricted to the curve, and a finite set. We also introduce the notion of primitive multiplicative dependence and obtain a finiteness result for primitively multiplicatively dependent points defined over a so-called Bogomolov extension of a number field.

math.NT↗

Reductions Modulo Primes of Systems of Polynomial Equations and Algebraic Dynamical Systems

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the algebraic closure of the field with $p$ elements. We apply these bounds to study the periodic points and the intersection of orbits of algebraic dynamical systems over finite fields. In particular, we establish some links between these problems and the uniform dynamical Mordell-Lang conjecture.

math.NT↗