Multi-target hyperbolic sieves and elliptic trace obstructions
Abstract
Let N=pq be a product of two primes, and let β be an odd prime not dividing N. For aβπ½β*, the set Ha(N;β)={ax+Nxβ1:xβπ½β*} contains the residue of ap+q modulo β. Since residues outside this set can be excluded when searching for that linear form, it has been applied as a sieve for linear combinations of p and q in recent deterministic integer factorization methods. Its size is (β+Ο(aN))/2, where Ο is the Legendre symbol modulo β. We study unions of these sets, which give a common set of candidate residues for several linear forms and thus allow to sieve for multiple target forms at once. For distinct a,b, we obtain an exact formula for |Ha(N;β)βͺ Hb(N;β)| in terms of K(A,B)=βzβπ½βΟ((z2βA)(z2βB)), A=4aN, B=4bN. The Hasse-Weil bound gives an error of O(ββ) from 3β/4. For fixed cβ 0,1, we prove the elementary identity K(A,cA)=β1βΟ(A)tc, where tc=β1βK(1,c). Hence the union for a primitive-root pair (a,b)=(Ξ³,Ξ³2) has at most two sizes as N varies. We give an exact condition on tΞ³ for the bound 3β/4+1 to hold for every nonzero N modulo β, and compute the first and second moments. For k distinct coefficients, we prove ||βj=1k Haj(N;β)| ββ(1β2βk)| β€ (kβ1+2βk)ββ+k. We derive the corresponding bounds modulo products of distinct primes using the Chinese remainder theorem. We also determine the exact size of the image obtained by restricting x to the nonzero r-th powers, which applies when searching for a divisor of the form ur in N=urv.
Related
- Notes on Obstructions in the Hyperbolic Clifford Algebra Bundle Structure
- Notes on obstructions in the hyperbolic Clifford algebra bundle structure
- A Mixed Elliptic--Hyperbolic Monge--Ampère Problem: Modeling and a Least-Squares Solver
- Existence and non-existence of nonradial solutions to an elliptic equation on hyperbolic space with critical and subcritical nonlinearities
- Hyperbolic Area Methods in Meromorphic Dynamics and Elliptic Polynomial Skew Products
BibTeX
@misc{stanica2026multitarget,
title = {{Multi-target hyperbolic sieves and elliptic trace obstructions}},
author = {Pantelimon StΔnicΔ and Erik Mulder and Markus Hittmeir},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.13018},
eprint = {2606.13018},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.13018},
}
RIS
TY - UNPB
TI - Multi-target hyperbolic sieves and elliptic trace obstructions
AU - Pantelimon StΔnicΔ
AU - Erik Mulder
AU - Markus Hittmeir
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2606.13018
UR - https://arxiv.org/abs/2606.13018
AB - Let N=pq be a product of two primes, and let β be an odd prime not dividing N. For aβπ½_β^*, the set H_a(N;β)={ax+Nx^β1:xβπ½_β^*} contains the residue of ap+q modulo β. Since residues outside this set can be excluded when searching for that linear form, it has been applied as a sieve for linear combinations of p and q in recent deterministic integer factorization methods. Its size is (β+Ο(aN))/2, where Ο is the Legendre symbol modulo β. We study unions of these sets, which give a common set of candidate residues for several linear forms and thus allow to sieve for multiple target forms at once. For distinct a,b, we obtain an exact formula for |H_a(N;β)βͺ H_b(N;β)| in terms of K(A,B)=β_zβπ½_βΟ((z^2βA)(z^2βB)), A=4aN, B=4bN. The Hasse-Weil bound gives an error of O(ββ) from 3β/4. For fixed cβ 0,1, we prove the elementary identity K(A,cA)=β1βΟ(A)t_c, where t_c=β1βK(1,c). Hence the union for a primitive-root pair (a,b)=(Ξ³,Ξ³^2) has at most two sizes as N varies. We give an exact condition on t_Ξ³ for the bound 3β/4+1 to hold for every nonzero N modulo β, and compute the first and second moments. For k distinct coefficients, we prove ||β_j=1^k H_a_j(N;β)| ββ(1β2^βk)| β€ (kβ1+2^βk)ββ+k. We derive the corresponding bounds modulo products of distinct primes using the Chinese remainder theorem. We also determine the exact size of the image obtained by restricting x to the nonzero r-th powers, which applies when searching for a divisor of the form u^r in N=u^rv.
ER -