Table of Contents
Fetching ...

Multiplicative irreducibility of small perturbations of the set of shifted $k$-th powers

Chi Hoi Yip

TL;DR

For $k\ge3$ and nonzero $n$, the paper proves that perturbing $o(X^{1/k})$ elements of the set $\{x^k+n:x\in\mathbb N\}$ up to $X$ preserves multiplicative irreducibility, extending previous results for $M_k'$. The proof hinges on a local-bipartite-Diophantine-tuple framework and extremal graph theory (Kővári–Sós–Turán) to rule out multiplicative decompositions by showing any such decomposition would force forbidden local structures. Key ingredients include a gap principle for simultaneous $k$-th power representations and sharp bounds on the number of large elements in one side of a BD$_k(n)$ tuple. The result advances understanding of how small perturbations interact with multiplicative structure and highlights connections between Diophantine tuples, extremal graph theory, and additive-multiplicative decompositions.

Abstract

Motivated by a conjecture of Erdős on the additive irreducibility of small perturbations of the set of squares, recently Hajdu and Sárközy studied a multiplicative analogue of the conjecture for shifted $k$-th powers. They conjectured that for each $k\geq 2$, if one changes $o(X^{1/k})$ elements of $M_k'=\{x^k+1: x \in \mathbb{N}\}$ up to $X$, then the resulting set cannot be written as a product set $AB$ nontrivially. In this paper, we confirm a more general version of their conjecture for $k\geq 3$.

Multiplicative irreducibility of small perturbations of the set of shifted $k$-th powers

TL;DR

For and nonzero , the paper proves that perturbing elements of the set up to preserves multiplicative irreducibility, extending previous results for . The proof hinges on a local-bipartite-Diophantine-tuple framework and extremal graph theory (Kővári–Sós–Turán) to rule out multiplicative decompositions by showing any such decomposition would force forbidden local structures. Key ingredients include a gap principle for simultaneous -th power representations and sharp bounds on the number of large elements in one side of a BD tuple. The result advances understanding of how small perturbations interact with multiplicative structure and highlights connections between Diophantine tuples, extremal graph theory, and additive-multiplicative decompositions.

Abstract

Motivated by a conjecture of Erdős on the additive irreducibility of small perturbations of the set of squares, recently Hajdu and Sárközy studied a multiplicative analogue of the conjecture for shifted -th powers. They conjectured that for each , if one changes elements of up to , then the resulting set cannot be written as a product set nontrivially. In this paper, we confirm a more general version of their conjecture for .

Paper Structure

This paper contains 3 sections, 7 theorems, 14 equations.

Key Result

Theorem 1.3

Let $k,n$ be integers with $k\geq 3$ and $n\neq 0$. If we change $o(X^{1/k})$ elements of the set $\{x^k+n: x \in \mathbb{N}\} \cap \mathbb{N}$ up to $X$, then the new set $R$ is always multiplicatively irreducible.

Theorems & Definitions (14)

  • Conjecture 1.1: Erdős
  • Conjecture 1.2: Hajdu and Sárközy
  • Theorem 1.3
  • Lemma 1.4: Kövári-Sós-Turán theorem
  • Proposition 2.1: Y25b
  • Corollary 2.2
  • Lemma 2.3: Y25b
  • Corollary 2.4
  • proof
  • Corollary 2.5
  • ...and 4 more