Prymak Slides

Convex bodies of constant width with exponential
illumination number
Andriy Prymak
(joint work with Andrii Arman and Andrii Bondarenko)
University of Manitoba
1
Borsuk’s number
Borsuk’s number b(n) is the smallest integer such that any set of diameter 1
in En can be covered by b(n) sets of smaller diameter.
2
Borsuk’s number
b(n) ≥ n + 1 by considering regular simplex in En .
2
Borsuk’s number
Borsuk (1933) asked if b(n) = n + 1 for all n?
2
Borsuk’s number

Borsuk (1933): b(1) = 2 and b(2) = 3,
Perkal (1947): b(3) = 4.
2
Borsuk’s number

Borsuk (1933): b(1) = 2 and b(2) = 3,
Perkal (1947): b(3) = 4.
√
Asymptotic lower bound: b(n) ≥ c n for large n established by
Kahn and Kalai (1993): c ≈ 1.203,
Raigorodskii (1999): c ≈ 1.2255.
2
Borsuk’s number

Borsuk (1933): b(1) = 2 and b(2) = 3,
Perkal (1947): b(3) = 4.
√
Asymptotic lower bound: b(n) ≥ c n for large n established by
Kahn and Kalai (1993): c ≈ 1.203,
Raigorodskii (1999): c ≈ 1.2255.
The smallest known n with b(n) > n + 1 is n = 64.

Bondarenko (2014): b(65) > 83, Jenrich (2014): b(64) > 70.
2
Asymptotic upper bound on b(n)
Schramm (1988), Bourgain and Lindenstrauss (1989):

r !n
3
b(n) ≤ + o(1)
2
3
Asymptotic upper bound on b(n)
Schramm (1988), Bourgain and Lindenstrauss (1989):

r !n
3
b(n) ≤ + o(1)
2
3
Bourgain and Lindenstrauss’s results
Let g(n) be the smallest number of balls of diameter < 1 needed to cover
an arbitrary set of diameter 1 in En . Clearly, b(n) ≤ g(n).
4
√
Rogers (1965): g(n) ≤ ( 2 + o(1))n
Danzer (1965): g(n) ≥ 1.003n
4
√
Rogers (1965): g(n) ≤ ( 2 + o(1))n
Danzer (1965): g(n) ≥ 1.003n
r !n
3
Bourgain and Lindenstrauss (1989): 1.0645n ≤ g(n) ≤ + o(1) .
2
4
Illumination and covering
Let K be a convex body in En . A point x ∈ ∂K is illuminated by a direction
ξ ∈ Sn−1 if the ray {x + ξt : t ≥ 0} intersects int(K ).
5
The illumination number I(K ) is the minimal number of directions such that
every x ∈ ∂K is illuminated by one of these directions.
6
Denote h(K ) to be the smallest number N such that K can be covered by

N smaller homothetic copies of K .
Boltyanski (1960): I(K ) = h(K ) for any convex body K .
6

6

Levi-Hadwiger-Gohberg-Markus’s conjecture: I(K )= h(K ) ≤ 2n

with equality iff K is an affine copy of a cube.
7
Convex bodies of constant width
A convex body in En has constant width, if its projection onto any line has
the same length.
8
the same length. It is well-known that any set of diameter 1 is contained in
a convex body of constant width 1.
8
8
9
Therefore, it suffices to consider only bodies of constant width when com-

puting the Borsuk’s number b(n).
9
Schramm’s upper bound on Borsuk’s number
Define
h(n) := sup{h(K )= I(K ) : K is a convex body of constant width in En }.
We have b(n) ≤ h(n).
10
Define

r !n
3
Schramm (1988): h(n) ≤ + o(1)
2
10
Define

r !n
3
Schramm (1988): h(n) ≤ + o(1)
2
The only known lower√bound on h(n) was the same as for b(n):
h(n) ≥ b(n) ≥ 1.2255 n for large n.
10
Define

r !n
3
Schramm (1988): h(n) ≤ + o(1)
2
The only known lower√bound on h(n) was the same as for b(n):
h(n) ≥ b(n) ≥ 1.2255 n for large n.
Kalai (2015) asked: does there exist C > 1 with h(n) ≥ C n for large n?
10
Main result
We answer the question of Kalai in the affirmative.

Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)
11
Main geometric ingredient
For fixed x ∈ Sn−1 and 0 < α ≤ π/6 define

