Related papers: Improvement of graph theory Wei`s inequality
We use different approaches to study a generalization of a result of Levin and Ste\v{c}kin concerning an inequality analogous to Hardy's inequality. Our results lead naturally to the study of weighted remainder form of Hardy-type…
We prove a generalized Gauss-Kuzmin-L\'evy theorem for the $p$-numerated generalized Gauss transformation $$T_p(x)=\{\frac{p}{x}\}.$$ In addition, we give an estimate for the constant that appears in the theorem.
This paper states and proves a generalization of the well-known Desargues involution theorem from plane projective geometry.
This note reports partial results related to the Gaussian product inequality (GPI) conjecture for the joint distribution of traces of Wishart matrices. In particular, several GPI-related results from Wei (2014) and Liu et al. (2015) are…
We prove inequalities on non-integer powers of products of generalized matrices functions on the sum of positive semi-definite matrices. For example, for any real number $r \in \{1\} \cup [2, \infty)$, positive semi-definite matrices $A_i,\…
A generalized skew information is defined and a generalized uncertainty relation is established with the help of a trace inequality which was recently proven by J.I.Fujii. In addition, we prove the trace inequality conjectured by S.Luo and…
Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are…
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
We prove some extensions of Andrews inequality.
We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear Algebra Appl. 516 (2017)]. Our method also allows us to prove…
The purpose of this paper is to provide a random version of Simons' inequality.
We generalize the concept of disjunction.
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
[Note to the reader: properties (C2) and (C2)* are under development, in order to form a generalization of (C3) and (C3)*]
Three generalizations of the well-known Ceva's Theorem are given in this paper and some applications.
The goal of this note is to generalize Isoperimetric Inequality for random groups to the class of non-planar diagrams of bounded number of faces.
The objective of this note is to provide an interpretation of the discrete version of Morse inequalities, following Witten's approach via supersymmetric quantum mechanics, adapted to finite graphs, as a particular instance of Morse-Witten…
We generalize McDiarmid's inequality for functions with bounded differences on a high probability set, using an extension argument. Those functions concentrate around their conditional expectations. We further extend the results to…
An introductory paper to the graph k-colorability problem.