# Some Results On The Flynn-Poonen-Schaefer Conjecture

## TL;DR

This paper investigates the Flynn-Poonen-Schaefer conjecture on rational cycles of quadratic polynomials, establishing conditions on the denominator of the parameter and confirming the conjecture for certain cases.

## Contribution

It proves that rational cycles of length at least 3 require the denominator to be divisible by 16, and confirms the conjecture when the denominator has at most two prime factors.

## Key findings

- Denominator of c divisible by 16 for cycles of length ≥ 3
- Upper bound on rational periodic points based on prime factors
- Conjecture holds if denominator has ≤ 2 prime factors

## Abstract

For $c \in \mathbb{Q}$, consider the quadratic polynomial map $\varphi_c(x)=x^2-c$. Flynn, Poonen and Schaefer conjectured in 1997 that no rational cycle of $\varphi_c$ under iteration has length more than $3$. Here we discuss this conjecture using arithmetic and combinatorial means, leading to three main results. First, we show that if $\varphi_c$ admits a rational cycle of length $n \ge 3$, then the denominator of $c$ must be divisible by $16$. We then provide an upper bound on the number of periodic rational points of $\varphi_c$ in terms of the number of distinct prime factors of the denominator of $c$. Finally, we show that the Flynn-Poonen-Schaefer conjecture holds for $\varphi_c$ if that denominator has at most two distinct prime factors.