English
Related papers

Related papers: Fixed-point lifting and ghost periodic points for …

200 papers

In this paper we study the geometric location of periodic points of power series defined over fields of prime characteristic $p$. More specifically, we find a lower bound for the absolute value of all periodic points in the open unit disk…

Dynamical Systems · Mathematics 2019-03-29 Karl-Olof Lindahl , Jonas Nordqvist

In this second part we prove that, if $G$ is one of the groups $\mathrm{PSL}_2(q)$ with $q>5$ and $q\equiv 5\pmod {24}$ or $q\equiv 13 \pmod{24}$, then the fundamental group of every acyclic $2$-dimensional, fixed point free and finite…

Algebraic Topology · Mathematics 2025-08-22 Kevin Ivan Piterman , Iván Sadofschi Costa

The existence and multiplicity of positive periodic solutions for first non-autonomous singular systems are established with superlinearity or sublinearity assumptions at infinity for an appropriately chosen parameter. The proof of our…

Classical Analysis and ODEs · Mathematics 2010-09-24 Haiyan Wang

We study the query complexity of finding a Tarski fixed point over the $k$-dimensional grid $\{1,\ldots,n\}^k$. Improving on the previous best upper bound of $\smash{O(\log^{\lceil 2k/3\rceil} n)}$ [FPS20], we give a new algorithm with…

Computer Science and Game Theory · Computer Science 2022-05-24 Xi Chen , Yuhao Li

Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…

Optimization and Control · Mathematics 2019-03-12 Simon Foucart , Jean-Bernard Lasserre

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

Algebraic Geometry · Mathematics 2012-09-25 Yuri Burda , Askold Khovanskii

Solutions of the quartic Fermat equation in ring class fields of odd conductor over quadratic fields $K=\mathbb{Q}(\sqrt{-d})$ with $-d \equiv 1$ (mod $8$) are shown to be periodic points of a fixed algebraic function $T(z)$ defined on the…

Number Theory · Mathematics 2016-07-28 Patrick Morton

H. Gl\"ockner and G. A. Willis have recently shown that locally pro-p contraction groups are nilpotent. The proof hinges on a fixed-point result: if the local field $\mathbb{F}_{p}(\!(t)\!)$ acts on its $d$-th power…

Group Theory · Mathematics 2025-04-22 Alonso Beaumont

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…

Functional Analysis · Mathematics 2024-08-22 Xiaohuan Mu , Qiang Tu , Tiexin Guo , Hong-Kun Xu

Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon that `more often' P(x;d,n)>P(x;d,r) than the other way around, where n is a quadratic non-residue mod d and r is a quadratic residue mod d. If…

Number Theory · Mathematics 2007-05-23 Pieter Moree

In this article, we study closed, positively curved $n$-manifolds that admit an effective, isometric $\mathbb{Z}_p^r$-action with a fixed point, where $p$ is an odd prime. For all sufficiently large $n$, we obtain a symmetry-rank bound in…

Differential Geometry · Mathematics 2026-02-09 Muhammad Abdullah , Catherine Searle

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

We study the fixed points of the Berezin transform on the Fock-type spaces $F_m^2$ with the weight $e^{-|z|^m}, m > 0.$ It is known that the Berezin transform is well-defined on the polynomials in $z$ and $\overline{z}$. In this paper we…

Complex Variables · Mathematics 2025-12-23 Ghazaleh Asghari , Zeljko Cuckovic , Sonmez Sahutoglu

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

Dynamical Systems · Mathematics 2022-01-27 Tarakanta Nayak , Soumen Pal

In this work, we study fixed point algorithms for finding a zero in the sum of $n\geq 2$ maximally monotone operators by using their resolvents. More precisely, we consider the class of such algorithms where each resolvent is evaluated only…

Optimization and Control · Mathematics 2022-07-25 Yura Malitsky , Matthew K. Tam

In this first article of a multi-part series, we inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathbb{Z}$ and the…

Number Theory · Mathematics 2026-01-16 Brian Kintu

We study rational periodic points of polynomial $f_{d,c}(x)=x^d+c$ over the field of rational numbers, where $d$ is an integer greater than 2. For period 2, we classify all possible periodic points for degrees $d=4,6$. We also demonstrate…

Number Theory · Mathematics 2021-10-12 Chatchawan Panraksa

We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" $I \subset \mathbb{F}_p$, provided $(p^{1/2}\log p)/|I| = o(1)$. Applications include…

Number Theory · Mathematics 2020-07-07 Pär Kurlberg , Lior Rosenzweig

This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…

Discrete Mathematics · Computer Science 2022-02-04 Volker Turau

Finding an irreducible factor, of a polynomial $f(x)$ modulo a prime $p$, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em counts} the number of irreducible factors of $f\bmod p$. We…

Symbolic Computation · Computer Science 2019-02-27 Ashish Dwivedi , Rajat Mittal , Nitin Saxena