Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Distribution of recursive matrix pseudorandom number generator modulo prime powers
HTML articles powered by AMS MathViewer

by László Mérai and Igor E. Shparlinski
Math. Comp. 93 (2024), 1355-1370
DOI: https://doi.org/10.1090/mcom/3895
Published electronically: October 25, 2023

Abstract:

Given a matrix $A\in \mathrm {GL}_d(\mathbb {Z})$. We study the pseudorandomness of vectors $\mathbf {u}_n$ generated by a linear recurrence relation of the form \begin{equation*} \mathbf {u}_{n+1} \equiv A \mathbf {u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots , \end{equation*} modulo $p^t$ with a fixed prime $p$ and sufficiently large integer $t \geqslant 1$. We study such sequences over very short segments of length which has not been accessible via previously used methods. Our technique is based on the method of N. M. Korobov [Mat. Sb. (N.S.) 89(131) (1972), pp. 654–670, 672] of estimating double Weyl sums and a fully explicit form of the Vinogradov mean value theorem due to K. Ford [Proc. London Math. Soc. (3) 85 (2002), pp. 565–633]. This is combined with some ideas from the work of I. E. Shparlinski [Proc. Voronezh State Pedagogical Inst., 197 (1978), 74–85 (in Russian)] which allows us to construct polynomial representations of the coordinates of $\mathbf {u}_n$ and control the $p$-adic orders of their coefficients in polynomial representations.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2020): 11K38, 11K45, 11L07
  • Retrieve articles in all journals with MSC (2020): 11K38, 11K45, 11L07
Bibliographic Information
  • László Mérai
  • Affiliation: Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenberger Straße 69, A-4040 Linz, Austria; and Department of Computer Algebra, Eötvös Loránd University, H-1117 Budapest, Pazmány Péter sétány 1/C, Hungary
  • Email: laszlo.merai@oeaw.ac.at
  • Igor E. Shparlinski
  • Affiliation: I.E.S.: School of Mathematics and Statistics, University of New South Wales, Sydney, NSW 2052, Australia
  • MR Author ID: 192194
  • ORCID: 0000-0002-5246-9391
  • Email: igor.shparlinski@unsw.edu.au
  • Received by editor(s): February 16, 2023
  • Received by editor(s) in revised form: June 22, 2023
  • Published electronically: October 25, 2023
  • Additional Notes: During the preparation of this work the first author was partially supported by the Austrian Science Fund FWF Projects F 5506, which is part of the Special Research Program “Quasi-Monte Carlo Methods: Theory and Applications” and by NRDI (National Research Development and Innovation Office, Hungary) grant FK142960, and the second author by the Australian Research Council Grants DP170100786 and DP200100355.
  • © Copyright 2023 American Mathematical Society
  • Journal: Math. Comp. 93 (2024), 1355-1370
  • MSC (2020): Primary 11K38, 11K45, 11L07
  • DOI: https://doi.org/10.1090/mcom/3895
  • MathSciNet review: 4709205