Related papers: Entropy of Closure Operators
How hard is it guess a password? Massey showed that that the Shannon entropy of the distribution from which the password is selected is a lower bound on the expected number of guesses, but one which is not tight in general. In a series of…
Mobile sensor data has been proposed for security-critical applications such as device pairing, proximity detection, and continuous authentication. However, the foundational premise that these signals provide sufficient entropy remains…
Interest in higher-order tensors has recently surged in data-intensive fields, with a wide range of applications including image processing, blind source separation, community detection, and feature extraction. A common paradigm in…
We discuss several open problems on spectrally bounded operators, some new, some old, adding in a few new insights.
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…
It is well-known that von Neumann entropy is nonmonotonic unlike Shannon entropy (which is monotonically nondecreasing). Consequently, it is difficult to relate the entropies of the subsystems of a given quantum state. In this paper, we…
In this paper, we study the properties of closure operators obtained as initial lifts along a reflector, and compactness with respect to them in particular. Applications in the areas of topology, topological groups and topological…
The statistics of work done on a quantum system can be quantified by the two-point measurement scheme. We show how the Shannon entropy of the work distribution admits a general upper bound depending on the initial diagonal entropy, and a…
Entropies of mixing can be derived directly from the parent distributions of extreme value theory. They correspond to pseudo-additive entropies in the case of Pareto and power function distributions, while to the Shannon entropy in the case…
We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round…
In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction.…
This study introduces the syntropy function ($S_N$) and expectancy function ($E_N$), derived from the novel function $\phi$, to provide a refined perspective on complexity, extending beyond conventional entropy analysis. $S_N$ is designed…
In this note, we give an example of a densely defined non-closable paranormal operator. Then, we give another example of a densely defined closable paranormal operator whose closure fails to be paranormal. These two examples are simpler…
We investigate the one-loop entanglement entropy of two short intervals with small cross ratio $x$ on a complex plane in two-dimensional conformal field theory (CFT) using operator product expansion of twist operators. We focus on the…
We show that a densely defined closable operator $A$ such that the resolvent set of $A^2$ is not empty is necessarily closed. This result is then extended to the case of a polynomial $p(A)$. We also generalize a recent result by…
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 this work, we introduce a notion of reachability entropy to characterize the smallest data rate which is sufficient enough to enforce reach-while-stay specification. We also define data rates of coder-controllers that can enforce this…
This paper derives bounds for two omnipresent information theoretic measures, the Shannon entropy and its complementary dual, the extropy. Based on a large size data set from a logconcave model, the said bounds are obtained for the entropy…
A quasi-unidimensional one-electron double quantum dot is studied within the framework of Shannon informational entropy. Its confinement potential, which is described by an asymmetric harmonic-gaussian function, consists of two wells…
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…