AI Chat AI Image Generator AI Video Text to Speech

A refined determinantal inequality for correlation matrices

09/12/2019

∙

by Niushan Gao, et al.

∙

∙

Olkin [3] obtained a neat upper bound for the determinant of a correlation matrix. In this note, we present an extension and improvement of his result.

Niushan Gao
1 publication
Alexandra Kirillova
1 publication
Zihao Tong
1 publication

page 1

page 2

page 3

research

∙ 06/21/2023

A formalization of the CHSH inequality and Tsirelson's upper-bound in Isabelle/HOL

We present a formalization of several fundamental notions and results fr...

0 Mnacho Echenim, et al. ∙

research

∙ 08/11/2023

Characterizing Correlation Matrices that Admit a Clustered Factor Representation

The Clustered Factor (CF) model induces a block structure on the correla...

0 Chen Tong, et al. ∙

research

∙ 07/07/2022

Approximate Solutions of Linear Systems at a Universal Rate

Let A ∈ℝ^n × n be invertible, x ∈ℝ^n unknown and b =Ax given. We are int...

0 Stefan Steinerberger, et al. ∙

research

∙ 05/25/2021

On the extension complexity of polytopes separating subsets of the Boolean cube

We show that 1. for every A⊆{0, 1}^n, there exists a polytope P⊆ℝ^n wi...

0 Pavel Hrubes, et al. ∙

research

∙ 12/04/2022

Notes on the complexity of coverings for Kronecker powers of symmetric matrices

In the present note, we study a new method of constructing efficient cov...

0 Igor S. Sergeev, et al. ∙

research

∙ 12/04/2020

A New Parametrization of Correlation Matrices

We introduce a novel parametrization of the correlation matrix. The repa...

0 Ilya Archakov, et al. ∙

research

∙ 01/12/2020

An improvement of the upper bound for GKS communication game

The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael...

0 Ivan Petrenko, et al. ∙