相关论文: The core entropy for polynomials of higher degree
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…
Rooted trees with probabilities are used to analyze properties of a variable length code. A bound is derived on the difference between the entropy rates of the code and a memoryless source. The bound is in terms of normalized informational…
We analyze modular invariance drawing inspiration from tauberian theorems. Given a modular invariant partition function with a positive spectral density, we derive lower and upper bounds on the number of operators within a given energy…
Information theory on a time-discrete setting in the framework of time series analysis is generalized to the time-continuous case. Considerations of the Roessler and Lorenz dynamics as well as the Ornstein-Uhlenbeck process yield for…
We introduce a 'quasi-topological` term [1] in D=1+1 dimensions and the entropy for black holes is calculated [2]. The source of entropy in this case is justified by a non-null stress-energy tensor.
Although neural networks can solve very complex machine-learning problems, the theoretical reason for their generalizability is still not fully understood. Here we use Wang-Landau Mote Carlo algorithm to calculate the entropy (logarithm of…
We study the entanglement entropy of random partitions in one- and two-dimensional critical fermionic systems. In an infinite system we consider a finite, connected (hypercubic) domain of linear extent $L$, the points of which with…
The combinatorial basis of entropy by Boltzmann can be written $H= {N}^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy of a system, per unit entity, $N$ is the number of entities and $\mathbb{W}$ is the number of ways in which…
A common approach to evaluate entropy in quantum systems is to solve a master-Bloch equation to determine density matrix and substitute it in entropy definition. However, this method has been recently understood to lack many energy…
The structure of isentropes (i.e. level sets of constant topological entropy) including the monotonicity of entropy, has been studied for polynomial interval maps since the 1980s. We show that isentropes of multimodal polynomial families…
We define the topological entropy per unit volume in parabolic PDE's such as the complex Ginzburg-Landau equation, and show that it exists, and is bounded by the upper Hausdorff dimension times the maximal expansion rate. We then give a…
The entropy of a Schwarzschild black hole, as computed via the semiclassical Euclidean path integral in a stationary phase approximation, is determined not by the on-shell value of the action (which vanishes), but by the…
We use Bowen's definition of topological entropy and Ahlfors five islands theorem, as well as the theory of polynomial-like mappings, to show that the topological entropy of any entire transcendental function is infinity. In addition the…
Sparsity and entropy are pillar notions of modern theories in signal processing and information theory. However, there is no clear consensus among scientists on the characterization of these notions. Previous efforts have contributed to…
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…
The (measure-theoretical) entropy of a diffeomorphism along an expanding invariant foliation is the rate of complexity generated by the diffeomorphism along the leaves of the foliation. We prove that this number varies upper…
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 note a new method for computing the entanglement entropy of a CFT holographically is explored. It consists of finding a bulk background with a boundary metric that has the conical singularities needed to compute the entanglement…
We propose an operational definition of the entropy of cosmological perturbations based on a truncation of the hierarchy of Green functions. The value of the entropy is unambiguous despite gauge invariance and the renormalization procedure.…
We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…