Q(x , α) := {x } ∪ {y ∈ Sn−1 : kx − y k = 2 cos α}.
12

For non-zero x , y ∈ En , let
·y
θ(x , y ) := arccos( kxxkky k ).
For x ∈ S n−1 and 0 < α < π, set
C (x , α) := {y ∈ Sn−1 : θ(x , y ) ≤ α}.
13

For non-zero x , y ∈ En , let
·y
θ(x , y ) := arccos( kxxkky k ).
For x ∈ S n−1 and 0 < α < π, set
C (x , α) := {y ∈ Sn−1 : θ(x , y ) ≤ α}.
Lemma 1
Suppose 0 < α ≤ π/6, K is a convex body in En s.t. diam K = 2 cos α
and for some x ∈ Sn−1 we have Q(x , α) ⊂ K . Then x ∈ ∂K and any
direction ξ ∈ Sd−1 illuminating x satisfies ξ ∈ C (−x , π2 − α).
13
Lemma 1
14
Lemma 1
15
Lemma 1
16
Lemma 1
17
Separation required to control the diameter
For a finite X ⊂ Sn−1 , let W(X ) :=

S
x ∈X Q(x , α).
18
Separation required to control the diameter
For a finite X ⊂ Sn−1 , let W(X ) :=

S
x ∈X Q(x , α).
Lemma 2
Suppose 0 < α ≤ π/6 and X ⊂ Sn−1 .
(i) If θ(x , y ) ≤ π − 2α for all x , y ∈ X , then diam X ≤ 2 cos α.
(ii) If 4α ≤ θ(x , y ) ≤ π − 6α for all distinct x , y ∈ X ,
then diam W(X ) ≤ 2 cos α.
18
Thin spherical codes
Lemma 3
Suppose 0 < ϕ < π2 . Then for any sufficiently large n there exists a
√
c n
collection X = {x1 , . . . , xN } ⊂ Sn−1 with N ≥ (sin ϕ)n such that
(a) ϕ ≤ θ(xi , xj ) ≤ π − ϕ for all i 6= j;
(b) |{i : x ∈ C (xi , ϕ)}| ≤ Cn log n for all x ∈ Sn−1 .
19
Lemma 3
√
c n
If µ denotes the spherical probability measure on Sn−1 , then up to a constant

(sin ϕ)n
factor µ(C (xi , ϕ)) behaves like √n for large n.
19
Lemma 3
√
c n
Proof outline: Sample an appropriately selected number of uniformly i.i.d.

points from Sn−1 . By Böröczky and Wintsche (2003), which is the adapta-
tion of the ideas of Erdős and Rogers (1961/62) to Sn−1 , the resulting set
Y satisfies (b) with high probability.
20
Lemma 3
√
c n
Proof outline: Sample an appropriately selected number of uniformly i.i.d.

points from Sn−1 . By Böröczky and Wintsche (2003), which is the adapta-
tion of the ideas of Erdős and Rogers (1961/62) to Sn−1 , the resulting set
Y satisfies (b) with high probability.
Certain probabilistic arguments show that some points that may violate (a)
can be removed from Y to obtain the desired X ⊂ Y .
20
Proof of the main result
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)
6π
Proof: Use Lemma 3 with ϕ = 14 to get a thinly spread X ⊂ Sn−1 .
21
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)
Proof: Use Lemma 3Swith ϕ = 6π

14 to get a thinly spread X ⊂ S
n−1 .
π
Construct W(X ) = x ∈X Q(x , α) with α = 14 .
21
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)
Proof: Use Lemma 3Swith ϕ = 6π 14 to get a thinly spread X ⊂ S

n−1 .
π
By Lemma 2 (ii) (separation lemma), diam (W(X )) = 2 cos α.
21
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)

n−1 .
π
So there exists a body K ⊃ W(X ) of constant width 2 cos α.
21
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)

n−1 .
π
Since ϕ = π2 − α, Lemma 3 (b) for −X in combination with Lemma 1
√ 0
n
c n √ c 1
(illumination cap) imply I(K ) ≥ (sin ϕ)n /(Cn log n) = n log n cos(π/14)
.
21
Theorem 1
n
c 1
h(n) ≥ √
n log n cos(π/14)

