English
Related papers

Related papers: Real numbers equally compressible in every base

200 papers

We address the following state comparison problem: is it possible to design an experiment enabling us to unambiguously decide (based on the observed outcome statistics) on the sameness or difference of two unknown state preparations without…

Quantum Physics · Physics 2012-06-05 Sergey N. Filippov , Mario Ziman

Let $X$ be a projective toric variety of dimension $n$ and let $L$ be a ample line bundle on $X$. For $k \geq 0$, it is in general difficult to determine whether $L^{\otimes k}$ is very ample and whether it additionally gives a projectively…

Algebraic Geometry · Mathematics 2026-02-25 Praise Adeyemo , Dominic Bunnett , Fabián Levicán-Santibáñez

In this paper, we consider non-normal numbers occurring in dynamical systems fulfilling the specification property. It has been shown that in this case the set of non-normal numbers has measure zero. In the present papers we show that a…

Dynamical Systems · Mathematics 2015-09-30 Manfred G. Madritsch , Izabela Petrykiewicz

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…

Logic · Mathematics 2026-05-08 Cesare Straffelini

In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…

Probability · Mathematics 2020-04-08 Rita Giuliano , Milto Hadjikyriakou

A Cantor series expansion for a real number $x$ with respect to a basic sequence $Q=(q_1,q_2,\dots)$, where $q_i \geq 2$, is a representation of the form $x=a_0 + \sum_{i=1}^\infty \frac{a_i}{q_1q_2\cdots q_i}$ where $0 \leq a_i<q_i$. These…

Logic · Mathematics 2020-10-28 Dylain Airey , Steve Jackson , Bill Mance

We show how universal codes can be used for solving some of the most important statistical problems for time series. By definition, a universal code (or a universal lossless data compressor) can compress any sequence generated by a…

Information Theory · Computer Science 2008-09-09 Boris Ryabko

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Logic · Mathematics 2021-07-26 Dimitra Chompitaki , Manos Kamarianakis , Thanases Pheidas

We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…

General Physics · Physics 2020-12-03 Israel Ariel González Medina

We introduce and study a new topological notion of the size for subsets of the real line, called \emph{super-density}. A set $A\subset\mathbb{R}$ is super-dense if for every non-empty open interval $I$ and every nowhere constant continuous…

Number Theory · Mathematics 2026-04-24 Chokri Manai

Let $[a_1(x),a_2(x),\ldots, a_n(x), \ldots]$ be the continued fraction expansion of an irrational number $x\in (0, 1)$. The study of the growth rate of the product of consecutive partial quotients $a_n(x)a_{n+1}(x)$ is associated with the…

Number Theory · Mathematics 2022-02-25 Hui Hu , Mumtaz Hussain , Yueli Yu

Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We prove that, if the irrationality exponent of $\xi$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable…

Number Theory · Mathematics 2015-10-02 Yann Bugeaud , Dong Han Kim

In this paper we introduce a new formulation of Bennett's logical depth based on pebble transducers. This notion is defined based on the difference between the minimal length descriptional complexity of prefixes of infinite sequences from…

Computational Complexity · Computer Science 2022-01-20 Liam Jordon , Philippe Moser

We introduce the class of partition-balanced families of codes, and show how to exploit their combinatorial invariants to obtain upper and lower bounds on the number of codes that have a prescribed property. In particular, we derive precise…

Information Theory · Computer Science 2018-12-13 Eimear Byrne , Alberto Ravagnani

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

Symbolic Computation · Computer Science 2013-12-31 Abhishek Dubey , Ambedkar Dukkipati

Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa arises naturally when controlling linear differential equations. As a function of the polynomial coefficients, the abscissa is H{\"o}lder…

Optimization and Control · Mathematics 2015-07-31 Roxana Heß , Didier Henrion , Jean-Bernard Lasserre , Tien Son Pham

For a fixed $\theta^2=1/m$, $m \in \mathbb{N}_+$, let $x \in [0, \theta)$ and $[a_1(x) \theta, a_2(x) \theta, \ldots]$ be the $\theta$-expansion of $x$. Our first goal is to extend for $\theta$-expansions the results of Jarnik \cite{J-1928}…

Number Theory · Mathematics 2023-09-25 Gabriela Ileana Sebe , Dan Lascu

We show that measuring any two quantum states by a random POVM, under a suitable definition of randomness, gives probability distributions having total variation distance at least a universal constant times the Frobenius distance between…

Quantum Physics · Physics 2007-05-23 Pranab Sen

We explore a notion of pseudofinite dimension, introduced by Hrushovski and Wagner, on an infinite ultraproduct of finite structures. Certain conditions on pseudofinite dimension are identified that guarantee simplicity or supersimplicity…

Logic · Mathematics 2014-10-01 Dario Garcia , Dugald Macpherson , Charles Steinhorn

By a classical result of Gauss and Kuzmin, the continued fraction expansion of a ``random'' real number contains each digit $a\in\mathbb{N}$ with asymptotic frequency $\log_2(1+1/(a(a+2)))$. We generalize this result in two directions:…

Number Theory · Mathematics 2025-11-06 Alex Jin , Shreyas Singh , Zhuo Zhang , AJ Hildebrand
‹ Prev 1 8 9 10 Next ›