Results 81 to 90 of about 93,941 (183)
Moving Sum Procedure for Multiple Change Point Detection in Large Factor Models
Journal of Time Series Analysis, Volume 47, Issue 3, Page 450-464, May 2026.ABSTRACT This paper proposes a moving sum methodology for detecting multiple change points in high‐dimensional time series under a factor model, where changes are attributed to those in loadings as well as emergence or disappearance of factors. We establish the asymptotic null distribution of the proposed test for family‐wise error control and show the
Matteo Barigozzi +2 more
wiley +1 more source
The distribution of \(\alpha p\) modulo one
, 2016 Let \(\|x\|\) be the distance from \(x\) to the nearest integer, and let \(\alpha\) be an irrational number. Then the authors prove that for any \(\varepsilon> 0\) there are infinitely many prime numbers \(p\) such that \(\|\alpha p\|< p^{-16/49+ \varepsilon}\), improving the value \(9/28\) of \textit{C. Jia} [Sci. China, Ser.
Heath-Brown, D, Jia, C
openaire +2 more sources
On the exceptional set in Littlewood's discrete conjecture
Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley +1 more source
On the distribution of αp+β modulo one
Journal of Number Theory, 2017 Abstract Let ‖ ⋅ ‖ denote the minimum distance to an integer. For 0 γ 1 , θ > 0 and ( α , β ) ∈ R ∖ { 0 } × R we study when ‖ α p γ + β ‖ p − θ , holds for infinitely many primes p of a special type.
openaire +1 more source
Quadratic non-residues and non-primitive roots satisfying a coprimality condition
, 2018 Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log 6.83}{\frac{1}{2}-\epsilon} \mbox{
Chattopadhyay, Jaitra +3 more
core
Well-distribution modulo one and the primes
Proceedings of the American Mathematical SocietyLet ( p n )
Champagne, J. +3 more
openaire +2 more sources
On Uniform Distribution Modulo 1 and Functional Convergence
Uniform distribution theoryAbstract In this note, we study the convergence of functional sequences. A criterion for uniform distribution mod 1 is derived. Then we study the partitions, block sequences and the uniform distribution preserving mappings. In the last part, we prove that to each one to one sequence dense in [0, 1] a regular matrix summation method such ...
openaire +1 more source
Log-Like Functions and Uniform Distribution Modulo One
Uniform distribution theory, 2018 Abstract For a function f satisfying f ( x ) = o ((log x ) K
openaire +1 more source
A linearized stabilizer formalism for systems of finite dimension
, 2012 The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum Fourier ...
de Beaudrap, Niel
core
The distribution of sequences modulo one [PDF]
Acta Arithmetica, 1976 Cater, Frank S. +2 more
openaire +2 more sources