Related papers: Entropy numbers of classes defined by integral ope…
Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half have smaller combinatorial richness and…
This paper studies properties of entropy functions that are induced by groups and subgroups. We showed that many information theoretic properties of those group induced entropy functions also have corresponding group theoretic…
This text is an expanded series of lecture notes based on a 5-hour course given at the workshop entitled "Workshop for young researchers: Groups acting on manifolds" held in Teres\'opolis, Brazil in June 2016. The course introduced a number…
This study considers the unconditional smooth R\'{e}nyi entropy, the smooth conditional R\'{e}nyi entropy proposed by Kuzuoka [\emph{IEEE Trans.\ Inf.\ Theory}, vol.~66, no.~3, pp.~1674--1690, 2020], and a new quantity which we term the…
We define the class of multivariate group entropies as a novel set of information - theoretical measures, which extends significantly the family of group entropies. We propose new examples related to the "super-exponential" universality…
In this paper order estimates for entropy numbers of embeddings of weighted Sobolev spaces on a John domain are obtained. In addition, we obtain order estimates for entropy numbers of summation operators on trees.
In arXiv:1801.01238 a variation of Bowen's topological entropy that can be applied to the study of discontinuous semiflows on compact metric spaces was introduced. The main novetly is the use of certain family of pseudosemimetrics…
The entropies of molecules in solution are routinely calculated using gas phase formulae. It is assumed that, because implicit solvation models are fitted to reproduce free energies, this is sufficient for modeling reactions in solution.…
We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…
In estimating the complexity of objects, in particular of graphs, it is common practice to rely on graph- and information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these…
Different notions of entropy play a fundamental role in the classical theory of dynamical systems. Unlike many other concepts used to analyze autonomous dynamics, both measure-theoretic and topological entropy can be extended quite…
In this paper, we reveal a new connection between approximation numbers of periodic Sobolev type spaces, where the smoothness weights on the Fourier coefficients are induced by a (quasi-)norm $\|\cdot\|$ on $\mathbb{R}^d$, and entropy…
We find two-sided estimates for Kolmogorov, Bernstein, linear and projection widths of the classes of convolutions of $2\pi$-periodic functions $\varphi$, such that $\|\varphi\|_2\le1$, with fixed generated kernels $\Psi_{\bar{\beta}}$,…
In work of C. A. Tracy and the author asymptotic formulas were derived for certain operator determinants which gave solutions to the cylindrical Toda equations. Later the author considered a more general class of operators which retained…
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…
A new approach to the problem of finding the asymptotical behaviour of large orders of semiclassical expansion is suggested. Asymptotics of high orders not only for eigenvalues, but also for eigenfunctions, are constructed. Thus, one can…
We discuss the properties of invariant measures corresponding to iterated function systems (IFSs) with place-dependent probabilities and compute their Renyi entropies, generalized dimensions, and multifractal spectra. It is shown that with…
In this work, we study generalized entropies and information geometry in a group-theoretical framework. We explore the conditions that ensure the existence of some natural properties and at the same time of a group-theoretical structure for…
In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given…
Whether a system is to be considered complex or not depends on how one searches for correlations. We propose a general scheme for calculation of entropies in lattice systems that has high flexibility in how correlations are successively…