Related papers: Poset Entropy versus Number of Linear Extensions: …
We numerically show that the Lattice Lotka-Volterra model, when realized on a square lattice support, gives rise to a {\it finite} production, per unit time, of the nonextensive entropy $S_q= \frac{1- \sum_ip_i^q}{q-1}$ $(S_1=-\sum_i p_i…
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…
We study the permutation complexity of finite-state stationary stochastic processes based on a duality between values and orderings between values. First, we establish a duality between the set of all words of a fixed length and the set of…
We consider partially hyperbolic diffeomorphisms on compact manifolds where the unstable and stable foliations stably carry some unique non-trivial homologies. We prove the following two results: if the center foliation is one dimensional,…
In this work, we study the problem of finding the asymptotic growth rate of the number of of $d$-dimensional arrays with side length $n$ over a given alphabet which avoid a list of one-dimensional "forbidden" words along all cardinal…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be…
The minimum number of elements needed for a poset to have exactly n linear extensions is at most 2sqrt{n}. In a special case, the bound can be improved to sqrt{n}.
The relative entropy of two n-party quantum states is an important quantity exhibiting, for example, the extent to which the two states are different. The relative entropy of the states formed by reducing two n-party to a smaller number $m$…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…
Entropy serves as a central observable which indicates uncertainty in many chemical, thermodynamical, biological and ecological systems, and the principle of the maximum entropy (MaxEnt) is widely supported in natural science. Recently,…
We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the…
One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…
The linear stability with variable coefficients of the vortex sheets for the two-dimensional compressible elastic flows is studied. As in our earlier work on the linear stability with constant coefficients, the problem has a free boundary…
We consider some classes of piecewise expanding maps in finite dimensional spaces having invariant probability measures which are absolutely continuous with respect to Lebesgue measure. We derive an entropy formula for such measures and,…
In this paper, we investigate two-parameter entropies and obtain some conditions for their extensivity. By using a generalized $(k,r)-product$, correlations for subsystems are related to the joint probabilities, so that the entropy remains…
A toy model of particles packings is presented, which consists in arranging hexagons on a triangular lattice according to local stability rules. The number of stable packings is analytically computed and found to grow exponentially with the…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…
The cross--product conjecture (CPC) of Brightwell, Felsner and Trotter (1995) is a two-parameter quadratic inequality for the number of linear extensions of a poset $P= (X, \prec)$ with given value differences on three distinct elements in…