Computable absolutely Pisot normal numbers

DOI10.4064/AA8661-8-2017MaRDI QIDQ4581948zbMATH OpenOpenAlexFDO

Authors Adrian-Maria Scheerer, Robert F. Tichy, Manfred G. Madritsch

Publication date 21 August 2018

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.06388

zbMATH Keywords

discrepancynormal numberscomputability

Mathematics Subject Classification ID

Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Number-theoretic algorithms; complexity (11Y16)

Abstract: We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with non-integer bases.

Recommendations

• A polynomial-time algorithm for computing absolutely normal numbers
• Normality in non-integer bases and polynomial time randomness
• Computable absolutely normal numbers and discrepancies
• Computing absolutely normal numbers in nearly linear time
• A computable absolutely normal Liouville number

Cited in

(12)

• Normality in non-integer bases and polynomial time randomness
• Turing's unpublished algorithm for normal numbers
• A computable absolutely normal Liouville number
• An example of a computable absolutely normal number
• Normal numbers and limit computable Cantor series
• Normal numbers and computer science
• Computing absolutely normal numbers in nearly linear time
• Feasible analysis, randomness, and base invariance
• Introducing Minkowski normality
• A polynomial-time algorithm for computing absolutely normal numbers
• On a question of Mendès France on normal numbers
• Computable absolutely normal numbers and discrepancies

This page was built for publication: Computable absolutely Pisot normal numbers

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