Related papers: Entropy numbers of compact embeddings of Smoothnes…

The notion of entropy appears in many fields and this paper is a survey about entropies in several branches of Mathematics. We are mainly concerned with the topological and the algebraic entropy in the context of continuous endomorphisms of…

In this paper we study the polynomial entropy of homeomorphism on compact metric space. We construct a homeomorphism on a compact metric space with vanishing polynomial entropy that it is not equicontinuous. Also we give examples with…

We investigate the relationship between the compactness of embeddings of Sobolev spaces built upon rearrangement-invariant spaces into rearrangement-invariant spaces endowed with $d$-Ahlfors measures under certain restriction on the speed…

In this paper, the embeddings between weighted local Morrey-type spaces and weighted Lebesgue spaces are investigated.

Entropy numbers and covering numbers of sets and operators are well known geometric notions, which found many applications in various fields of mathematics, statistics, and computer science. Their values for finite-dimensional embeddings…

Sobolev embeddings, of arbitrary order, are considered into function spaces on domains of $\mathbb R^n$ endowed with measures whose decay on balls is dominated by a power $d$ of their radius. Norms in arbitrary rearrangement-invariant…

We study point sets arising from cut-and-project constructions. An important class is weak model sets, which include squarefree numbers and visible lattice points. For such model sets, we give a non-trivial upper bound on their pattern…

We consider an entropy-type invariant which measures the polynomial volume growth of submanifolds under the iterates of a map, and we establish sharp uniform lower bounds of this invariant for the following classes of symplectomorphisms of…

We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…

We study homeomorphisms of compact metric spaces whose restriction to the nonwandering set has the pseudo-orbit tracing property. We prove that if there are positively expansive measures, then the topological entropy is positive. Some short…

We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…

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…

We investigate the nature of randomness in disordered packings of frictional spheres. We calculate the entropy of 3D packings through the force and volume ensemble of jammed matter, a mesoscopic ensemble and numerical simulations using…

Entropy is a natural geometric quantity measuring the complexity of a surface embedded in $\mathbb{R}^3$. For dynamical reasons relating to mean curvature flow, Colding-Ilmanen-Minicozzi-White conjectured that the entropy of any closed…

The entropy region is constructed from vectors of random variables by collecting Shannon entropies of all subvectors. Its shape is studied here by means of polymatroidal constructions, notably by convolution. The closure of the region is…

We obtain an improved Sobolev inequality in H^s spaces involving Morrey norms. This refinement yields a direct proof of the existence of optimizers and the compactness up to symmetry of optimizing sequences for the usual Sobolev embedding.…

Many of the traditional results in information theory, such as the channel coding theorem or the source coding theorem, are restricted to scenarios where the underlying resources are independent and identically distributed (i.i.d.) over a…

In this paper we address smoothing-that is, optimisation-based-estimation techniques for localisation problems in the case where motion sensors are very accurate. Our mathematical analysis focuses on the difficult limit case where motion…

We present a general approach to the study of the local distribution of measures on Euclidean spaces, based on local entropy averages. As concrete applications, we unify, generalize, and simplify a number of recent results on local…

Smooth entropies are a tool for quantifying resource trade-offs in (quantum) information theory and cryptography. In typical bi- and multi-partite problems, however, some of the sub-systems are often left unchanged and this is not reflected…