Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 51 min ago
PreprintarXiv licencearXiv

Counting k-tuples of positive integers such that the values of several polynomials of k variables are relatively prime

Abstract

Let F=(f1(x1,…,xk),…, fm(x1,…,xk)) be a system of nonconstant polynomials of k variables with integer coefficients and let gcdF(x1,…,xk)= gcd(f1(x1,…,xk),…, fm(x1,…,xk)). We obtain an unconditional asymptotic formula for the sum ∑1≤ x1,…,xk≤ x h(gcdF(x1,…,xk)), where F is a system of m≥ 2 polynomials of k≥ 2 variables subject to certain general properties, and h is a bounded strongly multiplicative function. In particular, we deduce an asymptotic formula with error term concerning the density of k-tuples of positive integers (x1,…,xk) such that gcdF(x1,…,xk)=1, given by the Ekedahl-Poonen formula.

Related

  1. On integers n relatively prime to ⌊ αn2⌋
    Aahan Chatterjee
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Asymptotic counting of integers with prime factors pra sb
    Mehdi Golafshan
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. Counting Admissible Sets of Integers: A Proof of the Erdős--Nicolas--Sárközy Conjecture
    Guoqing Wang, Wenkai Yang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Reducible fibers of polynomials over integers: the Hilbert-Siegel problem over ℚ and its applications
    Joachim König
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. A 4AP-free permutation of the positive integers
    Boon Suan Ho
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{toth2026counting,
  title = {{Counting $k$-tuples of positive integers such that the values of several polynomials of $k$ variables are relatively prime}},
  author = {László Tóth},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28284},
  eprint = {2609.28284},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28284},
}
RIS
TY  - UNPB
TI  - Counting k-tuples of positive integers such that the values of several polynomials of k variables are relatively prime
AU  - László Tóth
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28284
UR  - https://arxiv.org/abs/2609.28284
AB  - Let F=(f_1(x_1,…,x_k),…, f_m(x_1,…,x_k)) be a system of nonconstant polynomials of k variables with integer coefficients and let gcd_F(x_1,…,x_k)= gcd(f_1(x_1,…,x_k),…, f_m(x_1,…,x_k)). We obtain an unconditional asymptotic formula for the sum ∑_1≤ x_1,…,x_k≤ x h(gcd_F(x_1,…,x_k)), where F is a system of m≥ 2 polynomials of k≥ 2 variables subject to certain general properties, and h is a bounded strongly multiplicative function. In particular, we deduce an asymptotic formula with error term concerning the density of k-tuples of positive integers (x_1,…,x_k) such that gcd_F(x_1,…,x_k)=1, given by the Ekedahl-Poonen formula.
ER  -