English
Related papers

Related papers: Real numbers equally compressible in every base

200 papers

We introduce a class of states of a composite quantum system, the so-called cross states, that turn out to play a major role in the theory of entanglement for a genuinely infinite-dimensional bipartite system. In the case where at least one…

Mathematical Physics · Physics 2026-02-23 Paolo Aniello

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

We propose a counting dimension for subsets of Z and prove that, under certain conditions on two such subsets E and F, for Lebesgue almost every real \lambda\ the counting dimension of E+[\lambda F] is at least the minimum between 1 and the…

Dynamical Systems · Mathematics 2020-04-21 Yuri Lima , Carlos Gustavo Moreira

We show that the set of numbers that are $Q$-distribution normal but not simply $Q$-ratio normal has full Hausdorff dimension. It is further shown under some conditions that countable intersections of sets of this form still have full…

Number Theory · Mathematics 2014-04-17 Bill Mance

For a positive integer $n$ and a real number $\xi$, let $\lambda_n (\xi)$ denote the supremum of the real numbers $\lambda$ for which there are arbitrarily large positive integers $q$ such that $|| q \xi ||, || q \xi^2 ||, \ldots , ||q…

Number Theory · Mathematics 2019-06-14 Dmitry Badziahin , Yann Bugeaud

This paper introduces two complexity-theoretic formulations of Bennett's logical depth: finite-state depth and polynomial-time depth. It is shown that for both formulations, trivial and random infinite sequences are shallow, and a slow…

Computational Complexity · Computer Science 2007-07-13 David Doty , Philippe Moser

Given some integer $m \geq 3$, we find the first explicit collection of countably many intervals in $(1,2)$ such that for any $q$ in one of these intervals, the set of points with exactly $m$ base $q$ expansions is nonempty and moreover has…

Dynamical Systems · Mathematics 2025-01-17 Simon Baker , George Bender

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Computational Complexity · Computer Science 2016-08-15 Peter Franek , Stefan Ratschan , Piotr Zgliczynski

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

Logic · Mathematics 2021-08-05 Martin Klazar

Given a narrow signal over the real line, there is a limit to the localisation of its Fourier transform. In spaces of prime dimensions, Tao derived a sharp state-independent uncertainty relation which holds for the support sizes of a pure…

Quantum Physics · Physics 2023-01-23 Vincenzo Fiorentino , Stefan Weigert

Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…

Number Theory · Mathematics 2024-02-23 Aafko Boonstra , Charlene Kalle

Let $p$ be a prime number. For a positive integer $n$ and a real number $\xi$, let $\lambda_n (\xi)$ denote the supremum of the real numbers $\lambda$ for which there are infinitely many integer tuples $(x_0, x_1, \ldots , x_n)$ such that…

Number Theory · Mathematics 2021-06-28 Dzmitry Badziahin , Yann Bugeaud , Johannes Schleischitz

In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…

Logic · Mathematics 2023-01-31 Peter Hertling , Philip Janicki

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq \alpha X$ and $|B| \geq \beta X$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (\alpha…

Number Theory · Mathematics 2014-02-26 Javier Cilleruelo , D. S. Ramana , Olivier Ramare

Number systems with a rational number $a/b > 1$ as base have gained interest in recent years. In particular, relations to Mahler's 3/2-problem as well as the Josephus problem have been established. In the present paper we show that the…

Number Theory · Mathematics 2013-11-21 Johannes F. Morgenbesser , Wolfgang Steiner , Jörg Thuswaldner

The Littlewood Conjecture states that liminf_{q\to \infty} q . ||qx|| . ||qy|| = 0 for all pairs (x,y) of real numbers. We show that with the additional factor of log q . loglog q the statement is false. Indeed, our main result implies that…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

Number Theory · Mathematics 2017-07-11 Christoph Aistleitner , Verónica Becher , Adrian-Maria Scheerer , Theodore Slaman

We consider the statistical problem of `compressive' estimation of low rank states with random basis measurements, where the estimation error is expressed terms of two metrics - the Frobenius norm and quantum infidelity. It is known that…

Quantum Physics · Physics 2019-01-04 Anirudh Acharya , Madalin Guta

In the realistic quantum key distribution (QKD), Alice and Bob respectively get a quantum state from an unknown channel, whose dimension may be unknown. However, while discussing the security, sometime we need to know exact dimension, since…

Quantum Physics · Physics 2019-09-25 Yi-Bo Zhao , Zheng-Fu Han , Guang-Can Guo

It is well known that normality can be described as incompressibility via finite automata. Still the statement and the proof of this result as given by Becher and Heiber (2013) in terms of "lossless finite-state compressors" do not follow…

Information Theory · Computer Science 2020-08-25 Alexander Kozachinskiy , Alexander Shen
‹ Prev 1 3 4 5 6 7 10 Next ›