n−1 .
π
Since ϕ = π2 − α, Lemma 3 (b) for −X in combination with Lemma 1
√ 0
n
c n √ c 1
(illumination cap) imply I(K ) ≥ (sin ϕ)n /(Cn log n) = n log n cos(π/14)
.
1
Glazyrin (≥2023) noted that the base of the exponent cos(π/14) ≈ 1.026
q √
can be improved to 14 16 (111 − 33) ≈ 1.047 by a slight modification of
the construction: choosing the bases of the cones from a concentric sphere
of smaller radius.
21
New lower bound on g(n)
Recall that g(n) is the smallest number of balls of diameter < 1 needed to
cover an arbitrary set of diameter 1 in En .
Bourgain and Lindenstrauss (1989): g(n) ≥ 1.0645n
Theorem 2
n
c 2
g(n) ≥ √ √ (note that √2 ≈ 1.1547)
n log n 3 3
22
Theorem 2
n
c 2
g(n) ≥ √ √ (note that √2 ≈ 1.1547)
n log n 3 3
π
Proof: Use Lemma 3 with ϕ = 3 to get a thinly spread X ⊂ Sn−1 .
22
Theorem 2
n
c 2
g(n) ≥ √ √ (note that √2 ≈ 1.1547)
n log n 3 3
Proof: Use Lemma 3 with ϕ = π3 to get a thinly spread X ⊂ Sn−1 .

√
By Lemma 2 (i) (separation lemma) with α = π6 , diam X ≤ 2 cos π6 = 3.
22
Theorem 2
n
c 2
g(n) ≥ √ √ (note that √2 ≈ 1.1547)
n log n 3 3
Proof: Use Lemma 3 with ϕ = π3 to get a thinly spread X ⊂ Sn−1 .

√
By Lemma 2 (i) (separation lemma) with α = π6 , diam X ≤ 2 cos π6 = 3.
√
Any ball of diameter 3 intersects√Sn−1 by a cap of radius ≤ ϕ, n so by
c n c 0 2
Lemma 3 (b) we need at least (sin ϕ)n /(Cn log n) = √n log n √3 such
caps to cover X .
22
Denote µ(ϕ) := µ(C (x , ϕ)), x ∈ Sn−1 .
Theorem 3
There is n0 such that for any n ≥ n0 , ψ ∈ (0, π2 ) and ϕ ∈ ( n1 , π2 ) there
exists a collection X = {x1 , . . . , xN } ⊂ Sn−1 with N ≥ min{ 4nµ(ϕ)
log n 1
, 8µ(ψ) }
such that
(a) ψ ≤ θ(xi , xj ) ≤ π − ψ for all i 6= j;
(b) |{i : x ∈ C (xi , ϕ)}| ≤ 400n log n for all x ∈ Sn−1 .
23
Denote µ(ϕ) := µ(C (x , ϕ)), x ∈ Sn−1 .
Theorem 3
exists a collection X = {x1 , . . . , xN } ⊂ Sn−1 with N ≥ min{ 4nµ(ϕ)
log n 1
, 8µ(ψ) }
such that
Lemma 3 is obtained when ψ = ϕ.
23
Theorem 3
exists X = {x1 , . . . , xN } ⊂ Sn−1 with N ≥ min{ 4nµ(ϕ)
log n 1
, 8µ(ψ) } such that
8n log n
Proof outline: Let Y be a set of M = d µ((1− 1 e uniformly i.i.d. points
2n )ϕ)
n−1
from S . By Böröczky and Wintsche (2003), Y satisfies (b) w.h.p.
24
Theorem 3
log n 1
8n log n
2n )ϕ)
n−1
• For U ⊂ Y , let B(U) := {{u, v } : θ(u, v ) 6∈ [ψ, π − ψ], u, v ∈ U, u 6= v }.
A pair of points from Y is in B(Y ) with probability p = 2µ(ψ).
24
Theorem 3
log n 1
8n log n
2n )ϕ)
n−1
2
Thus E(|B(Y )|) ≤ p M2 and ∃ Y satisfying (b) with |B(Y )| < pM 2 .
24
Theorem 3
log n 1
8n log n
2n )ϕ)
n−1
2
• If pM ≤ 12 , then |B(Y )| < M2 , and a point from each pair in B(Y ) can
4n log n
be removed to obtain the desired X ⊂ Y with N ≥ M 2 ≥ µ(ϕ) .
24
Theorem 3
log n 1
8n log n
2n )ϕ)
n−1
2
4n log n
• If pM > 12 , draw T ⊂ Y selecting each point with probability 1
2pM .
24
Theorem 3
log n 1
8n log n
2n )ϕ)
n−1
2
4n log n
• If pM > 12 , draw T ⊂ Y selecting each point with probability 1
2pM .
1 1 2 1 1
Then E(|T | − |B(T )|) ≥ 2p − pM 2 ( 2pM ) = 4p = 8µ(ψ) .
24
Illumination of convex bodies close to ball
n be the family of all convex bodies K in En such that
For D > 1 let KD
Bn ⊂ K ⊂ DBn .
25
For D > 1 let KD
Bn ⊂ K ⊂ DBn .
Naszódi (2016): for any fixed 1 < D < 1.116 and sufficiently large n
1 n
D ≤ sup I(K )
20 n
K ∈KD
25
For D > 1 let KD
Bn ⊂ K ⊂ DBn .
1 n
D ≤ sup I(K ) ≤ (cn3/2 log n)D n ,
20 n
K ∈KD
where the upper bound is valid for any D > 1.
25
For D > 1 let KD
Bn ⊂ K ⊂ DBn .
1 n
20 n
K ∈KD
Construction: convex hull of a discrete subset of DSn−1 and Bn .
25
Spiky ball
26
Illumination of convex bodies close to the ball
For D > 1 let KD
Bn ⊂ K ⊂ DBn .
1 n
20 n
K ∈KD
Construction: convex hull of a discrete subset of DSn−1 and Bn .
Theorem 4
For any fixed 1 < D < √2 (≈ 1.1547) and sufficiently large n
3
√
c nD n ≤ sup I(K ).
n
K ∈KD
27
Illumination of bodies of constant width close to the ball
For D > 1 let WDn be the family of all convex bodies of constant width
K ⊂ En such that
Bn ⊂ K ⊂ DBn .
28
K ⊂ En such that
Bn ⊂ K ⊂ DBn .
Theorem 5
1
For any fixed 1 < D < 2 cos(π/14)−1 (≈ 1.0528) and sufficiently large n
n
√

