Related papers: On log-sum inequalities
The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…
Information diagram and the I-measure are useful mnemonics where random variables are treated as sets, and entropy and mutual information are treated as a signed measure. Although the I-measure has been successful in machine proofs of…
In this paper, we introduce the notion of log-{\varphi}-convex functions and present some properties and representation of such functions. We obtain some results of the Hermite Hadamard inequalities for product log-{\varphi}-convex…
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…
As non-commutative versions of the quasi-arithmetic mean, we consider the Lim-P\'{a}lfia's power mean, R\'{e}nyi right mean and R\'{e}nyi power means. We prove that the Lim-P\'{a}lfia's power mean of order $t \in [-1,0)$ is weakly…
In this paper, we obtain some new integral inequalities like Hermite-Hadamard type for third derivatives absolute value are log-convex. We give some applications to quadrature formula for midpoint error estimate.
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
In this paper, we first present simple proofs of Choi's results [4], then we give a short alternative proof for Fiedler and Markham's inequality [6]. We also obtain additional matrix inequalities related to partial determinants.
In this report, we aim to exemplify concentration inequalities and provide easy to understand proofs for it. Our focus is on the inequalities which are helpful in the design and analysis of machine learning algorithms.
The theory of majorization has seen substantial application in quantum information. Its framework predicates on the comparability between real vectors. We explore the antithesis of this premise, namely, incomparability. Specifically, we…
Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…
We prove a new inequality which improves on the classical Hardy inequality in the sense that a nonlinear integral quantity with super-quadratic growth, which is computed with respect to an inverse square weight, is controlled by the energy.…
This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…
LLM-based formal proof assistants (e.g., in Lean) hold great promise for automating mathematical discovery. But beyond syntactic correctness, do these systems truly understand mathematical structure as humans do? We investigate this…
We prove that every GNS-symmetric quantum Markov semigroup on a finite dimensional matrix algebra satisfies a modified log-Sobolev inequality. In the discrete time setting, we prove that every finite dimensional GNS-symmetric quantum…
We compare weighted sums of i.i.d. positive random variables according to the usual stochastic order. The main inequalities are derived using majorization techniques under certain log-concavity assumptions. Specifically, let $Y_i$ be i.i.d.…
We discuss interplays between log-concave functions and log-concave sequences. We prove a Bernstein-type theorem, which characterizes the Laplace transform of log-concave measures on the half-line in terms of log-concavity of the…
To combine and query ordered data from multiple sources, one needs to handle uncertainty about the possible orderings. Examples of such "order-incomplete" data include integrated event sequences such as log entries, lists of properties…
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive…
Purely multiplicative comparisons of quantum relative entropy are desirable but challenging to prove. We show such comparisons for relative entropies between comparable densities, including the relative entropy of a density with respect to…