Scribd
Upload
7 views

Isoperimetric Problems: Feb 11, 2005 Lecturer: Nati Linial Notes: Yuhan Cai & Ioannis Giotis

This document summarizes a lecture on isoperimetric problems. It discusses several key topics: - Densest sphere packing problems in a unit cube and calculating packing density limits. - Isoperimetric problems on the cube, including vertex and edge isoperimetric questions about minimizing edges between sets of vertices. - Using orthogonal polynomials like Krawtchouk polynomials to solve isoperimetric problems on the cube. - Properties of orthogonal polynomial systems, including a three-term recurrence relation and having roots within the support of the weight function. - Applying Delsarte's linear programming bounds to dense sphere packing problems using orthogonal polynomials.

Uploaded by

Ashoka Vanjare
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Isoperimetric Problems: Feb 11, 2005 Lecturer: Nati Linial Notes: Yuhan Cai & Ioannis Giotis

This document summarizes a lecture on isoperimetric problems. It discusses several key topics: - Densest sphere packing problems in a unit cube and calculating packing density limits. - Isoperimetric problems on the cube, including vertex and edge isoperimetric questions about minimizing edges between sets of vertices. - Using orthogonal polynomials like Krawtchouk polynomials to solve isoperimetric problems on the cube. - Properties of orthogonal polynomial systems, including a three-term recurrence relation and having roots within the support of the weight function. - Applying Delsarte's linear programming bounds to dense sphere packing problems using orthogonal polynomials.

Uploaded by

Ashoka Vanjare
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Lecture 5

