2021/06/20 by Bourla, Avraham
#FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2106.10712
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the form of a sequence of normal approximates. We develop numeration systems and real expansions allowing this notion of normality to percolate into the general inhomogeneous setting.