mathematical structures in graph theory...
TRANSCRIPT
![Page 1: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/1.jpg)
MATHEMATICAL STRUCTURES
IN GRAPH THEORY IIOliver Knill
Harvard University
JAN 16 2014JAN 16
![Page 2: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/2.jpg)
These 67 slides were not delivered on the 16th and !are still in a rough state or partly recycled from a previous talk. It had become clear that there would be no time for them in 20 minutes.
![Page 3: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/3.jpg)
2 TOPOLOGY
Category, Calculus
Homotopy, Dimension, Graph Topology, Fixed points
1 GEOMETRY
3 ANALYSIS
Differential Geometry,Algebraic Geometry, Integral Geom.
4 ALGEBRACohomology, Hodge theory
5 DYNAMICSDiscrete PDE’s, Integrable Systems
deliv
ered
not d
eliv
ered
6 SPECTRAL PROBLEMS
Matrix Tree
slid
es I
slid
es II
Zeta function
![Page 4: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/4.jpg)
ANALYSIS
![Page 5: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/5.jpg)
LJUSTERNIIK SCHNIRELMANN
Ljusternik 1899 - 1981 Schnirelmann 1905-1938
![Page 6: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/6.jpg)
LJUSTERNIIK SCHNIRELMANN THEORYA prototype theory which has a couple of implementations in the discrete. The version done together with Josellis is by far closest to the continuum and natural since all notions are parallel and the results are the same than in the continuum except for minor modifications.
Essentially the only difference is that graphs can be too small to make an embedded graph contractible. The equator circle in an octahedron G is not contractible in G. But we can expand G first and then contract so that the circle deforms to a point.
![Page 7: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/7.jpg)
C C5 6
Two graphs are homotopic, if they can be transformed
into each other by homotopy steps.
Ivashchenko 1994 also has edge
operations
ChenYauYeh 2001:
edge operations not needed
HOMOTOPY
![Page 8: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/8.jpg)
8
6
4
32
HOMOTOPY CLASSES
![Page 9: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/9.jpg)
Contraction of G which shrinks H to a point of if H is contractible in itself.
CONTRACTIBILITY WITHIN G
is contractible in G!but not in itself.
G
![Page 10: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/10.jpg)
LJUSTERNIK SCHNIRELMANN
cup ≤
work with Frank Josellis
tcat(G) = min # in G contractible setscrit(G) = min # of critical points !cup(G) = cup length
cat ≤ cri
Algebra Topology Analysiscat and cri are homotopy invariant versions!of tact and crit.
![Page 11: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/11.jpg)
CALCULUS
Calculus on graphs is surprisingly simple. Stokes theorem is almost tautological in arbitrary dimensions.
Surprising is also that this has already been done by Poincare. Poincare defined grad, curl, div etc in arbitrary dimensions as concrete matrices and used this to define cohomology.
![Page 12: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/12.jpg)
STOKES-GAUSS
Stokes Gauss
![Page 13: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/13.jpg)
GREEN STOKES GAUSS∑ df (x) =
x εG∑ f (x)
x ε δG
d0
gradd
1curl
d0
div*
Δ = div grad
![Page 14: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/14.jpg)
STOKES
∫curl(F) dS = ∫Fdr S C
![Page 15: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/15.jpg)
MORSE REEB
![Page 16: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/16.jpg)
MORSE THEORY
Morse theory also has several implementations in the discrete. Our approach does not need additional structure on the graph.
We have seen that Poincare Hopf works with Morse ideas. What is needed for Morse theory is that functions are so nice that adding a point only changes one entry by 1 in the Betti vector.
Then the Morse inequalities etc hold as in the continuum.
![Page 17: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/17.jpg)
MORSE REEB
2 critical points -> sphere
TopologyAnalysis
b ≤ c k kAlgebra Analysis
MORSE
REEB
∑ (-1) ckk = χ
![Page 18: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/18.jpg)
THE END
![Page 19: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/19.jpg)
ALGEBRA
![Page 20: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/20.jpg)
ALGEBRA
Some of the following slides are from my ILAS talk which had obviously more focus on linear algebra. I recycle here some slides.
![Page 21: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/21.jpg)
MCKEAN SINGER
![Page 22: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/22.jpg)
DIRAC OPERATOR
D =d + d
1
2
3
4
v = 4 v = 4 v = 1
01
2 χ(G)=1
0 0 0 0 -1 0 0 0 0 !
0 0 0 0 1 -1 -1 0 0 !
0 0 0 0 0 0 1 -1 0 !
0 0 0 0 0 1 0 1 0 !
-1 1 0 0 0 0 0 0 0 !
0 -1 0 1 0 0 0 0 1 !
0 -1 1 0 0 0 0 0 -1 !
0 0 -1 1 0 0 0 0 -1 !
0 0 0 0 0 1 -1 -1 0
*
![Page 23: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/23.jpg)
LAPLACE-BELTRAMI MATRIX
L =(d + d) =
1
2
3
4
2
1 -1 0 0 0 0 0 0 0 -1 3 -1 -1 0 0 0 0 0 0 -1 2 -1 0 0 0 0 0 0 -1 -1 2 0 0 0 0 0 0 0 0 0 2 -1 -1 0 0 0 0 0 0 -1 3 0 0 0 0 0 0 0 -1 0 3 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 3
is block diagonal.
![Page 24: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/24.jpg)
RANDOM 25 VERTEX
GRAPH
![Page 25: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/25.jpg)
COHOMOLOGY
ker(d )/im(d )k k-1H (G)k =
k'th cohomology group
b (G)=dim(H (G))kBetti number
b - b + b ... = χ(G)
cohomological Euler characteristic0 1 2
k
![Page 26: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/26.jpg)
EULER CHARACTERISTIC
χ (G)simp
χ (G)coho
= v - v + v - ... 0 1 2
= b - b + b - ... 0 1 2coho
=8-11+2
=1-2
v-e+f=1-gExample: no
tetrahedra, then
![Page 27: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/27.jpg)
EULER-POINCARE
Proof. C space of m forms
χ (G) = χ (G)simp coho
m Z = ker(d ) space of m cocyclesm m R = ran(d ) space of m coboundariesm mz = v - r rank-nullety theoremm m mb = z - r definition of cohomologym m m-1
∑ (-1) (v - b ) = ∑ (-1) ( r - r ) = 0 QEDm
mm m m m-1m
m
![Page 28: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/28.jpg)
HODGE THEOREM
Proof: ! L f = 0 is equivalent to df=d f =0
H (G) = Ker(L ) ~m
m
*
im(d) + im(d ) +ker(L) = R* n<f,Lf> = <d f, d f> + <df,df> * *
<dg,d h> = 0 . Also ker(L) and im(L) are perp.*
dg=0 implies g=d f+hcan match cohomology class [g] - harmonic form
![Page 29: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/29.jpg)
SUPER TRACE
str(A) = tr(P A)
+
-
+
Example:!str(1)=tr(P)!=χ(G)
![Page 30: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/30.jpg)
str(exp(-t L)) = χ(G)
MCKEAN SINGER
Proof. Each Boson f matches a Fermion Df Lf = λ f
LDf = D Lf = Dλ f = λ Df str(L ) = 0 for n >0str(exp(-t L))=str(1)= χ(G)
![Page 31: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/31.jpg)
COMBINATORICS
![Page 32: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/32.jpg)
1824-1887
GUSTAV KIRCHHOFF
![Page 33: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/33.jpg)
MATRIX TREE THEOREM
1
2
3
4
1 -1 0 0
-1 3 -1 -1
0 -1 2 -1
0 -1 -1 2
L=
L = B-A = B = Degree matrix
Eigenvalues: 4,3,1,0
![Page 34: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/34.jpg)
det(E+L)/4=12/4 = 3
E = 1/nij
![Page 35: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/35.jpg)
FOREST THEOREM
det(L+1) is the!number of rooted !spanning forests
Chebotarev-Shamis
We have a completely new proof, using a new !identity in linear algebra:
![Page 36: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/36.jpg)
CAUCHY-BINET
det(1+x F G) = x det(F ) det(G )
We are not aware that this has appeared anywhere.
F,G arbitrary n x m matrices.
TT |P|∑P
F G Ppattern
![Page 37: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/37.jpg)
EXAMPLES OF FORESTS
![Page 38: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/38.jpg)
![Page 39: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/39.jpg)
![Page 40: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/40.jpg)
![Page 41: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/41.jpg)
THE END
![Page 42: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/42.jpg)
DIFFERENTIAL EQUATIONS
![Page 43: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/43.jpg)
DIFFERENTIAL EQUATIONS
Also some of the Dynamics stuff had been mentioned in the ILAS talk. Linear differential equations are of course tightly mingled with linear algebra.
![Page 44: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/44.jpg)
PDE ANALOGUES ON GRAPHS
u'' = - L u
u' = - L u u' = i L u
Heat
Schrödinger
Wave
dF=0,d F=j* Maxwell
Lu=j Poisson
![Page 45: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/45.jpg)
HEAT KERNELexp(-Lt)
projection onto harmonics
![Page 46: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/46.jpg)
WAVE EQUATION SOLUTION
u'' = - D u 2
u'' = - L u
(∂+i D)(∂-i D) u =0
u(t) = cos(Dt)u(0)+sin(Dt)Du'(0)-1
d'Alembert type solution
![Page 47: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/47.jpg)
WAVE MATRIXcos(Dt)
![Page 48: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/48.jpg)
1926-
PETER LAX
![Page 49: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/49.jpg)
ISOSPECTRAL EVOLUTIONS
D' = [B, D] , B=d - d *D(t)=d + d+b*isospectral deformation
Re(U(t)) Im(U(t))
![Page 50: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/50.jpg)
D(t) = U(t) D(0) U(t) *
![Page 51: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/51.jpg)
SPECTRAL PROBLEMS
![Page 52: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/52.jpg)
ISOSPECTRAL GRAPHS
H-H Graphs are Dirac Isospectral!
proof: L , L , McKean Singer: L20 1
![Page 53: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/53.jpg)
ZETA FUNCTION
Having been mentioned last spring, this research has made progress in the summer.
![Page 54: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/54.jpg)
ζ(s) = ∑ λ
ZETA FUNCTION
-s
λ>0
where λ runs over the set σ(A) of eigenvalues of A.
Let A be an operator for which the spectrum is discrete and satisfies σ(A)=-σ(A). Define
![Page 55: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/55.jpg)
ζ(s) = ∑ k
CIRCLE CASE
-s
k>0
ζ(s) = ∑ sin(π k/n) -s
k=1
n
n
A= i∂/∂x
A=Dirac matrix of graph C n
![Page 56: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/56.jpg)
W10σ
τ
A = Dirac
operator of the graph
![Page 57: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/57.jpg)
ζ (2s) is the Zeta function of the Laplacian L
n
![Page 58: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/58.jpg)
Theorem: (Baby Riemann)
The roots of the Laplace Zeta!function ζ (2s) converge to the!line σ=1/2.n
Proof: three parts. Exclude roots of ζ (s)
There is no relation with the actual Riemann hypothesis!
σ>1: Approximate with n
ζ(s)0<σ<1: “Central limit “σ<0: Riemann sum
![Page 59: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/59.jpg)
BERNHARD RIEMANN
1826-1866
![Page 60: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/60.jpg)
??
![Page 61: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/61.jpg)
![Page 62: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/62.jpg)
ζ(C ) n
n=10 to 5000
18
9
0
8
4
0
![Page 63: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/63.jpg)
![Page 64: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/64.jpg)
0.6
0.5
0.4
0.3
![Page 65: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/65.jpg)
20005000
1000020000
4000080000
![Page 66: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/66.jpg)
![Page 67: MATHEMATICAL STRUCTURES IN GRAPH THEORY IIpeople.math.harvard.edu/~knill/seminars/baltimore/baltimore2.pdf · MATHEMATICAL STRUCTURES IN GRAPH THEORY II Oliver Knill! Harvard University](https://reader034.vdocuments.site/reader034/viewer/2022043010/5f9f10609d847550a018c8db/html5/thumbnails/67.jpg)
THE END