Isoperimetric Problems
Feb 11, 2005
Lecturer: Nati Linial
Notes: Yuhan Cai & Ioannis Giotis
Codes: densest sphere packing in 0, 1
n
.
A(n, d) = max[[, 0, 1
n
, dist() d
R() = limsup
1
n
log
2
()[ 0, 1
n
, dist()
n

Majority is the stablest -


Gaussian:
1
(2)
(
n/2)
e
x
2
/2
Borell: isoperimetric problem is solved by a half-space
Isoperimetric Questions on the cube (Harper): Vertex and Edge isoperimetric questions.
The edge problem is dened as follows: Given that S 0, 1
n
, [S[ = R, how small e(S,

S) be?
Answer: S 0, 1
n
, e(S) 1/2[S[ log
2
[S[, [S[ = 2
k
, S = ( . . . 0 . . . 0 with k *s.
Proof (induction on dim):
e(S) e(S
0
) +e(S
1
) +[S
0
[, [S[ = x, [S
0
[ x, < 1/2.
1/2xlog
2
x 1/2(x) log
2
x) + 1/2(1 )xlog[(1 )x] +x
0 log + (1 ) log(1 ) + 2
H() 2 at = 0, 1/2.
The vertex isoperimetric problem is dened as miny [ y / S, x S such that xy E(0, 1)
n
),
S 0, 1
n
, [S[ k. The answer is an optimal S-ball. Specically, if k = [S[ =

t
j=0
_
n
j
_
, then
[S[
_
n
t+1
_
.
We will use the Kraskal-Katona theorem. If f
_
[n]
k
_
, then the shadow of f is
(f) =
_
y
_
[n]
k
_
[ x f, x y
_
We wish to minimize [(f)[.
34
To do this, take f as an initial segment in the reverse lexicographic order. The lexicographic order is
dened as
A < B, if min(AB) < min(BA)
while the reverse lexicographic order is
A <
RL
B, if max(AB) <
RL
max(BA)
For example:
Lex : 1, 2)1, 3)1, 4), . . .
RLex : 1, 2)1, 3)2, 3), . . .
Margulis and Talagrand gave the following denition for S 0, 1)
n
h(x) = y / S [ xy E , x S
We now have the 2 problems
Vertex Isoperimetric, min
|S|=k

xS
(h(x))
0=0
Edge Isoperimetric, min
|S|=k

xS
(h(x))
=1
We have [S[ 2
n1

_
h(x) (2
n
), for p = 1/2.
Kleitman: [S[ =
t
j=0
_
n
j
_
, S 0, 1
n
, t < n/2 diam(S) 2t. Can you show that S necessarily
contains a large code?
Question: (answered by Friedgut) suppose that [S[ 2
n1
and (S, S
C
) 2
n1
, then is S roughly a
dictatorship?
Answer: yes. subcube x
1
= 0 f(x
1
, . . . , x
n
) = x
1
. R() = limsup
n

1
n
log()[
0, 1
n
, dist() n.
5.1 Delsartes LP
Having g = 1
C
, f = 2
n
g g/[C[, Delsartes LP is
A(n, d) max
x{0,1}
nf(x)
f 0
f(0) = 1

f 0
f[
1,...,d1
= 0
Some useful equations
g g(0) =
1
2
n

g(y)g(y) =
[C[
2
n
g g(S) =
1
2
n
x, y C [ x y = S
35
We start with an observation. Without loss of generality, f is symmetric or in other words f(x) depends
only on [x[ =
|x|
. We look for
0
= 1,
1
= . . . =
d1
= 0,
d
, . . . ,
n
0.
Weve expressed f 0, f(

0) = 1 and we are trying to maximize


_
n
j
_

j
.
L
j
= x 0, 1
n
, [x[ = j
f =
n

j=0

j
1
L
j

f =

1
L
j
Note that L
j
is symmetric. It also follows that

1
L
j
is symmetric. We need to know

1
L
j
if [y[ = t.

(T) =

(S)(1)
|ST|

1
L
j
(T) =

|S|=j
(1)
|ST|
K
(n)
j
(x) =

i
(1)
i
_
t
i
__
n t
j i
_
This is the Krawtchouk polynomial presented in the next section.
5.2 Orthogonal Polynomials on R
Interesting books for this section are Interpolation and Approximation by Davis and Orthogonal polyno-
mials by Szeg o.
The weights of orthogonal polynomials on R are dened by
w : R R
+
,
_
R
w(x) <
The inner product on f : R R is
f, g) =
_
R
f(x)g(x)w(x) dx
and with weights w
1
, w
2
, . . ., and points x
1
, x
2
, . . .
f, g) =

w
i
f(x
i
)g(x
i
)
Lets now talk about orthogonality. Start from the functions 1, x, x
2
, . . . and carry out a Gram-Schmidt
orthogonalization process. Youll end up with a sequence of polynomials P
0
(x), P
1
(x), . . . s.t. P
i
has degree
i and P
i
, P
j
) =
ij
.
36
One case of orthogonal polynomials are the Krawtchouk polynomials, on discrete points x
0
= 0, x
1
=
1, . . . , x
n
= n with w
j
=
_
n
j
_
/2
n
. The j-th Krawtchouk polynomial K
j
(x) is a degree j polynomial in x.
It is also the value of

1
L
j
(T) whenever [T[ = x.
K
(n)
j
(x) =
n

i=0
(1)
i
_
x
i
__
n x
j i
_
Lets see why are they orthogonal or in other words
1
2
n

i=0
K
p
(i)K
q
(i)
_
n
i
_
=
pq
_
n
p
_
Starting from
1
p
, 1
q
) =
1
2
n
_
n
p
_

pq
and using Parsevals identity we get

1
Lp
,

1
Lq
) =
1
2
n

K
p
([S[)K
q
([S[) =
1
2
n

i=0
K
p
(i)K
q
(i)
_
n
i
_
The rst K
j
s are
K
0
(x) = 1, K
1
(x) = n 2x, K
2
(x) =
_
x
2
_
(n x) +
_
n x
2
_
=
(n 2x)
2
n
2
We also have the following identity
K
j
(n x) = (1)
j
K
j
(x)
Lemma 5.1. Every system of orthogonal polynomials satises a 3-term recurrence
xP
j
=
j
P
j+1
+
j
P
j
+
j
P
j1
Proof.
1
L
i
1
L
j
(S) =
1
2
n

i
1
L
j
(S i) =
=
1
2
n
((j + 1)1
L
j+1
+ (n j + 1)1
L
j1
) =
=
1
2
n
((j + 1)1
L
j+1
+ (n j + 1)1
L
j1
)
For the Krawtchouk polynomials
K
i
K
j
= (j + 1)K
j+1
+ (n j + 1)K
j1
(n 2x)K
j
= (j + 1)K
j+1
+ (n j + 1)K
j1
37
Theorem 5.2. For every family of orthogonal polynomials there is
1. a 3-term recurrence relation
x P
j
=
j
P
j+1
+
j
P
j
+
j
P
j1
2. P
j
has j real roots all in conv[supp w].
Proof. Observe that P
0
, P
1
, . . . , P
t
form a basis for the space of all polynomials of degree t, which means
that P, Q) = 0, Q polynomials of degree j
x P
j
=
j+1

i=0

i
P
i
(5.1)
We now claim that
0
=
1
= =
j2
= 0. Lets take in (5.1) an inner product with P
l
,l < j 1.
xP
j
, P
l
) =
j+1

i=0

i
P
i
, P
j
) =
l
|P
l
|
2
P
j
, xP
l
) =
l
|P
l
|
2
which is 0 for P
l
of degree j 1.
If u
i
s are the zeros of P
j
of odd multiplicity then
0 = P
j
,

(x u
i
)) = P
j

(x u
j
) > 0
38

You might also like