arXiv math/04121352004-12math.NT

Poisson statistics via the Chinese remainder theorem

A. Granville, P. Kurlberg

备注：: 32 pages. Lemma 15 corrected (for the case k=2.) Added reference

英文摘要：

We consider the distribution of spacings between consecutive elements in subsets of Z/qZ where q is highly composite and the subsets are defined via the Chinese remainder theorem. We give a sufficient criterion for the spacing distribution to be Poissonian as the number of prime factors of q tends to infinity, and as an application we show that the value set of a generic polynomial modulo q have Poisson spacings. We also study the spacings of subsets of Z/q_1q_2Z that are created via the Chinese remainder theorem from subsets of Z/q_1Z and Z/q_2Z (for q_1,q_2 coprime), and give criteria for when the spacings modulo q_1q_2 are Poisson. We also give some examples when the spacings modulo q_1q_2 are not Poisson, even though the spacings modulo q_1 and modulo q_2 are both Poisson.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Equidistribution from the Chinese Remainder Theorem

We prove the equidistribution of subsets of $(\Rr/\Zz)^n$ defined by fractional parts of subsets of~$(\Zz/q\Zz)^n$ that are constructed using the Chinese Remainder Theorem.

2020-06-08math.NT

Modular Inverses and Chinese Remainder Algorithm

This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is also shown to be applicable for the Chinese Remainder problem, i.e., simultaneous linear congruence equations, for co-prime moduli as well as non-co-prime moduli.

2013-08-29math.NT

A density Chinese Remainder Theorem

Given collections A and B of residue classes modulo m and n, respectively, we investigate conditions on A and B that ensure that, for at least some a in A and b in B, the linear system x = a mod m, x = b mod n has an integer solution, and we quantify the number of such admissible pairs (a,b). The special case where A and B consist of intervals of residue classes has application to the Lonely Runner Conjecture.

2013-02-05math.NT

Computing Hilbert class polynomials with the Chinese Remainder Theorem

We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses O(|D|^(1/2+o(1))log P) space and has an expected running time of O(|D|^(1+o(1)). We describe practical optimizations that allow us to handle larger discriminants than other methods, with |D| as large as 10^13 and h(D) up to 10^6. We apply these results to construct pairing-friendly elliptic curves of prime order, using the CM method.

2013-11-22math.NT

The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem

We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.

2016-08-25cs.CRmath.NT

Constructing Picard curves with complex multiplication using the Chinese Remainder Theorem

We give a new algorithm for constructing Picard curves over a finite field with a given endomorphism ring. This has important applications in cryptography since curves of genus 3 allow for smaller key sizes than elliptic curves. For a sextic CM-field $K$ containing the cube roots of unity, we define and compute certain class polynomials modulo small primes and then use the Chinese Remainder Theorem to construct the class polynomials over the rationals. We also give some examples.

2018-07-17math.AGmath.NT

更多相关论文收起更多论文

A Multivariable Chinese Remainder Theorem

Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise relatively prime and in each row, at least one matrix element a(i,j) is relatively prime to m(i). The Chinese remainder theorem is the special case, where A has only one column.

2012-06-22math.HOmath.NT

Number systems and the Chinese Remainder Theorem

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite expansions for all residue classes modulo $f(x)$, using a suitably chosen digit set. We give precise conditions under which direct or fibred products of two such polynomial number systems are again of the same form. The main tool is a general form of the Chinese Remainder Theorem. We give applications to simultaneous number systems in the integers.

2011-06-21math.ACmath.NT

划分定理与中国剩余定理

Partition theorems and the Chinese remainder theorem

本文利用中国剩余定理证明了一个涵盖欧拉、麦克马洪等所有现有划分定理的综合性定理，并基于特殊完全剩余系推广了欧拉定理，还建立了划分函数间的同余联系。

2023-10-13math.COmath.NT

Exact and Robust Reconstructions of Integer Vectors Based on Multidimensional Chinese Remainder Theorem (MD-CRT)

The robust Chinese remainder theorem (CRT) has been recently proposed for robustly reconstructing a large nonnegative integer from erroneous remainders. It has found many applications in signal processing, including phase unwrapping and frequency estimation under sub-Nyquist sampling. Motivated by the applications in multidimensional (MD) signal processing, in this paper we propose the MD-CRT and robust MD-CRT for integer vectors. Specifically, by rephrasing the abstract CRT for rings in number-theoretic terms, we first derive the MD-CRT for integer vectors with respect to a general set of int…

2020-08-25cs.CRcs.ITmath.IT

Multi-Stage Robust Chinese Remainder Theorem

It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large error in the reconstruction solution. A robust CRT was recently proposed for a special case when the greatest common divisor (gcd) of all the moduli is more than 1 and the remaining integers factorized by the gcd of all the moduli are co-prime. In this special case, a closed-form reconstruction from erroneous remainders was proposed and a necessary and sufficient condition on the remainder errors was obtained. It basically says that the reconstruc…

2013-03-13cs.CEcs.CRcs.IT

Chinese Remainder Theorem for Cyclotomic Polynomials in $\mathbf{Z}[X]$

By the Chinese remainder theorem, the canonical map \[Ψ_n: R[X]/(X^n-1)\to \oplus_{d|n} R[X]/Φ_d(X)\] is an isomorphism when $R$ is a field whose characteristic does not divide $n$ and $Φ_d$ is the $d$th cyclotomic polynomial. When $R$ is the ring $\mathbf{Z}$ of rational integers, this map is injective but not surjective. In this paper, we give an explicit formula for the elementary divisors of the cokernel of $Ψ_n$(when $R=\mathbb{Z}$) using the prime factorisation of $n$. We also give a pictorial algorithm using Young Tableaux that takes $O(n^{3+ε})$ bit operations for any $ε> 0$ to determi…

2015-04-17math.COmath.NTmath.RA

$q$-Supercongruences from squares of basic hypergeometric series

We give some new $q$-supercongruences on truncated forms of squares of basic hypergeometric series. Most of them are modulo the cube of a cyclotomic polynomial, and two of them are modulo the fourth power of a cyclotomic polynomial. The main ingredients of our proofs are the creative microscoping method, a lemma of El Bachraoui, and the Chinese remainder theorem for coprime polynomials. We also propose several related conjectures for further study.

2021-12-17math.NT