Related papers: Primitive and geometric-progression-free sets with…

Bartholdi and Smoktunowicz constructed finitely generated monomial algebras with prescribed sufficiently fast growth types. We show that their construction need not result in a prime algebra, but it can be modified to provide prime algebras…

This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, product-free sets, and coprime-free sets. We present a condition…

Let $p\geq 2$ be a large prime, and let $N\gg ( \log p)^{1+\varepsilon}$. This note proves the existence of primitive roots in the short interval $[M,M+N]$, where $M \geq 2$ is a fixed number, and $ \varepsilon>0$ is a small number. In…

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

Erd\H{o}s considered the second moment of the gap-counting function of prime divisors in 1946 and proved an upper bound that is not of the right order of magnitude. We prove asymptotics for all moments. Furthermore, we prove a…

We prove that the Lie algebra of primitive elements of a graded and connected bialgebra, free as an associative algebra, over a eld of characteristic zero, is a free Lie algebra. The main tool is a ltration, which allows to embed the…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Let $\mathbf{P}$ denote the set of prime numbers and, for an appropriate function $h$, define a set $\mathbf{P}_{h}=\{p\in\mathbf{P}: \exists_{n\in\mathbb{N}}\ p=\lfloor h(n)\rfloor\}$. The aim of this paper is to show that every subset of…

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

In this paper we extend some set theoretic concepts of numerical semigroups for arbitrary sub-semigroups of natural numbers. Then we characterized gapsets which leads to a more efficient computational approach towards numerical semigroups…

We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…

Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…

Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a…

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…

1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…

We study an LCM-based analogue of Rowland's GCD-based prime-generating recurrence, introduced by the author in 2008. The multiplicative increments of this sequence are conjectured always to be $1$ or prime, but a complete proof requires a…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…