<abstract xmlns="http://www.w3.org/1999/xhtml"> For an integer b > 1 let (φb(n))n≥0 denote the van der Corput sequence base in b in [0, 1). Answering a question of O. Strauch, C. Aistleitner and M. Hofer showed that the distribution function of (φb(n), φb(n + 1), . . . , φb(n + s − 1))n≥0 on [0, 1)s exists and is a copula. The first and third authors of the present paper showed that this phenomenon extends to a broad class of subsequences of the van der Corput sequence. In this result we extend this paper still further and show that this phenomenon is also true for more general numeration systems based on the beta expansion of W. Parry and A. Rényi.</abstract>

Distribution Functions for Subsequences of Generalized Van Der Corput Sequences

<abstract xmlns="http://www.w3.org/1999/xhtml"> We consider a class of double exponential sums studied in a paper of Sinai and Ulcigrai. They proved a linear bound for these sums along the sequence of denominators in the continued fraction expansion of α, provided α is badly-approximable. We provide a proof of a result, which includes a simple proof of their theorem, and which applies for all irrational α.</abstract>

Upper Bounds for Double Exponential Sums Along a Subsequence

<abstract xmlns="http://www.w3.org/1999/xhtml"> We state a new formula to compute the Markoff numbers using iterated palindromic closure and the Thue-Morse substitution. The main theorem shows that for each Markoff number m, there exists a word v ∈ {a, b}∗ such that m − 2 is equal to the length of the iterated palindromic closure of the iterated antipalindromic closure of the word av. This construction gives a new recursive construction of the Markoff numbers by the lengths of the words involved in the palindromic closure. This construction interpolates between the Fibonacci numbers and the Pell numbers.</abstract>

Palindromic Closures and Thue-Morse Substitution for Markoff Numbers

<abstract xmlns="http://www.w3.org/1999/xhtml"> The LS-sequences are a parametric family of sequences of points in the unit interval. They were introduced by Carbone [4], who also proved that under an appropriate choice of the parameters L and S, such sequences are lowdiscrepancy. The aim of the present paper is to provide explicit constants in the bounds of the discrepancy of LS-sequences. Further, we generalize the construction of Carbone [4] and construct a new class of sequences of points in the unit interval, the generalized LS-sequences.</abstract>

Discrepancy of Generalized LS-Sequences

<abstract xmlns="http://www.w3.org/1999/xhtml"> Given a real number 0.a1a2a3 . . . that is normal to base b, we examine increasing sequences ni so that the number 0.an1an2an3 . . . are normal to base b. Classically, it is known that if the ni form an arithmetic progression, then this will work. We give several more constructions including ni that are recursively defined based on the digits ai. Of particular interest, we show that if a number is normal to base b, then removing all the digits from its expansion which equal (b−1) leaves a base-(b−1) expansion that is normal to base (b − 1)</abstract>

Uncanny Subsequence Selections That Generate Normal Numbers

<abstract xmlns="http://www.w3.org/1999/xhtml"> For any real number s, let σs be the generalized divisor function, i.e., the arithmetic function defined by σs(n) := ∑d|n ds, for all positive integers n. We prove that for any r > 1 the topological closure of σ−r(N+) is the union of a finite number of pairwise disjoint closed intervals I1, . . . , Iℓ. Moreover, for k = 1, . . . , ℓ, we show that the set of positive integers n such that σ−r(n) ∈ Ik has a positive rational asymptotic density dk. In fact, we provide a method to give exact closed form expressions for I1, . . . , Iℓ and d1, . . . , dℓ, assuming to know r with sufficient precision. As an example, we show that for r = 2 it results ℓ = 3, I1 = [1, π2/9], I2 = [10/9, π2/8], I3 = [5/4, π2/6], d1 = 1/3, d2 = 1/6, and d3 = 1/2. </abstract>

On the Closure of the Image of the Generalized Divisor Function