2D
c n ≤ sup I(K )
D+1 K ∈WDn
28
K ⊂ En such that
Bn ⊂ K ⊂ DBn .
Theorem 5
1
n n
√

2D 3/2 2D
c n ≤ sup I(K ) ≤ (Cn log n) ,
D+1 K ∈WDn D+1
28
K ⊂ En such that
Bn ⊂ K ⊂ DBn .
Theorem 5
1
n n
√

2D 3/2 2D
c n ≤ sup I(K ) ≤ (Cn log n) ,
D+1 K ∈WDn D+1
If the inradius of K is 1 and the circumradius is D, then the width is D + 1.

Therefore, after rescaling, such a body would have constant width 1 and
2D
the diameter of the circumscribed sphere would be D+1 .
28
Covering by balls of smaller diameter
For K ⊂ WDn of width w let g(K ) denote the smallest number of balls of
diameter less than w needed to cover K .
29
Theorem 6
3−1
n
√

2D
c n ≤ sup g(K )
D+1 K ∈WDn
29
Theorem 6
3−1
n n
√

2D 3/2 2D
c n ≤ sup g(K ) ≤ (Cn log n) ,
D+1 K ∈WDn D+1
29
Concluding remarks
Upper bounds in the last two theorems are achieved in a “universal” way:
illumination directions and covering balls do not depend on K , only on D.
30
Concluding remarks
Our constructions of bodies of constant width also provide the same ex-
ponential lower bounds for “mix and match” covering by balls of smaller
diameter and smaller homothets.
30
Concluding remarks
Question
p
Can b(n) ≤ ( 3/2 + o(1))n be improved using “mix and match” covering
by balls of smaller diameters and smaller homothets?
30
Concluding remarks
Question
p
I(K ) and g(K ) have the same order for K ∈ WDn when D is close to 1.
30
Concluding remarks
Question
p
I(K ) and g(K ) have the same order for K ∈ WDn when D is close to 1.
Question
Is it true that I(K ) = g(K ) for any K of constant width? If not, are I(K )
and g(K ) for constant width K ⊂ En equivalent up to a factor polynomial
in n?
30

