arXiv subjects

Bhuwanesh Rao Patil

Publications and source records attributed to Bhuwanesh Rao Patil.

5 recordsLinked to original sources

arXiv2024

On additive complements in the complement of a set of natural numbers

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is 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$. Erdős proposed a conjecture that every infinite set of natural numbers has a sparse additive complement, and in 1954, Lorentz proved this conjecture. This article describes the existence or non-existence of those additive complements of the set $A$ that is a subset of the complement of $A$. We provide a ratio test to verify the existence of such additive complements. In precise, we prove that if $A=\{a_i: i\in \mathbb{N}\}$ is a set of natural numbers such that $a_i 1$, then there exists a set $B\subset \mathbb{N}\setminus A$ such that $B$ is a sparse additive complement of the set $A$.

math.NT↗

arXiv2024

On additive complement with special structures

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 article describes various types of additive complements of the set $A$ such as those additive complement of $A$ that does not intersects $A$, additive complements of the form of the union of disjoint infinite arithmetic progressions, additive complement having various density etc. As an application of this study, we also focus on the structure of sumset of arithmetic progression and geometric progression. Apart from this, for given positive real no. $α\leq 1$ and finite set $A$, we investigate a set $B$ such that it can be written as union of disjoint infinite arithmetic progression and density of $A+B$ is $α$.

math.NT↗

arXiv2020

Sparse subsets of the natural numbers and Euler's totient function

In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $ϕ$ via the property of `Banach Density'. These sets related to the totient function are defined as follows: $V:=ϕ(\mathbb{N})$ and $N_i:=\{N_i(m)\colon m\in V \}$ for $i = 1, 2, 3,$ where $N_1(m)=\max\{x\in \mathbb{N}\colon ϕ(x)\leq m\}$, $N_2(m)=\max(ϕ^{-1}(m))$ and $N_3(m)=\min(ϕ^{-1}(m))$ for $ m\in V$. Masser and Shiu call the elements of $N_1$ as `sparsely totient numbers' and construct an infinite family of these numbers. Here we construct several infinite families of numbers in $N_2\setminus N_1$ and an infinite family of composite numbers in $N_3$. We also study (i) the ratio $\frac{N_2(m)}{N_3(m)}$, which is linked to the Carmichael's conjecture, namely, $|ϕ^{-1}(m)|\geq 2 ~\forall ~ m\in V$, and (ii) arithmetic and geometric progressions in $N_2$ and $N_3$. Finally, using the above sets associated to the totient function, we generate an infinite class of subsets of $\mathbb{N}$, each with asymptotic density zero and containing arbitrarily long arithmetic progressions.

math.NT↗

arXiv2019

Combinatorial properties of sparsely totient numbers

Let $N_1(m)=\max\{n \colon ϕ(n) \leq m\}$ and $N_1 = \{N_1(m) \colon m \in ϕ(\mathbb{N})\}$ where $ϕ(n)$ denotes the Euler's totient function. Masser and Shiu \cite{masser} call the elements of $N_1$ as `sparsely totient numbers' and initiated the study of these numbers. In this article, we establish several results for sparsely totient numbers. First, we show that a squarefree integer divides all sufficiently large sparsely totient numbers and a non-squarefree integer divides infinitely many sparsely totient numbers. Next, we construct explicit infinite families of sparsely totient numbers and describe their relationship with the distribution of consecutive primes. We also study the sparseness of $N_1$ and prove that it is multiplicatively piecewise syndetic but not additively piecewise syndetic. Finally, we investigate arithmetic/geometric progressions and other additive and multiplicative patterns like $\{x, y, x+y\}, \{x, y, xy\}, \{x+y, xy\}$ and their generalizations in the sparsely totient numbers.

math.NT↗

arXiv2019

Geometric progressions in syndetic sets

In order to investigate multiplicative structures in additively large sets, Beiglböck et al. raised a significant open question as to whether or not every subset of the natural numbers with bounded gaps (syndetic set) contains arbitrarily long geometric progressions. A result of Erdős implies that syndetic sets contain a $2$-term geometric progression with integer common ratio, but we still do not know if they contain such a progression with common ratio being a perfect square. In this article, we prove that for each $k\in \mathbb{N}$, a syndetic set contains $2$-term geometric progressions with common ratios of the form $n^kr_1$ and $p^kr_2$, where $p\in\mathbb{P}$ (the set of primes), $n$ is a composite number, $r_1\equiv 1 \pmod{n}$, $r_2\equiv 1\pmod{p}$ and $r_1,r_2\in \mathbb{N}$. We also show that 2-syndetic sets (sets with bounded gap two) contain infinitely many $2$-term geometric progressions with their respective common ratios being perfect squares.

math.NT↗