A Note on John Simplex with Positive Dilation

12/07/2020
by   Zhou Lu, et al.
0

We prove a Johns theorem for simplices in R^d with positive dilation factor d+2, which improves the previously known d^2 upper bound. This bound is tight in view of the d lower bound. Furthermore, we give an example that d isn't the optimal lower bound when d=2. Our results answered both questions regarding Johns theorem for simplices with positive dilation raised by <cit.>.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/18/2017

A Note on Tight Lower Bound for MNL-Bandit Assortment Selection Models

In this note we prove a tight lower bound for the MNL-bandit assortment ...
research
02/06/2018

Near-Optimal Coresets of Kernel Density Estimates

We construct near-optimal coresets for kernel density estimate for point...
research
11/12/2021

An Axiomatic Approach to Formalized Responsibility Ascription

Quantified responsibility ascription in complex scenarios is of crucial ...
research
06/19/2020

Certified Randomness from Bell's Theorem and Remote State Preparation Dimension Witness

Randomness can be device-independently certified from a set of experimen...
research
01/27/2021

A Note on the Representation Power of GHHs

In this note we prove a sharp lower bound on the necessary number of nes...
research
05/12/2023

The Critical Theorem for q-Polymatroids

The Critical Theorem, due to Henry Crapo and Gian-Carlo Rota, has been e...
research
02/13/2020

Sensitivity of Wardrop Equilibria: Revisited

For single-commodity networks, the increase of the price of anarchy is b...

Please sign up or login with your details

Forgot password? Click here to reset