On the discrepancy of Markov-normal sequences

DOI10.5802/JTNB.178MaRDI QIDQ679105zbMATH OpenOpenAlexFDO

Publication date 8 July 1999

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_1996__8_2_413_0, https://eudml.org/doc/232447, http://www.emis.de/journals/JTNB/1996-2/jtnb8-2.html

zbMATH Keywords

discrepancy irreducible Markov transition matrix Markov normal sequence uniform distribution mod 1

Mathematics Subject Classification ID

Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Irregularities of distribution, discrepancy (11K38)

Review text

Let the base \(q\) be fixed and \(P=(p_{i,j})_{0\leq i,j\leq q-1}\) be an irreducible Markov transition matrix, \((p_i)_{0\leq i,j\leq q-1}\) the stationary probability vector of \(P\) and \(\mu\) its probability measure. A number \(\alpha\) is said to be Markov normal if in a \(q\)-ary expansion of \(\alpha\) each fixed finite block of digits \(b_0b_1\dots b_k\) appears with an asymptotic frequency of \(p_{b_0}p_{b_0b_1}\dots p_{b_{k-1}b_k}\). The author constructs a Markov normal number \(\alpha\) such that the \(\mu\)-discrepancy of the sequence \((\alpha q^n) \) is \(O(N^{-1/2}\log^2 N)\), where the \(O\)-constant depends only on \(P\) . Until now the best known estimate of the discrepancy was \(O(e^{-c(\log N)^{1/2}})\).

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On the discrepancy of Markov-normal sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679105)