Related papers: Partition-Symmetrical Entropy Functions
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
Entropy and other fundamental quantities of information theory are customarily expressed and manipulated as functions of probabilities. Here we study the entropy H and subentropy Q as functions of the elementary symmetric polynomials in the…
We present a unifying approach to the study of entropies in Mathematics, such as measure entropy, topological entropy, algebraic entropy, set-theoretic entropy. We take into account discrete dynamical systems, that is, pairs $(X,T)$, where…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
We give an alternative method to that of Hardy-Ramanujan-Rademacher to derive the leading exponential term in the asymptotic approximation to the partition function p(n,a), defined as the number of decompositions of a positive integer 'n'…
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…
Quantum entropy function is a proposal for computing the entropy associated with the horizon of a black hole in the extremal limit, and is related via AdS/CFT correspondence to the dimension of the Hilbert space in a dual quantum mechanics.…
The closure of the set of entropy functions associated with n discrete variables, Gammar*n, is a convex cone in (2n-1)- dimensional space, but its full characterization remains an open problem. In this paper, we map Gammar*n to an…
A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…
By classical results of Herglotz and F. Riesz, any bounded analytic function in the complex unit disk has a unique inner-outer factorization. Here, a bounded analytic function is called \emph{inner} or \emph{outer} if multiplication by this…
Numerous entropy-type characteristics (functionals) generalizing R\'enyi entropy are widely used in mathematical statistics, physics, information theory, and signal processing for characterizing uncertainty in probability distributions and…
Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…
We prove that there is no algorithm to decide whether a given integer vector is in the closure of the entropic cone $\overline{\Gamma_{n}^{*}}$. Equivalently, there is no decision procedure to determine whether a given integer-valued…
Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…
For $1/2<p<1$, a description of inner functions whose derivative is in the Hardy space $H^p$ is given in terms of either their mapping properties or the geometric distribution of their zeros.
Along recent decades, an intensive worldwide research activity is focusing both black holes and cosmos (e.g. the dark-energy phenomenon) on the basis of entropic approaches. The Boltzmann-Gibbs-based Bekenstein-Hawking entropy…
We use complex contour integral techniques to study the entropy H and subentropy Q as functions of the elementary symmetric polynomials, revealing a series of striking properties. In particular for these variables, derivatives of -Q are…
We propose the use of the functional determinant of geometric operators in constructing an entropy functional associated to geometric flows. Our approach is based on the direct computation of the partition function, with a well-defined set…
We provide, under minimal continuity assumptions, a description of \textsl{additive partition entropies}. They are real functions $I$ on the set of finite partitions that are additive on stochastically independent partitions in a given…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…