Related papers: Orbits of Polynomial Dynamical Systems Modulo Prim…

We obtain a lower bound on the multiplicative order of Gauss periods which generate normal bases over finite fields. This bound improves the previous bound of J. von zur Gathen and I. E. Shparlinski.

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

Periodic solutions of the three body problem are very important for understanding its dynamics either in a theoretical framework or in various applications in celestial mechanics. In this paper we discuss the computation and continuation of…

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…

In 2004 Vasiga and Shallit studied the number of periodic points of two particular discrete quadratic maps modulo prime numbers. They found the asymptotic behaviour of the sum of the number of periodic points for all primes less than some…

Let $S=\{x^2+c_1, x^2+c_2,\dots, x^2+c_s\}$ be a set of quadratic polynomials with rational coefficients, and let $P$ be a rational basepoint. We classify the pairs $(S,P)$ for which $P$ has finite orbit for $S$, assuming that the maximum…

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

We study intersections of semigroup orbits in polynomial dynamics with multiplicative subgroups, extending results of Ostafe and Shparlinski (2010).

We prove the first, even super-polynomial, lower bounds on the size of tropical (min,+) and (max,+) circuits approximating given optimization problems. Many classical dynamic programming (DP) algorithms for optimization problems are pure in…

The framework of joint typical periodic optimization, in which both the dynamical system and the potential function are allowed to vary simultaneously, was introduced in [HHJL25], in a direction motivated by the work of Yang, Hunt & Ott…

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

In this article, we consider a counting problem for orbits of hyperbolic rational maps on the Riemann sphere, where constraints are placed on the multipliers of orbits. Using arguments from work of Dolgopyat, we consider varying and…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We give a generalization to higher dimensions of Silverman's result on finiteness of integer points in orbits. Assuming Vojta's conjecture, we prove a sufficient condition for morphisms on P^N so that (S,D)-integral points in each orbit are…

We express Wronskian Hermite polynomials in the Hermite basis and obtain an explicit formula for the coefficients. From this we deduce an upper bound for the modulus of the roots in the case of partitions of length 2. We also derive a…

We consider the space of all representations of the commutator subgroup of a knot group into Z/p, p is prime. As proven by D. Silver and S. Williams, this space can be completely described by a finite oriented graph. We describe the lengths…

We generalize the shadow codes of Cherubini and Micheli to include basic polynomials having arbitrary degree, and show that restricting basic polynomials to have degree one or less can result in improved lower bounds on the minimum distance…