Extremal densities for forbidden configurations in $S$-smooth numbers

TL;DR

This paper determines the extremal densities of subsets of $S$-smooth numbers avoiding certain multiplicative configurations, providing asymptotic formulas, bounds, and structural insights.

Contribution

It establishes precise asymptotic formulas for the maximum size of sets avoiding specific configurations in $S$-smooth numbers and relates these to density constants and structural properties.

Findings

Asymptotic formula for $F_S(X)$ as $X o $

Representation of the density constant $\alpha_S$ in terms of $f_S$

Explicit tail formula and structural propositions for $S=\{2,3\}

Abstract

Let $S = \{p_1,\dots,p_r\}$ be a finite set of distinct primes, let $\Psi_S(X)$ be the number of $S$-smooth integers not exceeding $X$, and let $F_S(X)$ be the maximum size of a subset of $M(S) \cap [1,X]$ containing no set $\{n,p_1 n,\dots,p_r n\}$. We prove that $ F_S(X)=\frac{r}{r+1}\Psi_S(X)+O_S\bigl((\log X)^{r-1}\bigr) $ as $X \to \infty$, and equivalently that $ f_S(k)=\frac{r}{r+1}k+O_S\bigl(k^{(r-1)/r}\bigr) $ for the corresponding extremal function on the first $k$ $S$-smooth numbers. We also relate this problem to the analogous extremal problem on the full interval $[1,N]$. Using the classical theory of such forbidden configurations, we obtain a representation of the corresponding density constant $\alpha_S$ in terms of the increments of $f_S$, along with nested computable bounds and a recursive formula for the reciprocal tail over $S$-smooth numbers. We further show that rational reciprocal sums over $S$-smooth denominators need not arise from eventually periodic binary sequences. In the classical case $S=\{2,3\}$, we derive an explicit tail formula and prove two structural propositions for optimal sets.