<abstract xmlns="http://www.w3.org/1999/xhtml"> Let f(x) be a monic polynomial in Z[x] with roots α1, . . ., αn. We point out the importance of linear relations among 1, α1, . . . , αn over rationals with respect to the distribution of local roots of f modulo a prime. We formulate it as a conjectural uniform distribution in some sense, which elucidates data in previous papers.</abstract>

Notes on the Distribution of Roots Modulo a Prime of a Polynomial

<abstract xmlns="http://www.w3.org/1999/xhtml"> We here correct two errors of our paper cited in the title: one in the statement of Theorem 5 and another in the proof of Theorem 11.</abstract>

Corrigendum to the h-Critical Number of Finite Abelian Groups

<abstract xmlns="http://www.w3.org/1999/xhtml"> Denote by Θ1,Θ2, · · · the sequence of approximation coefficients of Minkowski’s diagonal continued fraction expansion of a real irrational number x. For almost all x this is a uniformly distributed sequence in the interval [0, 1/2 ]. The average distance between two consecutive terms of this sequence and their correlation coefficient are explicitly calculated and it is shown why these two values are close to 1/6 and 0, respectively, the corresponding values for a random sequence in [0, 1/2].</abstract>

A Note on the Continued Fraction of Minkowski

AHEAD OF PRINT

Volume 18 (2023): Issue 1 (July 2023)

Volume 17 (2022): Issue 2 (December 2022)

Volume 17 (2022): Issue 1 (May 2022)

Volume 16 (2021): Issue 2 (December 2021)

Volume 16 (2021): Issue 1 (June 2021)

Volume 15 (2020): Issue 2 (December 2020)

Volume 15 (2020): Issue 1 (June 2020)

Volume 14 (2019): Issue 2 (December 2019)

Volume 14 (2019): Issue 1 (June 2019) The sixth International Conference on Uniform Distribution Theory (UDT 2018) CIRM, Luminy, Marseilles, France, October 1–5, 2018

Volume 13 (2018): Issue 2 (December 2018)

Volume 13 (2018): Issue 1 (June 2018)

Volume 12 (2017): Issue 2 (December 2017)

Volume 12 (2017): Issue 1 (June 2017)

Volume 11 (2016): Issue 2 (December 2016)

Volume 11 (2016): Issue 1 (June 2016)

Uniform distribution theory

 The journal is published by:The BOKU-University of Natural Resources and Applied Life Sciences (Vienna, Austria) and Institute of Mathematics of the Slovak Academy of Sciences, (Bratislava, Slovakia)  The aim of this journal is to publish original research papers on various aspects of uniform distribution theory, especially theoretical and computational aspects of combinatorial, diophantine and probabilistic number theory. In particular we welcome submissions on the following topics:   Distribution of one dimensional and multidimensional sequences.  Distribution of binary sequences.  Distribution of integer sequences and sequences from groups and  Distribution problems in finite abstract sets.  Continuously uniform distributions.  Discrepancies.  Pseudo-random number generators.  Quasi-Monte Carlo integration.  Quasi-Monte Carlo methods in financial mathematics.  Theory of densities.  Theory of distribution functions of sequences.  Distribution of integer points in large domains.  Spectral properties of sequences.  Dynamics emerging from sequences.  Number theoretic ciphers and codes.  Combinatorial number theory.  Trigonometric sums.  Diophantine approximations and diophantine equations.  Continued fractions.  Quantum chaos.  In terms of the AMS subject classification, the main subject areas supported are:11K, 11J, 11B and 11L.  Company Registration Number: 00166791; ISSN 1336–913X; EV 4556/12; math.boku.ac.at/udt  Archiving  Sciendo archives the contents of this journal in Portico - digital long-term preservation service of scholarly books, journals and collections.  Plagiarism Policy  The editorial board is participating in a growing community of Similarity Check System's users in order to ensure that the content published is original and trustworthy. Similarity Check is a medium that allows for comprehensive manuscripts screening, aimed to eliminate plagiarism and provide a high standard and quality peer-review process. 