English
Related papers

Related papers: Parry order of Parry numbers

200 papers

Let $\left[x\right]$ be the largest integer not exceeding $x$. For $0<\theta \leq 1$, let $\pi_{\theta}(x)$ denote the number of integers $n$ with $1 \leq n \leq x^{\theta}$ such that $\left[\frac{x}{n}\right]$ is prime and…

Number Theory · Mathematics 2023-09-01 Runbo Li

We introduce the notion of \textit{Perron capacity} of a set of slopes $\Omega \subset \mathbb{R}$. Precisely, we prove that if the Perron capacity of $\Omega$ is finite then the directional maximal operator associated $M_\Omega$ is not…

Classical Analysis and ODEs · Mathematics 2022-06-15 Emma D'Aniello , Anthony Gauvan , Laurent Moonens

Let $\Gamma\subset \overline{\mathbb Q}^{\times}$ be a finitely generated multiplicative group of algebraic numbers. Let $\delta, \beta\in\overline{\mathbb Q}^\times$ be algebraic numbers with $\beta$ irrational. In this paper, we prove…

Number Theory · Mathematics 2022-10-04 Veekesh Kumar

We study real numbers $\beta$ with the curious property that the $\beta$-expansion of all sufficiently small positive rational numbers is purely periodic. It is known that such real numbers have to be Pisot numbers which are units of the…

Number Theory · Mathematics 2014-02-26 Boris Adamczewski , Christiane Frougny , Anne Siegel , Wolfgang Steiner

Let $ \{P_n\}_{n\geq 0} $ be the sequence of Perrin numbers defined by $P_0=3$, $P_1=0$,$P_2=2$ and $P_{n+3}=P_{n+1}+P_{n}$ for all $n \geq 0$. In this paper, we determine all Perrin numbers that are palindromic concatenations of two…

Number Theory · Mathematics 2025-05-08 Herbert Batte , Prosper Kaggwa

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

Combinatorics · Mathematics 2016-11-08 Bobby Shen

For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…

Combinatorics · Mathematics 2021-11-30 Swee Hong Chan , Igor Pak , Greta Panova

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

Number Theory · Mathematics 2014-06-20 Germán Paz

In this paper, authors construct a new type of sequence which is named an extra-super increasing sequence, and give the definitions of the minimal super increasing sequence {a[0], a[1], ..., a[n]} and minimal extra-super increasing sequence…

Other Computer Science · Computer Science 2021-09-08 Shenghui Su , Jianhua Zheng , Shuwang Lv

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of…

Combinatorics · Mathematics 2024-12-24 Pierre-Yves Bienvenu , Benjamin Girard , Thái Hoàng Lê

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Number Theory · Mathematics 2017-01-11 Zhi-Wei Sun

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

Number Theory · Mathematics 2023-02-27 Ankita Jindal , Nabin Kumar Meher

Recently, Kargin et al. (arXiv:2008.00284 [math.NT]) obtained (among many other things) the following formula for the hyper-sums of powers of integers $S_k^{(m)}(n)$ \begin{equation*} S_k^{(m)}(n) = \frac{1}{m!} \sum_{i=0}^{m} (-1)^i…

Number Theory · Mathematics 2022-01-07 José L. Cereceda

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

Number Theory · Mathematics 2012-04-10 Aran Nayebi

Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…

Probability · Mathematics 2025-05-20 Han Huang

We revisit classic balancing problems for linear extensions of a partially ordered set $P$, proving results that go far beyond many of the best earlier results on this topic. For example, with $p(x\prec y)$ the probability that $x$ precedes…

Combinatorics · Mathematics 2025-09-16 Max Aires , Jeff Kahn

Solutions of Pell's equation and hypergeometric series identities are used to study series expansions for $\sqrt{p}$ where $p$ are arbitrary prime numbers. Numerous fast convergent series expansions for this family of irrational numbers are…

Number Theory · Mathematics 2016-01-22 Chuanan Wei

In this paper we study the expansions of real numbers in positive and negative real base as introduced by R\'enyi, and Ito & Sadahiro, respectively. In particular, we compare the sets $\mathbb{Z}_\beta^+$ and $\mathbb{Z}_{-\beta}$ of…

Combinatorics · Mathematics 2014-02-19 Daniel Dombek , Zuzana Masáková , Tomáš Vávra

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…

Number Theory · Mathematics 2014-10-14 Liuquan Wang

The factor complexity of the infinite word $\ubeta$ canonically associated to a non-simple Parry number $\beta$ is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a…

Combinatorics · Mathematics 2017-05-31 Karel Klouda , Edita Pelantová