English
Related papers

Related papers: Rauzy dimension and finite-state dimension

200 papers

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

Dynamical Systems · Mathematics 2024-06-28 Paul-Henry Leemann , Tatiana Nagnibeda , Alexandra Skripchenko , Georgii Veprev

We prove a variety of new and refined uniform continuity bounds for entropies of both classical random variables on an infinite state space and of quantum states of infinite-dimensional systems. We obtain the first tight continuity estimate…

Quantum Physics · Physics 2024-11-20 Simon Becker , Nilanjana Datta , Michael G. Jabbour

In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…

Dynamical Systems · Mathematics 2016-04-20 Michael Damron , Jon Fickenscher

A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is…

Information Theory · Computer Science 2015-10-20 Igal Sason , Sergio Verdu

It is well known that the mutual information between two random variables can be expressed as the difference of two relative entropies that depend on an auxiliary distribution, a relation sometimes referred to as the golden formula. This…

Information Theory · Computer Science 2018-06-19 Wei Yang , Austin Collins , Giuseppe Durisi , Yury Polyanskiy , H. Vincent Poor

Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of…

Computational Complexity · Computer Science 2022-09-19 Rahul Chugh , Supartha Podder , Swagato Sanyal

We propose a new point of view on multidimensional continued fraction algorithms inspired by Rauzy induction. The generic behaviour of such an algorithm is described here as a random walk on a graph that we call simplicial system. These…

Dynamical Systems · Mathematics 2020-11-17 Charles Fougeron

Let $\beta\in(1,2)$ and let $H_\beta$ denote Garsia's entropy for the Bernoulli convolution $\mu_\beta$ associated with $\beta$. In the present paper we show that $H_\beta>0.82$ for all $\beta \in (1, 2)$ and improve this bound for certain…

Dynamical Systems · Mathematics 2019-01-03 Kevin G. Hare , Nikita Sidorov

In this paper we develop a general ergodic approach which reveals the underpinnings of the effect of arithmetic operations involving normal and deterministic numbers. This allows us to recast in new light and amplify the result of Rauzy,…

Dynamical Systems · Mathematics 2025-06-17 Vitaly Bergelson , Tomasz Downarowicz

Let $M$ be a finite volume, non-compact hyperbolic Riemann surface, possibly with elliptic fixed points, and let $\chi$ denote a finite dimensional unitary representation of the fundamental group of $M$. Let $\Delta$ denote the hyperbolic…

Number Theory · Mathematics 2021-02-24 Joshua S. Friedman , Jay Jorgenson , Lejla Smajlovic

We revisit entropic formulations of the uncertainty principle for an arbitrary pair of positive operator-valued measures (POVM) $A$ and $B$, acting on finite dimensional Hilbert space. Salicr\'u generalized $(h,\phi)$-entropies, including…

Quantum Physics · Physics 2015-06-18 S. Zozor , G. M. Bosyk , M. Portesi

We introduce a framework to study the random entire function $\zeta_\beta$ whose zeros are given by the Sine$_\beta$ process, the bulk limit of beta ensembles. We present several equivalent characterizations, including an explicit power…

Probability · Mathematics 2023-04-20 Benedek Valkó , Bálint Virág

This paper provides tight bounds on the R\'enyi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one-to-one. To that end, a tight lower bound on the R\'enyi…

Information Theory · Computer Science 2018-12-11 Igal Sason

We study long-range Bernoulli percolation on $\mathbb{Z}^d$ in which each two vertices $x$ and $y$ are connected by an edge with probability $1-\exp(-\beta \|x-y\|^{-d-\alpha})$. It is a theorem of Noam Berger (CMP, 2002) that if…

Probability · Mathematics 2021-02-15 Tom Hutchcroft

Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order complexity of their defining formulas. The Ershov Hierarchy…

Logic · Mathematics 2021-10-07 Nikolay Bazhenov , Manat Mustafa , Sergei Ospichev , Luca San Mauro

Discovery problems often require deciding whether additional sampling is needed to detect all categories whose prevalence exceeds a prespecified threshold. We study this question under a Bernoulli product (incidence) model, where categories…

Methodology · Statistics 2026-01-29 Alessandro Colombi , Mario Beraha , Amichai Painsky , Stefano Favaro

We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…

Number Theory · Mathematics 2025-01-30 Felipe García-Ramos , Gerardo González Robert , Mumtaz Hussain

We derive upper and lower bounds on the overall compression ratio of the 1978 Lempel-Ziv (LZ78) algorithm, applied independently to $k$-blocks of a finite individual sequence. Both bounds are given in terms of normalized empirical entropies…

Information Theory · Computer Science 2025-06-17 Neri Merhav

We present new sharper lower and upper bounds for the non-zero Bernoulli numbers using Euler's formula for the Riemann zeta function. In particular, we determine the best possible constants $ \alpha $ and $ \beta $ such that the double…

General Mathematics · Mathematics 2025-01-20 Yogesh J. Bagul

The principal aim of this note is to illustrate how factorizations of singular, even-order partial differential operators yield an elementary approach to classical inequalities of Hardy-Rellich-type. More precisly, introducing the…

Analysis of PDEs · Mathematics 2017-04-18 Fritz Gesztesy , Lance Littlejohn
‹ Prev 1 2 3 10 Next ›