相关论文: The core entropy for polynomials of higher degree
Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…
Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…
Building on work of Kontsevich, we introduce a definition of the entropy of a finite probability distribution in which the "probabilities" are integers modulo a prime p. The entropy, too, is an integer mod p. Entropy mod p is shown to be…
The monotonicity of entropy is investigated for real quadratic rational maps on the real circle $\mathbb{R}\cup\{\infty\}$ based on the natural partition of the corresponding moduli space $\mathcal{M}_2(\mathbb{R})$ into its monotonic,…
The aim of this work is to study a kind of refinement of the entropy conjecture, in the context of partially hyperbolic diffeomorphisms with one dimensional central direction, of d-dimensional torus. We start by establishing a connection…
A notion of entropy is introduced for causal fermion systems. This entropy is a measure of the state of disorder of a causal fermion system at a given time compared to the vacuum. The definition is given both in the finite and…
We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…
We study continuity of the roots of nonmonic polynomials as a function of their coefficients using only the most elementary results from an introductory course in real analysis and the theory of single variable polynomials. Our approach…
Typically, the entropy of an isolated system in equilibrium is calculated by counting the number of accessible microstates, or in more general cases by using the Gibbs formula. In irreversible processes entropy spontaneously increases and…
We examine the {combinatorial} or {probabilistic} definition ("Boltzmann's principle") of the entropy or cross-entropy function $H \propto \ln \mathbb{W}$ or $D \propto - \ln \mathbb{P}$, where $\mathbb{W}$ is the statistical weight and…
We study the ergodic theory of a one-parameter family of interval maps T_alpha arising from generalized continued fraction algorithms. First of all, we prove the dependence of the metric entropy of T_alpha to be Hoelder-continuous in the…
Microscopic formula to describe the entropy of biomolecular solutions are derived based on the Gibbs formula of entropy, and the generalized Langevin theory combined with the RISM/3D-RISM theory. Two formula are derived: one is concerned…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
It is an open question whether the fractional parts of nonlinear polynomials at integers have the same fine-scale statistics as a Poisson point process. Most results towards an affirmative answer have so far been restricted to almost sure…
We study a class of polynomials that has all of its roots on the critical line and shares many properties with Ehrhart polynomials. Braun showed that the roots of Ehrhart polynomials are bounded quadratically and Higashitani provided…
The entropy of an orthogonal matrix is defined. It provides a new interpretation of Hadamard matrices as those that saturate the bound for entropy.It appears to be a useful Morse function on the group manifold. It has sharp maxima and other…
We prove that the Ehrhart polynomial of a zonotope is a specialization of the multiplicity Tutte polynomial. We derive some formulae for the volume and the number of integer points of the zonotope.
We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…
We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…