Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 31 min ago
PreprintCC BY-NC-SA 4.0arXiv

Intersective Polynomials and Universal Separation of Divosor Profiles

Abstract

We classify universal divisor-profile separation for coprime polynomial pairs of arbitrary degree and for all pairs of degree at most two. For A⊂N and m∈Z, let dA(m) count the members of A dividing m. For coprime nonzero F,G∈Z[x], universally unbounded separation between dA(F(n)) and dA(G(n)) occurs if and only if one of F,G is intersective, that is, has a root modulo every positive integer. More generally, an intersective factor separated from finitely many polynomial opponents yields simultaneous one-sided dominance against all of them. For pairs with common irreducible factors, let U,V be the products of the factors occurring only on the two respective sides. Universal separation forces UV to have a root modulo almost every prime; equivalently, its Galois action has no derangement. We resolve the remaining finite p-adic boundary for all pairs of degree at most two: separation holds exactly when UV and at least one of F,G are intersective, and the criterion is unchanged by contents or factor multiplicities. The same criterion holds, in arbitrary degree, for three linear support factors with arbitrary positive multiplicities. The proofs combine uniform almost-prime values on root progressions with an adaptive local-routing argument.

Related

  1. Multidimensional Szemerédi Theorem for Pairwise Independent Jointly Intersective Polynomials
    Nikos Frantzikinakis, Davide Sclosa
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Threshold Topologies and Separation Polynomials of Digital Images
    K. R. Manoj, P. B. Ramkumar, P. B. Vinod Kumar
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  3. Orthogonal polynomials and the centres of the universal central extensions of superelliptic Krichever--Novikov algebras
    Felipe Albino dos Santos
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. Universal polynomials for Gromov-Witten invariants on toric surfaces
    Yanqiao Ding, Dadi Ni
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Cluster Geometry of Universal Schubert Polynomials I: Geometric Bases and Schubert Transitions
    Jiarui Fei
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{zhang2026intersective,
  title = {{Intersective Polynomials and Universal Separation of Divosor Profiles}},
  author = {Zihan Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2608.13388},
  eprint = {2608.13388},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2608.13388},
  note = {CC BY-NC-SA 4.0},
}
RIS
TY  - UNPB
TI  - Intersective Polynomials and Universal Separation of Divosor Profiles
AU  - Zihan Zhang
PY  - 2026
DA  - 2026/11/03
PB  - arXiv
DO  - 10.48550/arxiv.2608.13388
UR  - https://arxiv.org/abs/2608.13388
AB  - We classify universal divisor-profile separation for coprime polynomial pairs of arbitrary degree and for all pairs of degree at most two. For A⊂N and m∈Z, let d_A(m) count the members of A dividing m. For coprime nonzero F,G∈Z[x], universally unbounded separation between d_A(F(n)) and d_A(G(n)) occurs if and only if one of F,G is intersective, that is, has a root modulo every positive integer. More generally, an intersective factor separated from finitely many polynomial opponents yields simultaneous one-sided dominance against all of them. For pairs with common irreducible factors, let U,V be the products of the factors occurring only on the two respective sides. Universal separation forces UV to have a root modulo almost every prime; equivalently, its Galois action has no derangement. We resolve the remaining finite p-adic boundary for all pairs of degree at most two: separation holds exactly when UV and at least one of F,G are intersective, and the criterion is unchanged by contents or factor multiplicities. The same criterion holds, in arbitrary degree, for three linear support factors with arbitrary positive multiplicities. The proofs combine uniform almost-prime values on root progressions with an adaptive local-routing argument.
ER  -