返回
The sharp threshold for making squares
DOI:10.4007/annals.2018.188.1.2.png)
摘要
En 中文
Consider a random sequence of N integers, each chosen uniformly and independently from the set {1,..., x}. Motivated by applications to factorization algorithms such as Dixon's algorithm, the quadratic sieve, and the number field sieve, Pomerance in 1994 posed the following problem: how large should N be so that, with high probability, this sequence contains a subsequence, the product of whose elements is a perfect square? Pomerance determined asymptotically the logarithm of the threshold for this event and conjectured that it in fact exhibits a sharp threshold in N. More recently, Croot, Granville, Pemantle and Tetali determined the threshold up to a factor of 4 / pi + o(1) as x -> infinity and made a conjecture regarding the location of the sharp threshold. In this paper we prove both of these conjectures by determining the sharp threshold for making squares. Our proof combines techniques from combinatorics, probability and analytic number theory; in particular, we use the so-called method of self-correcting martingales in order to control the size of the 2-core of the random hypergraph that encodes the prime factors of our random numbers. Our method also gives a new (and completely different) proof of the upper bound in the main theorem of Croot, Granville, Pemantle and Tetali.
Keyword:
integer factorization
perfect square
random graph process
期刊
IF:
5.3
论文数:
1.4K
被引数:
1.6W
机构
引用论文
Antimicrobial resistance and molecular typing of Staphylococcus aureus isolates from raw milk in Hunan Province湖南省生牛奶中金黄色葡萄球菌分离株的抗菌药物耐药性与分子分型
PeerJ
IF0
Laboratory‐Scale Production of Tomato Carotenoids Using Bioengineered Escherichia coli利用生物工程改造的Escherichia coli进行实验室规模的番茄类胡萝卜素生产
Transcriptome profiling identifies multistep regulation through E93, Forkhead and Ecdysone Oxidase in survival of Malpighian tubules during metamorphosis in Drosophila转录组分析鉴定了在果蝇变态发育期间,通过E93、Forkhead和蜕皮激素氧化酶对马氏管存活的多步调控。

