Related papers: Parry order of Parry numbers

This paper investigates the relationship between the Riemann hypothesis and the statement $\forall n, ~g(n) \le e^{\sqrt{p_n}}$, where $g(n)$ is the maximum order of an element of $S_n$, the symmetric group on $n$ elements, and $p_n$ is the…

Let $\beta>1$ and let $m>\be$ be an integer. Each $x\in I_\be:=[0,\frac{m-1}{\beta-1}]$ can be represented in the form \[ x=\sum_{k=1}^\infty \epsilon_k\beta^{-k}, \] where $\epsilon_k\in\{0,1,...,m-1\}$ for all $k$ (a $\beta$-expansion of…

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…

We consider continued fractions with partial quotients in the ring of integers of a quadratic number field $K$ and we prove a generalization to such continued fractions of the classical theorem of Lagrange. A particular example of these…

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

Let K/Q be Galois, and let eta in K* whose conjugates are multiplicatively independent. For a prime p, unramified, prime to eta, let np be the residue degree of p and gp the number of P I p, then let o\_P(eta) and o\_p(eta) be the orders of…

Using a human-oriented formal example proof of the (lim+) theorem, i.e. that the sum of limits is the limit of the sum, which is of value for reference on its own, we exhibit a non-permutability of beta-steps and delta+-steps (according to…

We investigate a ratio sequence derived from the factorization of $p_{m-1} + 1$, where $p_n$ denotes the $n$th prime. For each $m \geq 3$, write $p_{m-1} + 1 = L_m R_m$ with $L_m$ the largest prime factor. Restricting to those $m$ for which…

Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…

The degree of insulation of a prime $p$ is defined as the largest interval around it in which no other prime exists. Based on this, the $n$-th prime $p_{n}$ is said to be insulated if and only if its degree of insulation is higher than its…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…

An antichain $\mathcal{A}$ in a poset $\mathcal{P}$ is a subset of $\mathcal{P}$ in which no two elements are comparable. Sperner showed that the maximal antichain in the Boolean lattice, $\mathcal{B}_n = \left\{ 0 < 1 \right\}^n$, is the…

We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical $k$-automatic sequences and…

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

We study the model theoretic structure $(\Z,+,P_r)$ where $r>1$ is an irrational number and the elements of $P_r$ are of the form $\floor{nr}$ for some $n\in\Z\setminus\{0\}$. We axiomatize of this structure and prove a quantifier…

The set A = {a_n} of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be represented as the sum of h elements of A. If a_n ~ alpha n^h for some real number alpha > 0, then alpha is called an…

Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\beta$-models:…

Let $\left(a_{n}\right)_{n}$ be a strictly increasing sequence of positive integers, denote by $A_{N}=\left\{ a_{n}:\,n\leq N\right\} $ its truncations, and let $\alpha\in\left[0,1\right]$. We prove that if the additive energy…

For an integer $\rho$ such that $1 \leq \rho \leq v/3$, define $\beta(\rho,v)$ to be the maximum number of blocks in any partial Steiner triple system on $v$ points in which the maximum partial parallel class has size $\rho$. We obtain…