i didnt Idi't f felsite atiids Seidel regular tetrahedron Eixample - - PDF document

SLIDE 1

Spherical two-distance sets and spectral theory of signed graphs

Joint work with Tidor, Y ao, Zhang and Zhao (MIT team)

arxiv 2006.06633

Spherical 2 dist set

vi

VN ERd 1v

vi Vj

takes only 2 values fit

j 3

Question Find maximum sizeof spherical 2 dis

x set in RE

i didnt Idi't f

felsite atiidsSeidel

Eixample

regular tetrahedron

6

1251

Glazyrin Yu

Nld

I did

111 whenever d 7 and d

its

Question What if the inner products are fixed

Given

I E p s L s l

Ncd

Wfff Na pLd

Nap d

Max size of oset of unit vectors Vi

VN

in Rd s t

L Vi Vj 7 L

• r p

ti

tj

Review

Neuman

Nap d

E ed ti

unless

C 2

Larman Rogers Seidel

SLIDE 2

Napull

Cd4 if

• e pedal and

p

c Z

Na pLdI E

l L

if

1 Epc

Leo

xp

i

Napoli

couldbe

Cd4

I

7

less

interesting

y L

p

equiangularlines

I

Balla Divider Kevevash Sudakou

Nap1dL E 2

l F de old

if

le p co e

del

Problem

Eia

tepco EL

4 Determine NapLd for larged

In particular

find him

Napidld

is

d

Equiangular line L

p DEI

Spectral radius order Kfz

smallest k Et

7 k

vertex graph G with dich

X

largesteigenvalueof

set KIN

as if nosuchG exists

adj mat of G

THI lTTY

YZ ft

Fix

L

• set X

for d

doo

CH

Na

a Cd

L h

d

if Kako

d told

• w

SLIDE 3

Example

L

d

G

kN Naaid

13

I

2

ed

Ita

FL

M

3

321

15

2

Ll

3

3dg

Connection between Na aid and ka

Equiangular lines inRd

NvertexGraph G

vi

vz

VN

E Rd

V

v

VN

V

Vj Iff Lui Vj

L

Ivi1 1 and

vi Vj EL

Grammatrix

vi Vjs ij IO

PSD

AI

At EJ

Io

f

t

f

t

rank

Gram mat

E d

D

adjmat

allones

matric CRANK rank XI Aat4J ed

Goal

Givend find largest NS.t I N vertex graphics with PSD

i

RANK Example Given D

find K vertex graphto with dpfGo

Take A

disjoint l

copiesof fo

l to bedetermined Check PSD

eigenvalues of G a x

X l

XI

Aa c EJ

Zo

Take b

rank1

Fo

Fo

d

RANK

rank XL Aa IJ

E elk 1

I E d

Ifl

lik

da k ked

Want Esmat

Bettertake k KIM

SLIDE 4

Cod

Na aCd

kind

kata

t 0111

THm IT44719 7 The reversed inequalityholds

HARD

Question Isthere an analogofkey for Napedi

Ei

• f AGE

A valid t

adoring of fit is

a coloringofthe vertices using

t

colors sit endpointsof every t edge are coloredthe

same and

a

are

Cureddifferently

Chromatic numberof Gte

Whit

smallest t

sit 7 valid t color

Example

Fia tepco

c del

set d IITs

p Eff 11

Take G

with HIGH e p and ACEH d th ftp

V

For Vi EVi VjC

Vj

i j

ViVj edgeinGt

non edgein

G

v

vs

tdm

T

GE

g

G

PSD

Canbe checked

I

SLIDE 5

RANK

rank1 2 Aa MJ

rank

L AGHifAa

AatMJ

EIG4 multld.AE tpwEan d

Spherical 2 distset

N vertexgraph G

u

VN

ERd

Vi n v

ift

vi Vj

p

Vil L

vi Vj

Lor P

psp

XI

Agt fhJ Z O

T

T

Gram matrix

to

I

x p

rankCGram

ed

x p

RANK

rank N Aatpiled Goat Girard find largestN six 7 N rtx graphG with PSD

RANK

Want

IG4

muttlx.AE tpEd 1GHz

d

told

I

multld.AE

lG

4

Want

max

mwltcx.la

164

Matt XAEST

i G

satisfies

Act Sp

Def

Kpk

inf

1

matted

Cod

Fi

I a pao Edel

set D ftp.p LPIJ

i

Then Nap d

kp

Kpk

I d t old

UNI

The reversed inequality holds

SLIDE 6

Exampled

d

P

X

P

kph

Napld

Equiangular

d

d 2

kin

hkaid

line ish

dipso p

km

tf

d

a

dich't 1 33

p

pfd

XE

33

2

2d

algebraic yrs

3

3

Id

method

53

34 2

2d

Equiangular line f ish

LeZpco

maintool

H j and O 7 C

CLO g

sit V connected G

with more deg Ed

mult Xj G AG E cn6g6gn

This tool generalizes to G

with White 2

This tool fails for G1

as soon as HGH

3

Counterexample

multlxicail.AE

n

• h

i EI

tail

bn

Ti

i

E

Gn