相关论文: Sur les ensembles d'entiers reconnaissables

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

In this note, we give an alternative proof of the following result. Let p, q >= 2 be two multiplicatively independent integers. If an infinite set of integers is both p- and q-recognizable, then it is syndetic. Notice that this result is…

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

We study some interesting properties of Furstenberg's topology of the integers. We show that it is metrizable, totally disconnected, and (Z,+,.) is a topological ring with respect to this topology. As an application, we show that any two…

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

Let $E$ be an elliptic curve defined over a number field $K$. We say that a prime number $p$ is exceptional for $(E,K)$ if $E$ admits a $p$-isogeny defined over $K$. The so-called exceptional set of all such prime numbers is finite if and…

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

In this note, we study a class of random subsets of positive integers induced by Bernoulli random variables. We obtain sufficient conditions such that the random set is almost surely lacunary, does not have bounded gaps and contains…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to…

If p is a prime and n a positive integer, let v(n) denote the exponent of p in n, and u(n)=n/p^{v(n)} the unit part of n. If k is a positive integer not divisible by p, we show that the p-adic limit of (-1)^{pke} u((kp^e)!) as e goes to…

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…

Let S be an infinite set of non-empty, finite subsets of the nonnegative integers. If p is an odd prime, let c(p) denote the cardinality of the set {T {\in} S : T {\subseteq} {1,...,p-1} and T is a set of quadratic residues (respectively,…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…