LECTURE 4. PROOF OF IHARA S THEOREM, EDGE CHAOS. Ihara Zeta Function. ν(c) ζ(u,x) =(1-u ) det(i-au+qu t(ia )
|
|
- Dale Cole
- 5 years ago
- Views:
Transcription
1 LCTUR 4. PROOF OF IHARA S THORM, DG ZTAS, QUANTUM CHAOS Ihara Zeta Function ν(c) ( ) - ζ(u,x)= -u [C] prime ν(c) = # edges in C converges for u complex, u small Ihara s Theorem. - 2 r- 2 ζ(u,x) =(-u ) det(i-au+qu t(ia ) A=adjacency matrix, Q +I = diagonal matrix of degrees, r=rank fundamental group.
2 dge Zetas Orient the edges of the graph. Multiedge matrix W has ab entry w ab in C, w(a,b)=w ab if the edges a and b look like a Otherwise set w ab =0. b and a is not the inverse of b For a prime C = a a 2 a s, define the edge norm N C wa a wa a wa a wa a ( ) = ( s, ) (, 2) ( 2, 3) ( s, s) Define the edge zeta for small w ab as [ C ] ( ) ζ ( W, X) = N ( C) Properties of dge Zeta Ihara ζ(u,x) = ζ (W,X) non-0 w(i,j)=u edge e deletion ζ (W,X-e)=ζ (W,X) 0=w(i,j), if i or j=e Determinant Formula For dge Zeta (, ) = det ( ) ζ ( W, X) I W From this Bass gives an ingenious proof of Ihara s theorem. Reference: Stark and T., Adv. in Math., Vol. 2 and 54 and 208 (996 and 2000 and 2007) 2
3 xample e 3 e 6 D=Dumbbell Graph e 2 e 5 e e 4 w w w w w 33 0 w35 0 ζ ( W, D) = det 0 w42 0 w w5 0 0 w w 65 w66 e 2 and e 5 are the vertical edges. Specialize all variables with 2 and 5 to be 0 and get zeta function of subgraph with vertical edge removed. Fission Diagonalizes the matrix. Proof of the Determinant Formula log ζ N ( P) j j = ν(p)=m #[P]=m. [ P] j log N ( P) k ζ m m P k ν ( P) = m = P prime path, not class [P] m log ζ = N ( C ) = Tr ( W ) C ν ( C) m m Here C need not be prime path, still closed, no backtrack, no tails k non-prime paths C are powers of primes C=P k for last = use the same sort of argument as in Lecture 2. 3
4 Using the matrix calculus exercise from Lecture 2 det(exp(b)=exp(tr(b)) gives W = Tr W = I W m log ζ ( ) ( ) logdet m m ( ) This proves (log( determinant formula)). ζ (, ) det( ) W X = I W ζ ( W, X ) det( I W ) = ζ 2 2 (, ) ( ) r V ux = u det( I Au+ Qu) 4
5 s ve Part of Bass Proof Define Define starting matrix S and terminal matrix T - both V x2 matrices of 0s and s 0 I J = I 0, if v is starting vertex of oriented edge e = 0, otherwise, if v is the terminal vertex of oriented edge e t ve = 0, otherwise Then, recalling our edge numbering system, we see that SJ = T, TJ=S since start t (end) of e is end (start) t) of e j j+ t t t A = S T, Q+I V = SS = TT Note: matrix A counts number of undirected edges connecting 2 distinct vertices and twice # of loops at each vertex. Q+I = diagonal matrix of degrees of vertices Part 2 of Bass Proof W matrix obtained from W by setting all non -zero w ij equal to t W+J=T S, where J compensates for not allowing edge e to feed into e Below all matrices are ( V +2 ) x ( V +2 ), with V x V st block. The preceding formulas imply that: 2 I V 0 I V ( u ) Su t T I2 0 I2 Wu 2 I I 0 Au + Qu Su V V = t t 0 I T S u I 2 Ju + 2 Then take determinants of both sides to see V 2 ( u ) det( I Wu) = det( I Au+ Qu ) det( I + Ju) j j± 5
6 nd of Bass Proof ( u ) det( I Wu) = det( I Au+ Qu ) det( I + Ju) 2 V 2 2 V 2 I Iu I 0 I Iu I + Ju = implies ( I + Ju) = 2 Iu I -Iu I 0 I( u ) So det(i+ju)=(-u 2 ) Since r-= - V V, for a connected graph, the Ihara formula for the vertex zeta function follows from the edge zeta determinant formula. A Taste of Random Matrix Theory / Quantum Chaos a reference with some background on the interest in random matrices in number theory and quantum physics: A.Terras, Arithmetical quantum chaos, IAS/Park City Math. Series, Vol. 2 (2007). In lecture we mentioned the experimental connections between statistics of spectra of random symmetric real matrices and the statistics of imaginary parts of s at poles of Ihara ζ(q -s ) (analogous to statistics of imaginary parts of zeros of Riemann ζ and spectra of Hermitian matrices). 6
7 from O. Bohigas and M.-J. Giannoni, Chaotic motion and random matrix theories, Lecture Notes in Physics, 209, Springer-Verlag, Berlin, 984: arrows mean lines are too close to distiguish The dichotomy RMT spacings (GO etc) ½πxexp( πx 2 /4) quantum spectra of system with chaos in classical counterpart Bohigas Giannonii Schmit Conjecture, 984 eigenvalues of Laplacian for nonarithmetic manifold zeros Riemann zeta Poisson spacings exp(-x) energy levels of quantum system with integrable system for classical counterpart t Berry Tabor Gutzwiller Conjecture, 977 eigenvalues of Laplacian for arithmetic manifold; e.g. H/SL(2,Z) Sarnak invented the term arithmetical quantum chaos to describe the 2nd row of our table. See the book of Katz and Sarnak for some proved results about zetas of curves over finite fields. See Rudnick What is quantum chaos? Notices AMS, Jan for definitions of some of these things in the context of billiards. None of these conjectures is proved as far as I know. 7
8 Now we wish to add a new column to earlier figure - spacings of the eigenvalues of the W matrix of a graph Here although W is not symmetric, we mean the nearest neighbor spacing (i.e., histogram of minimum distances between eigenvalues which lie in the complex plane not just the real axis). Reference on spacings of spectra of non-hermitian or non-symmetric matrices. P. LeBoef, Random matrices, random polynomials, and Coulomb systems,arxiv. J. Ginibre, J. Math. Phys. 6, 440 (965). Mehta, Random Matrices, Chapter 5. An approximation to the density for spacings of eigenvalues of a complex matrix (analogous to the Wigner surmise for Hermitian matrices) is: Γ s 3 4 4Γ 4 se Statistics of the poles of Ihara zeta or reciprocals of eigenvalues of the dge Matrix W Define W to be the 0, matrix you get from W by setting all non-0 entries of W to be. Theorem. ζ(u,x) - =det(i-w u). Corollary. The poles of Ihara zeta are the reciprocals of the eigenvalues of W. The pole R of zeta is: R=/Perron-Frobenius eigenvalue of W. 8
9 Properties of W ) A B, B and C symmetric real, A real W = T C A 2) jth row sums of entries are q j +=degree vertex which is start of edge j. Poles Ihara Zeta are in region q - R u, q+=maximum degree of vertices of X. Theorem of Kotani and Sunada If p+=min vertex degree, and q+=maximum vertex degree, non-real n lpl poles u of zeta satisfy tif u q p Kotani & Sunada, J. Math. Soc. U. Tokyo, 7 (2000) or see my manuscript on my website: Spectrum of Random Matrix with Properties of W -matrix A B W = C A T entries of W are nonnegative from normal distribution B and C symmetric diagonal entries are 0 Girko circle law for real matrices with circle of radius ½(+ 2) n symmetry about real axis Can view W as edge matrix for a weighted graph We used Matlab command randn(500) to get A,B,C matrices with random normally distributed entries mean 0 std dev 9
10 Nearest Neighbor Spacings vs Wigner surmise of Ginibre p w (s) = 4 Γ(5/4) 4 s 3 exp ( Γ(5/4) 4 s 4 ) See P. Leboef, Random matrices, random polynomials ls and Coulomb systems, ArXiv, Nov. 5, 999. Mehta, Random Matrices, Chapter 5 Note that we have normalized the histogram to have area. The spacings are also normalized to have mean. Matlab xperiments with igenvalues of Random W matrix of an Irregular Graph - Reciprocals of Poles of Zeta Circles have radii p blue / R green q turquoise RH approximately true region 2 dimensional but not even an annulus Looks very similar to the regions obtained for random covers of a small base graph. probability of edge
11 The corresponding nearest neighbor spacings for the preceding graph vs the Wigner surmise Matlab xperiment Random Graph with Higher Probability of an dge Between Vertices (dge Probability ) RH true
12 Spectrum W for a Z 6 xz 65 -Cover of 2 Loops + xtra Vertex are pink dots Circles Centers (0,0); Radii: 3 -/2, R /2,; R.47 RH very False: Lots of Pink outside green circle Level Spacing for the Previous W Matrix Comparing W spacings for this abelian cover with the random cover following looks like the dichotomy between spacings of eigenvalues of the Laplacian for arithmetic vs non-arithmetic groups. 2
13 Spec W for random 70 cover of 2 loops plus vertex graph in picture. The pink dots are at Spectrum W. Circles have radii q, / R, p, with q=3, p=, R RH approximately True. Level Spacing for the Previous W Matrix vs modified Wigner surmise: 3
14 References: 3 papers with Harold Stark in Advances in Math. Papers with Matthew Horton & Harold Stark on my website For work on directed graphs, see Matthew Horton, Ihara zeta functions of digraphs, Linear Algebra and its Applications, 425 (2007) work of Angel, Friedman and Hoory giving analog of Alon conjecture for irregular graphs, implying our Riemann Hypothesis (see Joel Friedman s website: ca/~jf) The nd 4
Lecture 3. A Proof of Ihara s Theorem, Edge & Path Zetas, Connections with Quantum Chaos
Lecture 3. A Proof of Ihara s Theorem, dge & Path Zetas, Connections with Quantum Chaos Audrey Terras Correction to lecture The 4-regular tree T 4 can be identified with the 3-adic quotient SL(2,Q 3 )/SL(,Z
More informationIhara zeta functions and quantum chaos
Ihara zeta functions and quantum chaos Audrey Terras Vancouver AMS Meeting October, 2008 Joint work with H. M. Stark, M. D. Horton, etc. Outline 1. Riemann zeta 2. Quantum Chaos 3. Ihara zeta 4. Picture
More informationWhat is the Riemann Hypothesis for Zeta Functions of Irregular Graphs?
What is the Riemann Hypothesis for Zeta Functions of Irregular Graphs? Audrey Terras Banff February, 2008 Joint work with H. M. Stark, M. D. Horton, etc. Introduction The Riemann zeta function for Re(s)>1
More informationWhat is the Riemann Hypothesis for Zeta Functions of Irregular Graphs?
What is the Riemann Hypothesis for Zeta Functions of Irregular Graphs? UCLA, IPAM February, 2008 Joint work with H. M. Stark, M. D. Horton, etc. What is an expander graph X? X finite connected (irregular)
More informationFun with Zeta Functions of Graphs. Thanks to the AWM!!!!!!!!!!!!!!!!!
Fun with Zeta Functions of Graphs Audrey Terras Thanks to the AWM!!!!!!!!!!!!!!!!! from Wikipedia Amalie Emmy Noether Abstract Introduction to zeta functions of graphs + history & comparisons with other
More informationx #{ p=prime p x }, as x logx
1 The Riemann zeta function for Re(s) > 1 ζ s -s ( ) -1 2 duality between primes & complex zeros of zeta using Hadamard product over zeros prime number theorem x #{ p=prime p x }, as x logx statistics
More informationLecture 1: Riemann, Dedekind, Selberg, and Ihara Zetas
Lecture 1: Riemann, Dedekind, Selberg, and Ihara Zetas Audrey Terras U.C.S.D. 2008 more details can be found in my webpage: www.math.ucsd.edu /~aterras/ newbook.pdf First the Riemann Zeta 1 The Riemann
More informationLecture 2: Ruelle Zeta and Prime Number Theorem for Graphs
Lecture 2: Ruelle Zeta and Prie Nuber Theore for Graphs Audrey Terras CRM Montreal, 2009 EXAMPLES of Pries in a Graph [C] =[e e 2 e 3 ] e 3 e 2 [D]=[e 4 e 5 e 3 ] e 5 [E]=[e e 2 e 3 e 4 e 5 e 3 ] e 4 ν(c)=3,
More informationCopy from Lang, Algebraic Number Theory
Copy from Lang, Algebraic Number Theory 1) L(u,1,Y/X) = z(u,x) = Ihara zeta function of X (our analogue of the Dedekind zeta function, also Selberg zeta function) 2) ζ( uy, ) = Lu (, ρ, Y / X) dρ ρ G product
More informationZeta Functions and Chaos
Zeta Functions and Chaos Audrey Terras October 2, 2009 Abstract: The zeta functions of Riemann, Selberg and Ruelle are briefly introduced along with some others. The Ihara zeta function of a finite graph
More informationWhat are primes in graphs and how many of them have a given length?
What are pries in graphs an how any of the have a given length? Aurey Terras Math. Club Oct. 30, 2008 A graph is a bunch of vertices connecte by eges. The siplest exaple for the talk is the tetraheron
More informationZeta Functions of Graph Coverings
Journal of Combinatorial Theory, Series B 80, 247257 (2000) doi:10.1006jctb.2000.1983, available online at http:www.idealibrary.com on Zeta Functions of Graph Coverings Hirobumi Mizuno Department of Electronics
More informationfun with zeta and L- functions of graphs Audrey Terras U.C.S.D. February, 2004 IPAM Workshop on Automorphic Forms, Group Theory and Graph Expansion
fun with zeta and L- functions of graphs Audrey Terras U.C.S.D. February, 2004 IPAM Workshop on Automorphic Forms, Group Theory and Graph Expansion Introduction The Riemann zeta function for Re(s)>1 1
More informationZeta functions and chaos
A Window Into Zeta and Modular Physics MSRI Publications Volume 57, 2010 Zeta functions and chaos AUDREY TERRAS 1. Introduction This paper is an expanded version of lectures given at MSRI in June of 2008.
More informationp e po K p e+1 efg=2
field ring prime ideal finite field K=F( m) O K = Z[ m] p po K O K /p F= Q O F =Z pz Z/pZ g = # of such p, f = degree of O K /p over O F /po F p e po K p e+1 efg=2 Assume, m is a square-free integer congruent
More informationEigenvalues of Non-Backtracking Walks in a Cycle with Random Loops
Rose-Hulman Undergraduate Mathematics Journal Volume 8 Issue 2 Article 10 Eigenvalues of Non-Backtracking Walks in a Cycle with Random Loops Ana Pop University of British Columbia, anapop@telus.net Follow
More informationWeighted Zeta Functions of Graph Coverings
Weighted Zeta Functions of Graph Coverings Iwao SATO Oyama National College of Technology, Oyama, Tochigi 323-0806, JAPAN e-mail: isato@oyama-ct.ac.jp Submitted: Jan 7, 2006; Accepted: Oct 10, 2006; Published:
More informationEIGENVALUE SPACINGS FOR REGULAR GRAPHS. 1. Introduction
EIGENVALUE SPACINGS FOR REGULAR GRAPHS DMITRY JAKOBSON, STEPHEN D. MILLER, IGOR RIVIN AND ZEÉV RUDNICK Abstract. We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments
More informationRongquan Feng and Jin Ho Kwak
J. Korean Math. Soc. 43 006), No. 6, pp. 169 187 ZETA FUNCTIONS OF GRAPH BUNDLES Rongquan Feng and Jin Ho Kwak Abstract. As a continuation of computing the zeta function of a regular covering graph by
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationRandom Matrix: From Wigner to Quantum Chaos
Random Matrix: From Wigner to Quantum Chaos Horng-Tzer Yau Harvard University Joint work with P. Bourgade, L. Erdős, B. Schlein and J. Yin 1 Perhaps I am now too courageous when I try to guess the distribution
More informationZeta functions in Number Theory and Combinatorics
Zeta functions in Number Theory and Combinatorics Winnie Li Pennsylvania State University, U.S.A. and National Center for Theoretical Sciences, Taiwan 1 1. Riemann zeta function The Riemann zeta function
More informationQuantum Billiards. Martin Sieber (Bristol) Postgraduate Research Conference: Mathematical Billiard and their Applications
Quantum Billiards Martin Sieber (Bristol) Postgraduate Research Conference: Mathematical Billiard and their Applications University of Bristol, June 21-24 2010 Most pictures are courtesy of Arnd Bäcker
More informationA new type of PT-symmetric random matrix ensembles
A new type of PT-symmetric random matrix ensembles Eva-Maria Graefe Department of Mathematics, Imperial College London, UK joint work with Steve Mudute-Ndumbe and Matthew Taylor Department of Mathematics,
More informationDeterminant of the Schrödinger Operator on a Metric Graph
Contemporary Mathematics Volume 00, XXXX Determinant of the Schrödinger Operator on a Metric Graph Leonid Friedlander Abstract. In the paper, we derive a formula for computing the determinant of a Schrödinger
More informationZETA FUNCTIONS OF WEIGHTED GRAPHS AND COVERING GRAPHS
ZETA FUNCTIONS OF WEIGHTED GRAPHS AND COVERING GRAPHS MATTHEW D. HORTON, H. M. STARK, AND AUDREY A. TERRAS ABSTRACT. We nd a condition for weights on the edges of a graph which insures that the Ihara zeta
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationQuantum chaos on graphs
Baylor University Graduate seminar 6th November 07 Outline 1 What is quantum? 2 Everything you always wanted to know about quantum but were afraid to ask. 3 The trace formula. 4 The of Bohigas, Giannoni
More informationCONVERGENCE OF ZETA FUNCTIONS OF GRAPHS. Introduction
CONVERGENCE OF ZETA FUNCTIONS OF GRAPHS BRYAN CLAIR AND SHAHRIAR MOKHTARI-SHARGHI Abstract. The L 2 -zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension.
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
More informationNetworks and Matrices
Bowen-Lanford Zeta function, Math table talk Oliver Knill, 10/18/2016 Networks and Matrices Assume you have three friends who do not know each other. This defines a network containing 4 nodes in which
More informationRiemann Hypotheses. Alex J. Best 4/2/2014. WMS Talks
Riemann Hypotheses Alex J. Best WMS Talks 4/2/2014 In this talk: 1 Introduction 2 The original hypothesis 3 Zeta functions for graphs 4 More assorted zetas 5 Back to number theory 6 Conclusion The Riemann
More informationRandomness in Number Theory
Randomness in Number Theory Peter Sarnak Mahler Lectures 2011 Number Theory Probability Theory Whole numbers Random objects Prime numbers Points in space Arithmetic operations Geometries Diophantine equations
More informationPotentially useful reading Sakurai and Napolitano, sections 1.5 (Rotation), Schumacher & Westmoreland chapter 2
Problem Set 2: Interferometers & Random Matrices Graduate Quantum I Physics 6572 James Sethna Due Friday Sept. 5 Last correction at August 28, 2014, 8:32 pm Potentially useful reading Sakurai and Napolitano,
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationSize Effect of Diagonal Random Matrices
Abstract Size Effect of Diagonal Random Matrices A.A. Abul-Magd and A.Y. Abul-Magd Faculty of Engineering Science, Sinai University, El-Arish, Egypt The statistical distribution of levels of an integrable
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationFinite Models for Arithmetical Quantum Chaos
Finite Models for Arithmetical Quantum Chaos Audrey Terras Math. Dept., U.C.S.D., San Diego, Ca 92093-0112 Abstract. Physicists have long studied spectra of Schrödinger operators and random matrices thanks
More informationModelling large values of L-functions
Modelling large values of L-functions How big can things get? Christopher Hughes Exeter, 20 th January 2016 Christopher Hughes (University of York) Modelling large values of L-functions Exeter, 20 th January
More informationCourse : Algebraic Combinatorics
Course 18.312: Algebraic Combinatorics Lecture Notes #29-31 Addendum by Gregg Musiker April 24th - 29th, 2009 The following material can be found in several sources including Sections 14.9 14.13 of Algebraic
More informationEigenvalue statistics and lattice points
Eigenvalue statistics and lattice points Zeév Rudnick Abstract. One of the more challenging problems in spectral theory and mathematical physics today is to understand the statistical distribution of eigenvalues
More informationFirst, we review some important facts on the location of eigenvalues of matrices.
BLOCK NORMAL MATRICES AND GERSHGORIN-TYPE DISCS JAKUB KIERZKOWSKI AND ALICJA SMOKTUNOWICZ Abstract The block analogues of the theorems on inclusion regions for the eigenvalues of normal matrices are given
More informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationChapter 29. Quantum Chaos
Chapter 29 Quantum Chaos What happens to a Hamiltonian system that for classical mechanics is chaotic when we include a nonzero h? There is no problem in principle to answering this question: given a classical
More informationRandom matrices and the Riemann zeros
Random matrices and the Riemann zeros Bruce Bartlett Talk given in Postgraduate Seminar on 5th March 2009 Abstract Random matrices and the Riemann zeta function came together during a chance meeting between
More informationUniversality for random matrices and log-gases
Universality for random matrices and log-gases László Erdős IST, Austria Ludwig-Maximilians-Universität, Munich, Germany Encounters Between Discrete and Continuous Mathematics Eötvös Loránd University,
More informationIntroduction to Theory of Mesoscopic Systems
Introduction to Theory of Mesoscopic Systems Boris Altshuler Princeton University, Columbia University & NEC Laboratories America Lecture 3 Beforehand Weak Localization and Mesoscopic Fluctuations Today
More informationGeometry and analysis on hyperbolic manifolds
Outline Geometry and analysis on hyperbolic manifolds Yiannis Petridis 1,2 1 The Graduate Center and Lehman College City University of New York 2 Max-Planck-Institut für Mathematik, Bonn April 20, 2005
More informationDISTINGUISHING GRAPHS WITH ZETA FUNCTIONS AND GENERALIZED SPECTRA
DISTINGUISHING GRAPHS WITH ZETA FUNCTIONS AND GENERALIZED SPECTRA CHRISTINA DURFEE AND KIMBALL MARTIN ABSTRACT Conjecturally, almost all graphs are determined by their spectra This problem has also been
More informationFORMULAE FOR ZETA FUNCTIONS FOR INFINITE GRAPHS. Mark Pollicott University of Warwick
FORMULAE FOR ZETA FUNCTIONS FOR INFINITE GRAPHS Mark Pollicott University of Warwick 0. Introduction Given a connected finite d-regular graph G (for d 3) one can associate the Ihara zeta function G (z),
More informationHomework 1 Elena Davidson (B) (C) (D) (E) (F) (G) (H) (I)
CS 106 Spring 2004 Homework 1 Elena Davidson 8 April 2004 Problem 1.1 Let B be a 4 4 matrix to which we apply the following operations: 1. double column 1, 2. halve row 3, 3. add row 3 to row 1, 4. interchange
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationRandomness in Number Theory *
Randomness in Number Theory * Peter Sarnak Asia Pacific Mathematics Newsletter Number Theory Probability Theory Mahler (953): Whole numbers Random objects Prime numbers Points in space Arithmetic operations
More informationarxiv:cond-mat/ v1 [cond-mat.stat-mech] 13 Mar 2003
arxiv:cond-mat/0303262v1 [cond-mat.stat-mech] 13 Mar 2003 Quantum fluctuations and random matrix theory Maciej M. Duras Institute of Physics, Cracow University of Technology, ulica Podchor ażych 1, PL-30084
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationZeta functions of buildings and Shimura varieties
Zeta functions of buildings and Shimura varieties Jerome William Hoffman January 6, 2008 0-0 Outline 1. Modular curves and graphs. 2. An example: X 0 (37). 3. Zeta functions for buildings? 4. Coxeter systems.
More informationORIGINS. E.P. Wigner, Conference on Neutron Physics by Time of Flight, November 1956
ORIGINS E.P. Wigner, Conference on Neutron Physics by Time of Flight, November 1956 P.W. Anderson, Absence of Diffusion in Certain Random Lattices ; Phys.Rev., 1958, v.109, p.1492 L.D. Landau, Fermi-Liquid
More informationClass President: A Network Approach to Popularity. Due July 18, 2014
Class President: A Network Approach to Popularity Due July 8, 24 Instructions. Due Fri, July 8 at :59 PM 2. Work in groups of up to 3 3. Type up the report, and submit as a pdf on D2L 4. Attach the code
More informationThe Ihara zeta function of the infinite grid
The Ihara zeta function of the infinite grid Bryan Clair Department of Mathematics and Computer Science Saint Louis University bryan@slu.edu November 3, 2013 An Integral I(k) = 1 2π 2π (2π) 2 log [ 1 k
More informationThe Structure of the Jacobian Group of a Graph. A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College
The Structure of the Jacobian Group of a Graph A Thesis Presented to The Division of Mathematics and Natural Sciences Reed College In Partial Fulfillment of the Requirements for the Degree Bachelor of
More informationLecture 12 : Graph Laplacians and Cheeger s Inequality
CPS290: Algorithmic Foundations of Data Science March 7, 2017 Lecture 12 : Graph Laplacians and Cheeger s Inequality Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Graph Laplacian Maybe the most beautiful
More informationarxiv:nlin/ v1 [nlin.cd] 8 Jan 2001
The Riemannium P. Leboeuf, A. G. Monastra, and O. Bohigas Laboratoire de Physique Théorique et Modèles Statistiques, Bât. 100, Université de Paris-Sud, 91405 Orsay Cedex, France Abstract arxiv:nlin/0101014v1
More informationUniversality of local spectral statistics of random matrices
Universality of local spectral statistics of random matrices László Erdős Ludwig-Maximilians-Universität, Munich, Germany CRM, Montreal, Mar 19, 2012 Joint with P. Bourgade, B. Schlein, H.T. Yau, and J.
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationDeterminant of the Schrödinger Operator on a Metric Graph, by Leonid Friedlander, University of Arizona. 1. Introduction
Determinant of the Schrödinger Operator on a Metric Graph, by Leonid Friedlander, University of Arizona 1. Introduction Let G be a metric graph. This means that each edge of G is being considered as a
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationPrimes go Quantum: there is entanglement in the primes
Primes go Quantum: there is entanglement in the primes Germán Sierra In collaboration with José Ignacio Latorre Madrid-Barcelona-Singapore Workshop: Entanglement Entropy in Quantum Many-Body Systems King's
More informationPRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE. R. B. Bapat and S. Sivasubramanian
PRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE R B Bapat and S Sivasubramanian Let G be a strongly connected, weighted directed graph We define a product distance η(i, j) for
More informationThe Prime Unsolved Problem in Mathematics
The Prime Unsolved Problem in Mathematics March, 0 Augustana Math Club 859: Bernard Riemann proposes the Riemann Hypothesis. 859: Bernard Riemann proposes the Riemann Hypothesis. 866: Riemann dies at age
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationTo appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.
To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? DE-JUN FENG, SU HUA, AND YUAN JI Abstract. Let U λ be the union of two unit intervals
More informationReachability of recurrent positions in the chip-firing game
Egerváry Research Group on Combinatorial Optimization Technical reports TR-2015-10. Published by the Egerváry Research Group, Pázmány P. sétány 1/C, H 1117, Budapest, Hungary. Web site: www.cs.elte.hu/egres.
More informationOn the concentration of eigenvalues of random symmetric matrices
On the concentration of eigenvalues of random symmetric matrices Noga Alon Michael Krivelevich Van H. Vu April 23, 2012 Abstract It is shown that for every 1 s n, the probability that the s-th largest
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
More informationSUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS
SUB-EXPONENTIALLY MANY 3-COLORINGS OF TRIANGLE-FREE PLANAR GRAPHS Arash Asadi Luke Postle 1 Robin Thomas 2 School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT
More informationHOMEWORK #2 - MATH 3260
HOMEWORK # - MATH 36 ASSIGNED: JANUARAY 3, 3 DUE: FEBRUARY 1, AT :3PM 1) a) Give by listing the sequence of vertices 4 Hamiltonian cycles in K 9 no two of which have an edge in common. Solution: Here is
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2016 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationPreparing for the CSET. Sample Book. Mathematics
Preparing for the CSET Sample Book Mathematics by Jeff Matthew Dave Zylstra Preparing for the CSET Sample Book Mathematics We at CSETMath want to thank you for interest in Preparing for the CSET - Mathematics.
More informationUniversality. Why? (Bohigas, Giannoni, Schmit 84; see also Casati, Vals-Gris, Guarneri; Berry, Tabor)
Universality Many quantum properties of chaotic systems are universal and agree with predictions from random matrix theory, in particular the statistics of energy levels. (Bohigas, Giannoni, Schmit 84;
More informationRings, Paths, and Paley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in
More informationIs Quantum Mechanics Chaotic? Steven Anlage
Is Quantum Mechanics Chaotic? Steven Anlage Physics 40 0.5 Simple Chaos 1-Dimensional Iterated Maps The Logistic Map: x = 4 x (1 x ) n+ 1 μ n n Parameter: μ Initial condition: 0 = 0.5 μ 0.8 x 0 = 0.100
More informationRecent results in quantum chaos and its applications to nuclei and particles
Recent results in quantum chaos and its applications to nuclei and particles J. M. G. Gómez, L. Muñoz, J. Retamosa Universidad Complutense de Madrid R. A. Molina, A. Relaño Instituto de Estructura de la
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationarxiv:chao-dyn/ v1 3 Jul 1995
Chaotic Spectra of Classically Integrable Systems arxiv:chao-dyn/9506014v1 3 Jul 1995 P. Crehan Dept. of Mathematical Physics, University College Dublin, Belfield, Dublin 2, Ireland PCREH89@OLLAMH.UCD.IE
More informationCounting Cycles in Strongly Connected Graphs
Proceeding Series of the Brazilian Society of Applied and Computational Mathematics, Vol. 3,., 205. Trabalho apresentado no XXXV CMAC, atal-r, 204. Counting Cycles in Strongly Connected Graphs G. A. T.
More informationNew skew Laplacian energy of a simple digraph
New skew Laplacian energy of a simple digraph Qingqiong Cai, Xueliang Li, Jiangli Song arxiv:1304.6465v1 [math.co] 24 Apr 2013 Center for Combinatorics and LPMC-TJKLC Nankai University Tianjin 300071,
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationExponentials of Symmetric Matrices through Tridiagonal Reductions
Exponentials of Symmetric Matrices through Tridiagonal Reductions Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A simple and efficient numerical algorithm
More information14 Singular Value Decomposition
14 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing
More informationSpectral Theorem for Self-adjoint Linear Operators
Notes for the undergraduate lecture by David Adams. (These are the notes I would write if I was teaching a course on this topic. I have included more material than I will cover in the 45 minute lecture;
More informationQuantum Field Theory III
Quantum Field Theory III Prof. Erick Weinberg January 19, 2011 1 Lecture 1 1.1 Structure We will start with a bit of group theory, and we will talk about spontaneous symmetry broken. Then we will talk
More informationLectures about Python, useful both for beginners and experts, can be found at (http://scipy-lectures.github.io).
Random Matrix Theory (Sethna, "Entropy, Order Parameters, and Complexity", ex. 1.6, developed with Piet Brouwer) 2016, James Sethna, all rights reserved. This is an ipython notebook. This hints file is
More informationMatching Polynomials of Graphs
Spectral Graph Theory Lecture 25 Matching Polynomials of Graphs Daniel A Spielman December 7, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class The notes
More informationRelationships between the Completion Problems for Various Classes of Matrices
Relationships between the Completion Problems for Various Classes of Matrices Leslie Hogben* 1 Introduction A partial matrix is a matrix in which some entries are specified and others are not (all entries
More information