Related papers: Maximum Entropy and Sufficiency
Gravitational properties of a hedge-hog type topological defect in two extra dimensions are considered in General Relativity employing a vector as the order parameter. The developed macroscopic theory of phase transitions with spontaneous…
We establish the spectral gap property for dense subgroups of $SU(d)$ ($d\geq 2$), generated by finitely many elements with algebraic entries; this result was announced in [BG3]. The method of proof differs, in several crucial aspects, from…
We show how our Universe can emerge from a symmetry breaking of a multicomponent $W_3$ algebra, where the components in addition form a Jordan algebra. We discuss how symmetry breaking related to the Jordan algebras $H_3(C)$ and $H_3(O)$…
We introduce joint exclusivity (JE), a form of extremal negative dependence that extends the classical notion of mutual exclusivity. The JE structure is analytically tractable and is defined by the exclusion of the interior of the…
We show that $n$ is almost perfect if and only if $I(n) - 1 < D(n) \leq I(n)$, where $I(n)$ is the abundancy index of $n$ and $D(n)$ is the deficiency of $n$. This criterion is then extended to the case of integers $m$ satisfying $D(m)>1$.
Maximum entropy distributions with discrete support in $m$ dimensions arise in machine learning, statistics, information theory, and theoretical computer science. While structural and computational properties of max-entropy distributions…
We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…
We prove a version of the completeness hypothesis that follows from the coexistence of symmetry and gravity: tree-level gravitational scattering mandates single-particle states in all possible irreducible representations of the symmetry…
Based on Bergman's Lemma on centralizers, we obtain a sharp lower degree bound for nonconstant elements in a subalgebra generated by two elements of a free associative algebra over an arbitrary field.
Energy-minimizing constraint maps are a natural extension of the obstacle problem within a vectorial framework. Due to inherent topological constraints, these maps manifest a diverse structure that includes singularities similar to harmonic…
In a quantum system, there may be many density matrices associated with a state on an algebra of observables. For each density matrix, one can compute its entropy. These are in general different. Therefore one reaches the remarkable…
In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…
Main result: If a C*-algebra is simple, $\sigma$-unital, has finitely many extremal traces, and has strict comparison of positive elements by traces, then its multiplier also has strict comparison of positive elements by traces. The same…
In this paper, we mainly study a class of biderivations and triple homomorphisms on perfect Jordan algebras. Let $J$ be a Jordan algebra and $\delta :J \times J \rightarrow J$ a symmetric biderivation satisfying $\delta(w , u \circ v) = w…
We derive a sequence of measures whose corresponding Jacobi matrices have special properties and a general mapping of an open quantum system onto 1D semi infinite chains with only nearest neighbour interactions. Then we proceed to use the…
Given finite configurations $P_1, \dots, P_n \subset \mathbb{R}^d$, let us denote by $\mathbf{m}_{\mathbb{R}^d}(P_1, \dots, P_n)$ the maximum density a set $A \subseteq \mathbb{R}^d$ can have without containing congruent copies of any…
Based on Jaynes' maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered…
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consistency properties from properties on set intersection. This…
We consider the relationship between derivations $d$ and $g$ of a Banach algebra $B$ that satisfy $\s(g(x)) \subseteq \s(d(x))$ for every $x\in B$, where $\s(\, . \,)$ stands for the spectrum. It turns out that in some basic situations, say…
Maximum Entropy is a powerful concept that entails a sharp separation between relevant and irrelevant variables. It is typically invoked in inference, once an assumption is made on what the relevant variables are, in order to estimate a…