3 papers
math.CO2024
Clique covers and decompositions of cliques of graphs
József Balogh, Jialin He, Robert A. Krueger +2
In 1966, Erdős, Goodman, and Pósa showed that if is an -vertex graph, then at most cliques of are needed to cover the edges of , and the bound…
math.NT2024
On the order of 4-dimensional regular polytope numbers
Anji Dong, The Nguyen, Alexandru Zaharescu
In light of Kim's conjecture on regular polytopes of dimension four, which is a generalization of Waring's problem, we establish asymptotic formulas for representing any sufficient…
math.FA2021
Matrix power means and new characterizations of operator monotone functions
Trung Hoa Dinh, Cong Trinh Le, The Van Nguyen +1
For positive definite matrices and , the Kubo-Ando matrix power mean is defined as $$ P_μ(p, A, B) = A^{1/2}\left(\frac{1+(A^{-1/2}BA^{-1/2})^p}{2}\right )^{1/p} A^{1/2}\qua…