相关论文: Rauzy dimension and finite-state dimension

This survey is based on a series of lectures given by the authors at the working seminar "Convexit\'e et Probabilit\'es" at UPMC Jussieu, Paris, during the spring 2013. It is devoted to maximal inequalities associated to symmetric convex…

We study convexity properties of R\'{e}nyi entropy as function of $\alpha>0$ on finite alphabets. We also describe robustness of the R\'{e}nyi entropy on finite alphabets, and it turns out that the rate of respective convergence depends on…

Entropic uncertainty relations in a finite dimensional Hilbert space are investigated. Making use of the majorization technique we derive explicit lower bounds for the sum of R\'enyi entropies describing probability distributions associated…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

This paper investigates the critical behavior of global solutions to a parabolic equation with a Hartree-type nonlinearity of the form $$\left\{\begin{array}{ll} u_{t}+(-\Delta)^{\frac{\beta}{2}} u= (\mathcal{K}\ast |u|^{p})|u|^{q},&\qquad…

The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product…

Discovering discrete algebraic rules from data is a fundamental challenge in machine learning. We formalize this problem through Cayley-table completion -- an algebraic counterpart to classical matrix completion -- where the degree of…

Uncertainty relations for more than two observables have found use in quantum information, though commonly known relations pertain to a pair of observables. We present novel uncertainty and certainty relations of state-independent form for…

The recent work of \cite{CRT,DonohoPol} rigorously proved (in a large dimensional and statistical context) that if the number of equations (measurements in the compressed sensing terminology) in the system is proportional to the length of…

We introduce a parameter space containing all algebraic integers $\beta\in(1,2]$ that are not Pisot or Salem numbers, and a sequence of increasing piecewise continuous function on this parameter space which gives a lower bound for the…

The fundamental goal of information theory is to characterize complex operational tasks using efficiently computable information quantities, Shannon's capacity formula being the prime example of this. However, many tasks in quantum…

Let $\xi$ be a real number and $b \ge 2$ an integer. We study the relationship between the irrationality exponent of $\xi$ and the subword complexity $p(n, \mathbf{x})$ of the $b$-ary expansion $\mathbf{x}$ of $\xi$, where $p(n,…

Let h_R denote an L ^{\infty} normalized Haar function adapted to a dyadic rectangle R contained in the unit cube in dimension d. We establish a non-trivial lower bound on the L^{\infty} norm of the `hyperbolic' sums $$ \sum _{|R|=2 ^{-n}}…

Index Coding has received considerable attention recently motivated in part by real-world applications and in part by its connection to Network Coding. The basic setting of Index Coding encodes the problem input as an undirected graph and…

In this paper we study the uncertainty principle (UP) connecting a function over a finite field and its Mattson-Solomon polynomial, which is a kind of Fourier transform in positive characteristic. Three versions of the UP over finite fields…

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

An information theoretic approach to bounds in superconformal field theories is proposed. It is proved that the supersymmetric R\'enyi entropy $\bar S_\alpha$ is a monotonically decreasing function of $\alpha$ and $(\alpha-1)\bar S_\alpha$…

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

Overparametrization is a key factor in the absence of convexity to explain global convergence of gradient descent (GD) for neural networks. Beside the well studied lazy regime, infinite width (mean field) analysis has been developed for…

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…