English

The descriptive complexity of the set of Poisson generic numbers

Logic 2023-05-19 v1 Number Theory

Abstract

Let b2b\ge 2 be an integer. We show that the set of real numbers that are Poisson generic in base bb is Π30\boldsymbol{\Pi}^0_3-complete in the Borel hierarchy of subsets of the real line. Furthermore, the set of real numbers that are Borel normal in base bb and not Poisson generic in base bb is complete for the class given by the differences between Π30\boldsymbol{\Pi}^0_3 sets. We also show that the effective versions of these results hold in the effective Borel hierarchy.

Keywords

Cite

@article{arxiv.2305.10529,
  title  = {The descriptive complexity of the set of Poisson generic numbers},
  author = {Verónica Becher and Stephen Jackson and Dominik Kwietniak and Bill Mance},
  journal= {arXiv preprint arXiv:2305.10529},
  year   = {2023}
}

Comments

15 pages