Prymak Slides

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Prymak Slides

Uploaded by

Copyright:

Available Formats

Convex bodies of constant width with exponential

b(n) ≥ n + 1 by considering regular simplex in En .

b(n) ≥ n + 1 by considering regular simplex in En .

Borsuk (1933) asked if b(n) = n + 1 for all n?

b(n) ≥ n + 1 by considering regular simplex in En .

Borsuk (1933) asked if b(n) = n + 1 for all n?

b(n) ≥ n + 1 by considering regular simplex in En .

Borsuk (1933) asked if b(n) = n + 1 for all n?

b(n) ≥ n + 1 by considering regular simplex in En .

Borsuk (1933) asked if b(n) = n + 1 for all n?

The smallest known n with b(n) > n + 1 is n = 64.

Schramm (1988), Bourgain and Lindenstrauss (1989):

Schramm (1988), Bourgain and Lindenstrauss (1989):

Denote h(K ) to be the smallest number N such that K can be covered by

Denote h(K ) to be the smallest number N such that K can be covered by

Denote h(K ) to be the smallest number N such that K can be covered by

Levi-Hadwiger-Gohberg-Markus’s conjecture: I(K )= h(K ) ≤ 2n

Therefore, it suffices to consider only bodies of constant width when com-

h(n) := sup{h(K )= I(K ) : K is a convex body of constant width in En }.

We have b(n) ≤ h(n).

h(n) := sup{h(K )= I(K ) : K is a convex body of constant width in En }.

We have b(n) ≤ h(n).

h(n) := sup{h(K )= I(K ) : K is a convex body of constant width in En }.

We have b(n) ≤ h(n).

h(n) := sup{h(K )= I(K ) : K is a convex body of constant width in En }.

We have b(n) ≤ h(n).

We answer the question of Kalai in the affirmative.

For fixed x ∈ Sn−1 and 0 < α ≤ π/6 define

For fixed x ∈ Sn−1 and 0 < α ≤ π/6 define

For fixed x ∈ Sn−1 and 0 < α ≤ π/6 define

For a finite X ⊂ Sn−1 , let W(X ) :=

For a finite X ⊂ Sn−1 , let W(X ) :=

If µ denotes the spherical probability measure on Sn−1 , then up to a constant

Proof outline: Sample an appropriately selected number of uniformly i.i.d.

Proof outline: Sample an appropriately selected number of uniformly i.i.d.

Proof: Use Lemma 3Swith ϕ = 6π

Proof: Use Lemma 3Swith ϕ = 6π 14 to get a thinly spread X ⊂ S

Proof: Use Lemma 3Swith ϕ = 6π 14 to get a thinly spread X ⊂ S

Proof: Use Lemma 3Swith ϕ = 6π 14 to get a thinly spread X ⊂ S

Proof: Use Lemma 3Swith ϕ = 6π 14 to get a thinly spread X ⊂ S

Bourgain and Lindenstrauss (1989): g(n) ≥ 1.0645n

Bourgain and Lindenstrauss (1989): g(n) ≥ 1.0645n

Bourgain and Lindenstrauss (1989): g(n) ≥ 1.0645n

Proof: Use Lemma 3 with ϕ = π3 to get a thinly spread X ⊂ Sn−1 .

Bourgain and Lindenstrauss (1989): g(n) ≥ 1.0645n

Proof: Use Lemma 3 with ϕ = π3 to get a thinly spread X ⊂ Sn−1 .

Denote µ(ϕ) := µ(C (x , ϕ)), x ∈ Sn−1 .

Denote µ(ϕ) := µ(C (x , ϕ)), x ∈ Sn−1 .

Lemma 3 is obtained when ψ = ϕ.

where the upper bound is valid for any D > 1.

where the upper bound is valid for any D > 1.

Construction: convex hull of a discrete subset of DSn−1 and Bn .

where the upper bound is valid for any D > 1.

Construction: convex hull of a discrete subset of DSn−1 and Bn .

where the upper bound is valid for any D > 1.

where the upper bound is valid for any D > 1.

If the inradius of K is 1 and the circumradius is D, then the width is D + 1.

where the upper bound is valid for any D > 1.

You might also like