English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositionsof polynomial sequences. In particular, they showed that when $k \geq 3$, eachinfinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicativelyirreducible. In this paper, we attempt to make their result effective bybuilding a connection between this problem and the bipartite generalization ofthe well-studied Diophantine tuples. More precisely, given an integer $k \geq3$ and a nonzero integer $n$, we call a pair of subsets of positive integers$(A,B)$ \emph{a bipartite Diophantine tuple with property $BD_k(n)$} if$|A|,|B| \geq 2$ and $AB+n \subset \{x^k: x \in \mathbb{N}\}$. We show that$\min \{|A|, |B|\} \ll \log |n|$, extending a celebrated work of Bugeaud andDujella (where they considered the case $n=1$). We also provide an upper boundon $|A||B|$ in terms of $n$ and $k$ under the assumption $\min \{|A|,|B|\}\geq4$ and $k \geq 6$. Specializing our techniques to Diophantine tuples, wesignificantly improve several results by B\'{e}rczes-Dujella-Hajdu-Luca,Bhattacharjee-Dixit-Saikia, and Dixit-Kim-Murty.

Multiplicatively reducible subsets of shifted perfect $k$-th powers and bipartite Diophantine tuples