Related papers: Matroidal Entropy Functions: Constructions, Charac…
Parke-Taylor functions are certain rational functions on the Grassmannian of lines encoding MHV amplitudes in particle physics. For $n$ particles there are $n!$ Parke-Taylor functions, corresponding to all orderings of the particles. Linear…
The envelope function method traditionally employs a single basis set which, in practice, relates to a single material because the $k\cdot p$ matrix elements are generally only known in a particular basis. In this work, we defined a basis…
The paper presents variational formulae for entropy-like functionals, including Segal and R\'enyi entropies, for normal states on semifinite von Neumann algebras. The considered functionals are of the form $\tau(f(h))$ where $\tau$ is a…
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,…
In a paper [8] the authors classify entropy into three categories, as a thermodynamics quantity, as a measure of information production, and as a means of statistical inference. An entropy measure introduced by Mathai falls into the second…
A definable set $X$ in the first-order language of rings defines a family of random vectors: for each finite field $\mathbb{F}_q$, let the distribution be supported and uniform on the $\mathbb{F}_q$-rational points of $X$. We employ results…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
We study the relationship between a q-analogue of matroids and linear codes with the rank metric in the vector space of matrices with entries in a finite field. We prove a Greene type identity for the rank generating function of these…
The classical Maximum Entropy (ME) problem consists of determining a probability distribution function (pdf) from a finite set of expectations of known functions. The solution depends on $N+1$ Lagrange multipliers which are determined by…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
It has recently been claimed that a Cardy-like limit of the superconformal index of 4d $\mathcal{N}=4$ SYM accounts for the entropy function, whose Legendre transform corresponds to the entropy of the holographic dual AdS$_5$ rotating black…
In stochastic thermodynamics standard concepts from macroscopic thermodynamics, such as heat, work, and entropy production, are generalized to small fluctuating systems by defining them on a trajectory-wise level. In Langevin systems with…
Entropy or information is a fundamental quantity contained in a system in statistical mechanics and information theory. In this paper, a definition of classical information entropy of parton distribution functions is suggested. The…
We discuss several extension properties of matroids and polymatroids and their application as necessary conditions for the existence of different matroid representations, namely linear, folded linear, algebraic, and entropic…
This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…
We abstract the essential aspects of network-error detecting and correcting codes to arrive at the definitions of matroidal error detecting networks and matroidal error correcting networks. An acyclic network (with arbitrary sink demands)…
Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…
The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter epsilon. We map the problem onto a one-dimensional Ising model in a large field of random signs and calculate the expansion…
Wald's formula for black hole entropy, applied to extremal black holes, leads to the entropy function formalism. We manipulate the entropy computed this way to express it as the logarithm of the ground state degeneracy of a dual quantum…
Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…