English
Related papers

Related papers: Orbits of Polynomial Dynamical Systems Modulo Prim…

200 papers

Let $f(x) \in \mathbb{F}_p[x]$, and define the orbit of $x\in \mathbb{F}_p$ under the iteration of $f$ to be the set \[ \mathcal{O}(x):=\{x,f(x),(f\circ f)(x),(f\circ f\circ f)(x),\dots\}. \] An orbit is a $k$-cycle if it is periodic of…

Number Theory · Mathematics 2024-10-02 Jonathan Root

We study symmetric arithmetic circuits and improve on lower bounds given by Dawar and Wilsenach (ArXiv 2020). Their result showed an exponential lower bound of the permanent computed by symmetric circuits. We extend this result to show a…

Computational Complexity · Computer Science 2020-09-24 Christian Engels

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

Commutative Algebra · Mathematics 2020-11-17 Richard Gustavson , Alexey Ovchinnikov , Gleb Pogudin

We study orbits and fixed points of polynomials in a general skew polynomial ring $D[x,\sigma, \delta]$. We extend results of the first author and Vishkautsan on polynomial dynamics in $D[x]$. In particular, we show that if $a \in D$ and $f…

Rings and Algebras · Mathematics 2022-11-16 Adam Chapman , Elad Paran

We consider the dynamics of complex rational maps on the Riemann sphere. We prove that, after reducing their orbits to a fixed number of positive values representing the Fubini-Study distances between finitely many initial elements of the…

Dynamical Systems · Mathematics 2021-07-01 Luka Boc Thaler , Uroš Kuzman

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^n - 2^k + 1$, originally…

Number Theory · Mathematics 2025-08-18 Robert Dougherty-Bliss , Mits Kobayashi , Natalya Ter-Saakov , Eugene Zima

It has been recently pointed out that dynamical systems depending on future values of the unknowns may be useful in different areas of knowledge. We explore in this context the extension of the concept of order reduction that has been…

Computational Physics · Physics 2007-05-23 J. M. Aguirregabiria

We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for every orbit of a rational matrix to escape a compact…

Computational Complexity · Computer Science 2022-08-08 Julian D'Costa , Engel Lefaucheux , Eike Neumann , Joël Ouaknine , James Worrell

The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…

Optimization and Control · Mathematics 2015-09-15 G. Li , B. S. Mordukhovich , T. T. A. Nghia , T. S. Pham

The dynatomic modular curves parametrize polynomial maps together with a point of period $n$. It is known that the dynatomic curves $Y_1(n)$ are smooth and irreducible in characteristic 0 for families of polynomial maps of the form $f_c(z)…

Dynamical Systems · Mathematics 2019-09-18 John R. Doyle , Holly Krieger , Andrew Obus , Rachel Pries , Simon Rubinstein-Salzedo , Lloyd W. West

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

Number Theory · Mathematics 2023-01-10 Arnaud Bodin , Pierre Dèbes , Salah Najib

Let $K$ be a number field and $\phi\in K(z)$ a rational function. Let $S$ be the set of all archimedean places of $K$ and all non-archimedean places associated to the prime ideals of bad reduction for $\phi$. We prove an upper bound for…

Number Theory · Mathematics 2007-05-23 J. K. Canci

Given a prime $p$, we consider the dynamical system generated by repeated exponentiations modulo $p$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod p$ and $0 \le f_g(u) \le p-1$. This map is in particular used in a…

Number Theory · Mathematics 2009-08-28 Lev Glebsky , Igor E. Shparlinski

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

Number Theory · Mathematics 2018-10-16 Oleksiy Klurman , Marc Munsch

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

It is proved that for every complex quadratic polynomial $f$ with Cremer's fixed point $z_0$ (or periodic orbit) for every $\delta>0$, there is at most one periodic orbit of minimal period $n$ for all $n$ large enough, entirely in the disc…

Dynamical Systems · Mathematics 2025-05-06 Feliks Przytycki

Our main goal in this paper is to study the number of small-amplitude isolated periodic orbits, so-called limit cycles, surrounding only one equilibrium point a class of polynomial Kolmogorov systems. We denote by $\mathcal M_{K}(n)$ the…

Dynamical Systems · Mathematics 2023-04-12 Yagor Romano Carvalho , Leonardo P. C. Da Cruz , Luiz F. S. Gouveia

We solve a problem due to Recam\'an about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo $n$, as $n \to \infty$.

Number Theory · Mathematics 2014-08-07 Pascal Stumpf