English
Related papers

Related papers: Primitive Divisors in Arithmetic Dynamics

200 papers

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Number Theory · Mathematics 2024-12-30 Jared Duker Lichtman

Let A,A' be elliptic curves or abelian varieties fully of type GSp defined over a number field K. This includes principally polarized abelian varieties with geometric endomorphism ring Z and dimension 2 or odd. We compare the number of…

Number Theory · Mathematics 2015-10-06 Antonella Perucca

A nonnegative matrix $A$ is called primitive if $A^k$ is positive for some integer $k>0$. A generalization of this concept to finite sets of matrices is as follows: a set of matrices $\mathcal M = \{A_1, A_2, \ldots, A_m \}$ is primitive if…

Combinatorics · Mathematics 2015-04-16 Vincent D. Blondel , Raphael M. Jungers , Alex Olshevsky

This article addresses the existence of $\Q$-rational periodic points for morphisms of projective space. In particular, we construct an infinitely family of morphisms on $\P^N$ where each component is a degree 2 homogeneous form in $N+1$…

Dynamical Systems · Mathematics 2009-08-04 Benjamin Hutz

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…

Dynamical Systems · Mathematics 2024-11-14 Stefan Steinerberger , Tony Zeng

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

Number Theory · Mathematics 2019-06-19 Sílvia Casacuberta

For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive…

Number Theory · Mathematics 2020-01-22 Himangshu Hazarika , Dhiren Kumar Basnet , Stephen D Cohen

Let $f \in Q(z)$ be a polynomial or rational function of degree 2. A special case of Morton and Silverman's Dynamical Uniform Boundedness Conjecture states that the number of rational preperiodic points of $f$ is bounded above by an…

Number Theory · Mathematics 2015-01-05 Robert L. Benedetto , Ruqian Chen , Trevor Hyde , Yordanka Kovacheva , Colin White

Let $K$ be a number field, let $\phi \in K(t)$ be a rational map of degree at least 2, and let $\alpha, \beta \in K$. We show that if $\alpha$ is not in the forward orbit of $\beta$, then there is a positive proportion of primes ${\mathfrak…

Algebraic Geometry · Mathematics 2011-07-15 Robert L. Benedetto , Dragos Ghioca , Benjamin Hutz , Pär Kurlberg , Thomas Scanlon , Thomas J. Tucker

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

Number Theory · Mathematics 2023-01-11 Jonatan Gomez

A ring $R$ is an elementary divisor ring if every matrix over $R$ admits a diagonal reduction. We further explore various stable like conditions on a bezout duo-domain under which it is an elementary divisor domain. Many known results are…

Rings and Algebras · Mathematics 2016-02-22 Huanyin Chen , Marjan Sheibani

We prove an analogue of the Prime Number Theorem for short intervals on a smooth projective geometrically irreducible curve of arbitrary genus over a finite field. A short interval "of size E" in this setting is any additive translate of…

Number Theory · Mathematics 2018-04-03 Efrat Bank , Tyler Foster

A number field $K$ is primitive if $K$ and $\mathbb{Q}$ are the only subextensions of $K$. Let $C$ be a curve defined over $\mathbb{Q}$. We call an algebraic point $P\in C(\overline{\mathbb{Q}})$ primitive if the number field…

Number Theory · Mathematics 2024-05-21 Maleeha Khawaja , Samir Siksek

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

A set of positive integers is said to be primitive if no element of the set is a multiple of another. If $S$ is a primitive set and $S(x)$ is the number of elements of $S$ not exceeding $x$, then a result of Erd\H os implies that…

Number Theory · Mathematics 2010-10-28 Greg Martin , Carl Pomerance

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

Let $\theta$ be an algebraic integer and $f(x)=x^{n}+ax^{n-1}+bx+c$ be the minimal polynomial of $\theta$ over the rationals. Let $K=\mathbb{Q}(\theta)$ be a number field and $\mathcal{O}_{K}$ be the ring of integers of $K.$ In this…

Number Theory · Mathematics 2025-01-08 Tapas Chatterjee , Karishan Kumar

Let $\mathbb{F}_q$ be the finite field of characteristic $p$ with $q$ elements and $\mathbb{F}_{q^n}$ its extension of degree $n$. We prove that there exists a primitive element of $\mathbb{F}_{q^n}$ that produces a completely normal basis…

Number Theory · Mathematics 2018-05-08 Theodoulos Garefalakis , Giorgos Kapetanakis

A representation of divisor function $\tau(n)\equiv \sigma_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of…

Number Theory · Mathematics 2011-09-19 E. E. Kholupenko

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

General Mathematics · Mathematics 2024-06-10 Anton Shakov
‹ Prev 1 8 9 10 Next ›