Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. On the Volume of the John-Lowner Ellipsoid
 
Loading...
Thumbnail Image
research article

On the Volume of the John-Lowner Ellipsoid

Ivanov, Grigory  
March 1, 2020
Discrete & Computational Geometry

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimensional subspace, which are respectively (n/k)(k/2) and (k/n)(k/2) of the volume of the unit ball in R-k. Also, we describe all possible vectors in R-n, whose coordinates are the squared lengths of a projection of the standard basis in R-n onto a k-dimensional subspace.

  • Details
  • Metrics
Type
research article
DOI
10.1007/s00454-019-00071-4
Web of Science ID

WOS:000511936600007

Author(s)
Ivanov, Grigory  
Date Issued

2020-03-01

Publisher

SPRINGER

Published in
Discrete & Computational Geometry
Volume

63

Issue

2

Start page

455

End page

459

Subjects

Computer Science, Theory & Methods

•

Mathematics

•

Computer Science

•

john ellipsoid

•

lowner ellipsoid

•

section of the hypercube

•

projection of the cross-polytope

•

unit decomposition

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DCG  
Available on Infoscience
March 3, 2020
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/166695
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés