English
Related papers

Related papers: Rauzy dimension and finite-state dimension

200 papers

Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities generalize Shannon's chain rule for entropy as well as…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Prasad Tetali

We formulate uncertainty relations for mutually unbiased bases and symmetric informationally complete measurements in terms of the R\'{e}nyi and Tsallis entropies. For arbitrary number of mutually unbiased bases in a finite-dimensional…

Quantum Physics · Physics 2014-02-05 Alexey E. Rastegin

We use entropy rates and Schur concavity to prove that, for every integer k >= 2, every nonzero rational number q, and every real number alpha, the base-k expansions of alpha, q+alpha, and q*alpha all have the same finite-state dimension…

Computational Complexity · Computer Science 2007-07-13 David Doty , Jack H. Lutz , Satyadev Nandakumar

Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…

Quantum Physics · Physics 2021-12-28 Debajyoti Bera , Tharrmashastha Sapv

In 1901, Severi proved that if $Z$ is an irreducible hypersurface in $\mathbb{P}^4(\mathbb{C})$ that contains a three dimensional set of lines, then $Z$ is either a quadratic hypersurface or a scroll of planes. We prove a discretized…

Classical Analysis and ODEs · Mathematics 2021-01-26 Joshua Zahl

Automata networks are a versatile model of finite discrete dynamical systems composed of interacting entities (the automata), able to embed any directed graph as a dynamics on its space of configurations (the set of vertices, representing…

Discrete Mathematics · Computer Science 2025-09-24 Aliénor Goubault-Larrecq , Kévin Perrot

Bounds on information combining are a fundamental tool in coding theory, in particular when analyzing polar codes and belief propagation. They usually bound the evolution of random variables with respect to their Shannon entropy. In recent…

Information Theory · Computer Science 2023-05-05 Christoph Hirche , Xinyue Guan , Marco Tomamichel

This paper is a summary of the general approach outlined in my previous papers toward proving the riemann hypothesis. Numerical and graphical proof of the Riemann Hypothesis is presented with analytical arguments although more work needs…

General Mathematics · Mathematics 2026-02-17 Devin Hardy

We investigate the large-time asymptotics of nonlinear diffusion equations $u_t = \Delta u^p$ in dimension $n \ge 1$, in the exponent interval $p > n/(n+2)$, when the initial datum $u_0$ is of bounded second moment. Precise rates of…

Analysis of PDEs · Mathematics 2015-06-19 J. A. Carrillo , G. Toscani

We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…

Information Theory · Computer Science 2022-06-24 Mihai-Alin Badiu , Justin P. Coon

The asymptotic behavior of solutions to the second-order linear differential equation $d^{2}w/dz^{2}=\{u^{2}f(\alpha,z)+g(z)\}w$ is analyzed for a large real parameter $u$ and $\alpha\in[0,\alpha_{0}]$, where $\alpha_{0}>0$ is fixed. The…

Classical Analysis and ODEs · Mathematics 2025-12-24 T. M. Dunster

We consider numeration systems where digits are integers and the base is an algebraic number $\beta$ such that $|\beta|>1$ and $\beta$ satisfies a polynomial where one coefficient is dominant in a certain sense. For this class of bases…

Number Theory · Mathematics 2011-06-21 Christiane Frougny , Edita Pelantová , Milena Svobodová

The factor complexity of the infinite word $\ubeta$ canonically associated to a non-simple Parry number $\beta$ is studied. Our approach is based on the notion of special factors introduced by Berstel and Cassaigne. At first, we give a…

Combinatorics · Mathematics 2017-05-31 Karel Klouda , Edita Pelantová

We study Boolean functions on the $p$-biased hypercube $(\{0,1\}^n,\mu_p^n)$ through the lens of Fourier (spectral) entropy, i.e. the Shannon entropy of the squared $p$-biased Fourier coefficients. Motivated by recent restriction-based…

Combinatorics · Mathematics 2026-03-13 Fan Chang

We characterize the (essentially) decreasing sequences of positive numbers $\beta$ = ($\beta$ n) for which all composition operators on H 2 ($\beta$) are bounded, where H 2 ($\beta$) is the space of analytic functions f in the unit disk…

Functional Analysis · Mathematics 2022-03-22 Pascal Lefèvre , Daniel Li , Hervé Queffélec , Luis Rodríguez-Piazza

This paper studies the complexity of estimating Renyi divergences of discrete distributions: $p$ observed from samples and the baseline distribution $q$ known \emph{a priori}. Extending the results of Acharya et al. (SODA'15) on estimating…

Information Theory · Computer Science 2017-02-09 Maciej Skorski

Many axiomatic definitions of entropy, such as the R\'enyi entropy, of a random variable are closely related to the $\ell_{\alpha}$-norm of its probability distribution. This study considers probability distributions on finite sets, and…

Information Theory · Computer Science 2016-05-06 Yuta Sakai , Ken-ichi Iwata

Audenaert and Datta recently introduced a two-parameter family of relative R\'{e}nyi entropies, known as the $\alpha$-$z$-relative R\'{e}nyi entropies. The definition of the $\alpha$-$z$-relative R\'{e}nyi entropy unifies all previously…

Quantum Physics · Physics 2015-08-05 Mingyan Simon Lin , Marco Tomamichel

It is well-known that univariate cubic spline interpolation, if carried out on point sets with fill distance $h$, converges only like ${\cal O}(h^2)$ in $L_2[a,b]$ for functions in $W_2^2[a,b]$ if no additional assumptions are made. But…

Numerical Analysis · Mathematics 2016-07-15 Robert Schaback

We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length $\varTheta(n^2)$, where…

Formal Languages and Automata Theory · Computer Science 2016-08-04 Andrzej Kisielewicz , Marek Szykuła