UPPER BOUNDS FOR EIGENVALUES OF THE DISCRETE AND CONTINUOUS LAPLACE OPERATORS
|
|
- Avis McDonald
- 5 years ago
- Views:
Transcription
1 UPPER BOUNDS FOR EIGENVALUES OF THE DISCRETE AND CONTINUOUS LAPLACE OPERATORS F. R. K. Chung University of Pennsylvania, Philadelphia, Pennsylvania 904 A. Grigor yan Imperial College, London, SW7 B UK S.-T. au Harvard University, Cambridge, Massachusetts 038 Introduction In this paper, we are concerned with upper bounds of eigenvalues of Laplace operator on compact Riemannian manifolds and finite graphs. While on the former the Laplace operator is generated by the Riemannian metric, on the latter it reflects combinatorial structure of a graph. Respectively, eigenvalues have many applications in geometry as well as in combinatorics and in other fields of mathematics. We develop a universal approach to upper bounds on both continuous and discrete structures based upon certain properties of the corresponding heat kernel. This approach is perhaps much more general than its realization here. Basically, we start with the following entries: an underlying space M with a finite measure µ; a well-defined Laplace operator on functions on M so that is a self-adjoint operator in L (M,µ) with a discrete spectrum; 3 if M has a boundary, then the boundary condition should be chosen so that it does not disrupt self-adjointness of and is of dissipative nature; 4 a distance function dist(x, y) onm so that dist for an appropriate notion of gradient. Let λ i,i=0,,, denote the i-th eigenvalue of sothat0=λ 0 λ λ i. Then one of our results states that for any pair of disjoint subsets, M λ 4 µm log dist(, ) µµ (0.) We want to emphasize that validity of (0.) does not depend on any a priori assumption on M which would restrict its geometry except compactness. A similar inequality holds in general for the difference λ i λ 0 for any i. Let us note that the most non-trivial term in (0.) is a logarithm on the right hand side. In fact, the logarithm comes from a Gaussian exponential term which enters normally heat kernel upper bounds. A similar inequality for λ i can be proved involving distances among Chung F.R.K., Grigor yan A., au S.-T., Upper bounds for eigenvalues of the discrete and continuous Laplace operators, Advances in Math., 7 (996)
2 k disjoint sets by constructing cutoff functions (close to the indicators of the sets, ) and by using them as trial functions in the minimax property of the eigenvalues. Let M denote now a graph with a combinatorial Laplacian. We will prove the following inequality. For any two vertex subsets, of a graph on n vertices which is not a complete graph, we will relate λ to the least distance between a vertex in to a vertex in as follows: dist(, ) log µm µµ log λ (0.) where λ = λ if λ λ n andλ = (λ n λ )/ otherwise. Note that, in general λ λ /. Here, for example, µ can denote the sum of degrees of vertices of and dist(, ) denotes the length of a shortest path joining a vertex in and a vertex in. This is best possible within a constant factor for expander graphs with degree k and λ = O(/ k). In general, we have λ log λ log µm µµ dist(, ) for any two subsets, of the vertex set of the graph. We note the inequality (0.) generalizes an earlier result in [] (also see [4] ): log(n ) diamm log λ Special cases of (0.) for regular graphs were investigated by Kahale in [7]. For subsets i, i =0,,,k, the distance among i is defined to be the least distance dist( i, j ) for i j. We will generalize (0.) by relating λ k to the distance among k + subsets of the vertex set. Namely, min dist( log i, j ) max i j i j µ i µ j µ i µ j log λ k where λ k = λ k if λ k λ n andλ k = (λ n λ k )/, otherwise. In the next Section we prove our main results for the continuous case of manifolds. The discrete cases for graphs will be considered in Section with similar but different and simpler proofs. A more general setting will be considered in [0]. Eigenvalues on manifolds Let M be a smooth connected compact Riemannian manifold and be a Laplace operator associated with the Riemannian metric i.e. in coordinates x,x,...x n u = g n i,j= ij u gg x i x j
3 3 where g ij are contra-variant components of the metric tensor and g =det g ij and u is a smooth function on M. We admit that the manifold M has a boundary M. If this is the case, we introduce a boundary condition αu + β u =0 (.) ν where α(x),β(x) are non-negative smooth functions on M such that α(x) + β(x) > 0for all x M. For example, both Dirichlet and Neumann boundary conditions suit these assumptions. We note that the Laplace operator with the boundary condition (.) is self-adjoint and has a discrete spectrum in L (M,µ), where µ is the Riemannian measure; the condition (.) implies u u ν 0 where ν is the outer normal field on M. Let us introduce also a distance function dist(x, y) onm M which may be equal to the geodesic distance, but in general we shall not assume so. Other than being a distance function the function, dist(x, y) must be Lipschitz and, moreover, for all x, y M dist(x, y). Let us denote by Φ i the eigenfunction corresponding to the i-th eigenvalue λ i and normalized in L M,µ so that {Φ i } is an orthonormal frame in L (M,µ). Theorem. Suppose that we have chosen k +disjoint subsets,,... k+ of M such that the distance between any pair of them is at least D>0. Then for any k> λ k λ 0 D max log i j i Φ 0 4 j Φ 0 (.) We remark that, for example, if either the manifold has no boundary or the Neumann boundary condition has been chosen the first eigenvalue is 0 and the first eigenfunction is the constant Φ 0 = µm An immediate consequence of Theorem. is that for any k> λ k 4 D max µm log µi µ j i j Proof of Theorem.: The proof is based upon two fundamental facts about the heat kernel p(x, y, t) being by definition the unique fundamental solution to the heat equation u u(x, t) u(x, t) =0 t
4 4 with the boundary condition (.) if the boundary M is non-empty. The first fact is the eigenfunction expansion p(x, y, t) = e λit Φ i (x)φ i (y) (.3) i=0 and the second is the following universal estimate: p(x, y, t)f(x)g(y)µ(dx)µ(dy) f g exp D 4t λ 0t (.4) which is true for any functions f,g L (M,µ) and for any two disjoint Borel sets, M where D =dist(, ). An inequality of type (.4) appeared first in the paper by B.Davies [5] and [8] (on page 73). It was improved in [6] by introducing the term λ 0 t in the exponent on the right-hand side of (.4). The previous papers treated slightly different situations (for example, without a boundary) and this is why we will show at the end of this Section how to prove (.4). Let us explain first the main idea behind the proof of the Theorem. in a particular case k =. We start with integrating the eigenvalue expansion (.3) as follows I(f,g) p(x, y, t)f(x)g(y)µ(dx)µ(dy)= e λ it fφ i gφ i (.5) Let us denote by f i the Fourier coefficients of the function f with respect to the frame {Φ i } and by g i -thatofg. Then I(f,g)=e λ 0t f 0 g 0 + i=0 e λit f i g i e λ0t f 0 g 0 e λt f g (.6) i= whereweusedthefactthat e λit f i g i e λ t i= i= f i i= g i e λ t f g. By comparing (.6) and (.4) we get exp( (λ λ 0 )) f g f 0 g 0 f g exp D. (.7) 4t Let us choose t so that the second term on the right-hand side (.7) is equal to one half of the first one (here we take advantage of the Gaussian exponential since it can be made arbitrarily close to 0 by taking t small enough): t = D. 4log f g f 0 g 0 For this t, wehave exp( (λ λ 0 )) f g f 0g 0
5 which implies 5 λ λ 0 t log f g f 0 g 0 and after substituting the value of t, wehave λ λ 0 4 D log f g f 0 g 0 Finally, we choose f = g =Φ 0 and taking into account that f 0 = fφ 0 = Φ 0, and f = and similar identities hold for g we obtain Φ 0 = f0 λ λ 0 4 log D Φ 0 Φ 0 Now we turn to the general case k>. Let us consider a function f(x) and denote by f j i the i-th Fourier coefficient of the function f j i.e. f j i = j fφ i. Let us put also in analogy to the case k = I lm (f,f) = p(x, y, t)f(x)f(y)µ(dx)µ(dy), m l then we have the upper bound for I lm (f,f) I lm (f,f) f l f m exp D 4t λ 0t (.8) while we rewrite the lower bound (.6) in another way: I lm (f,f) e λ 0t f l 0 f m 0 e λit fi l f i m e λkt f l f m (.9) + k i= Now we want to kill the middle term on the right-hand side (.9) by choosing appropriate l and m. To that end, let us consider k + vectors f m =(f m,fm,,fm k ),m =,,,k + in R k and let us supply this (k )-dimensional space with a scalar product given by k (v, w) = v i w i e λi+t. i=0
6 6 We suppose that we have chosen a value of t from the very beginning so t will not vary (although the optimal value of t will be found later). Let us apply the following elementary fact: out of any k + vectors in (k )-dimensional Euclidean space there are always two vectors with non-negative scalar product (see the end of this section for the proof). Therefore, we can find different l, m so that (f l,f m ) 0 and due to that choice we are able to cancel the second term on the right-hand side (.9). Comparing (.8) and (.9) we get e (λ k λ 0 )t f l f m f l 0 f m 0 f l f m exp D (.0) 4t Now, similar to the case k =wechooset so that the right-hand side is at least f l 0f m 0. Since t must be independent on l, m we put simply and obtain from (.0) t =min l m D 4log f l f m f l 0 f m 0 λ k λ 0 t log f l f m f l 0 f m 0 whence (.) follows by substituting t from above and by taking f =Φ 0. Now we will prove two auxiliary facts used in the course of the proof of Theorem.. Lemma. For any two Borel sets, M and for any functions f,g L (M,µ) we have: where D =dist(, ). p(x, y, t)f(x)g(y)µ(dx)µ(dy) f g exp D 4t λ t Proof of Lemma.: Let us put u(x, t) = p(x, y, t)g(y)µ(dy) then u(x, t) is a solution to the heat equation u t = u with the initial data u(x, 0) = g and with the boundary condition (.). As was shown in [6], for any Lipschitz function ξ(x, t) such that for all x M,t > 0 ξ t + ξ 0 the integral e λ 0t M u e ξ(x,t) µ(dx)
7 7 is a decreasing function of t. Actually, this was proved for the Dirichlet boundary value problem but the proof used only that u u ν 0 that is true in our setting. Let us put ξ(x, t) = d (x) (t + ε) where d(x) dist(x, ) andε>0. Then e λ 0t u (x, t)e ξ(x,t) µ(dx) u (x, 0)e ξ(x,0) µ(dx) or, taking into account that u(x, 0) = g,ξ =0, and ξ D (t+ε) and letting ε 0 we get u (x, t)µ(dx) exp D t λ 0t g (x)µ(dx). Finally, we obtain upon an application of the Cauchy-Schwarz inequality p(x, y, t)f(x)g(y)µ(dx)µ(dy)= u(x, t)f(x)µ(dx) f f M u (x, t) g exp D 4t λ 0t what was to be proved. Now let us prove the next geometric lemma. Lemma. Let E be an n-dimensional Euclidean space and v,v,,v n+ be n + arbitrary vectors in E. Then there are two of them, say, v i,v j (where i j ) such that (v i,v j ) 0 where (, ) denotes the scalar product in E. Proof of Lemma.: For n = this is obvious. Let us prove the inductive step from n to n. Suppose that for each pair of the given vectors their scalar product is negative. Let E be a hyperplane orthogonal to v n+ and let v i be a projection of v i on E,i=,,...n +. We claim that (v i,v j ) < 0providedi j. Indeed, since (v i,v n+ ) < 0 (where we assume i n + ) all vectors v i lie on the same half-space with respect to E which implies that each of them is represented in the form v i = v i + a i e where a i > 0ande is a unit vector orthogonal to E and directed to the same half-space as all v i. Hence, we have 0 > (v i,v j )=(v i a i e, v j a j e)=(v i,v j )+a i a j whence (v i,v j ) < 0 follows. On the other hand, by the induction hypothesis out of n + vectors v i,i=,,...n + in the (n ) -dimensional space E there are two vectors with non-negative scalar product. This contradiction proves the lemma.
8 Eigenvalues on graphs 8 Let G denote a graph on vertex set V (G) andedgesete(g). For a vertex v, the degree of v is denoted by d v and for a subset of V (G), we define the volume of to be µ = x d x The Laplacian of the graph is defined to be L(x, y) = if x = y; if x y 0 otherwise dx d y Suppose L has eigenvalues λ 0 =0 λ λ n where n = V (G). Then [f(x) f(y)] λ =inf f x y x f (x)d x where f ranges over functions satisfying f(x)d x =0. x Let T be an n n function with the (x, x)-entry of value d x.thent / is the eigenfunction associated with eigenvalue 0 where denotes the function with all entries. It is not difficult to see that λ for any graph which is not a complete graph and <λ n. More discussions on the eigenvalues λ i can be found in [3]. Let denote the complement of in V (G). Theorem. Suppose G is not a complete graph. For, V (G), wehave dist(, ) µ µȳ log µ µ log λ where λ = λ if λ λ n and λ = (λ n λ )/ otherwise. Proof: For V (G), we define f (x) = { if x 0 otherwise If we can show that for some integer t and a polynomial p t (z) ofdegreet, T / f,p t (L)(T / f ) > 0 (.) then there is a path of length at most t joining a vertex in toavertexin. Therefore we have dist(, ) t. Let a i denote the Fourier coefficient of T / f, i.e.,
9 9 n T / f = a i ϕ i i=0 where ϕ i s are eigenfunctions of L. Inparticular,wehave Similarly, we write a 0 = T / f,t / T /,T / = µ T / T / f = n i=0 b i ϕ i We choose { ( z) t if λ λ n ; p t (z) = ( (λ +λ n ) z) t otherwise Since G is not a complete graph, λ λ n and for all i =,,n. Therefore we have p t (λ i ) ( λ) t T / f,p t (L)T / f = a 0 b 0 + i>0 p t (λ i )a i b i >a 0 b 0 ( λ) t i>0 a i = µ µ i>0 b i ( λ) t µ µ µ µ Ȳ Note that If we choose we have Therefore we have i>0 a i = T / f (µ) = µ µ t log µ µȳ µ µ log λ T / f,p t (L)T / f > 0 dist(, ) t.
10 0 To improve the inequality in some cases, we use the same approach as in [4] by considering the Chebychev polynomials of the first kind. T 0 (z) =, T (z) =z, T t+ (z) =zt t (z) T t (z), for integer t>. Or, equivalently, T t (z) =cosh(t cosh (z)). In the place of p t (L), we will use S t (L) where S t (x) = T t( λ +λ n x λ n λ ) T t ( λ n +λ λ n λ ) Then we have Suppose we take Then we have max x [λ,λ n ] S t(λ ) t cosh µ µȳ µ µ cosh λ n +λ λ n λ T t ( λ n +λ λ n λ ) T / f,s t (L)T / f > 0 Theorem. Suppose G is not a complete graph. For, V (G), wehave dist(, ) cosh µ µȳ µ µ cosh λ n +λ λ n λ We can easily derive isoperimetric inequalities by using (.). These isoperimetric inequalities are generalizations of the inqualities concerning vertex or edge expansion in Tanner [9] and in Alon and Miller [] for regular graphs. For a subset V, we define the s-neighborhood of by N s () ={y :dist(x, y) s, for some x } Suppose we choose = V N s () in (.). Theorem. implies the following result which gives a lower bound for the expansion of the neighborhood. µn t () µ µ µ +( )( λ)(t ) Theorem. can be generalized for the case of relating the distance of k + disjoint subsets of vertices and the eigenvalues λ k. The line of proof is quite similar to that in Section.
11 Theorem.3 have Suppose G is not a complete graph. For i V (G),i =0,,,k,we µ i µ min dist( log j µ i, j ) max i µ j i j i j log λ k where λ k = λ k if λ k λ n and λ k = (λ n λ k )/ otherwise. Proof: There exist two distinct subsets in i s, denoted by and, satisfying k T / f,p t (L)T / f a 0 b 0 + p t (λ i )a i b i + p t (λ i )a i b i i k > µ µ i= ( λ k )t µ µ µ µ Ȳ by using Lemma. and by associating to each a vector (p t (λ ) / a,,p t (λ k ) / a k ) where f = a i ϕ i. REFERENCES [] N. Alon and V. D. Milman, λ isoperimetric inequalities for graphs and superconcentrators, J. Comb. Theory B 38 (985), [] F. R. K. Chung, Diameters and eigenvalues, J. of AMS,(989),87-96 [3] F.R.K.Chung,Spectral Graph Theory, CBMS Lecture Notes, AMS publication, 995. [4] F. R. K. Chung, V. Faber and Thomas A. Manteuffel, On the diameter of a graph from eigenvalues associated with its Laplacian, SIAM J. of Discrete Math.(994) [5] E. B. Davies, Heat kernel bounds, conservation of probability and the Feller property, J. d Analyse Math. 58, (99), 99-9 [6] A. Grigor yan, Integral maximum principle and its applications, Proc. of Edinburgh Royal Society 4A, (994), [7] Nabile Kahale, Isoperimetric inequalities and eigenvalues, preprint [8] Peter Li and S. T. au, On the parabolic kernel of the Schrödinger operator, Acta Mathematica 56, (986) 53-0 [9] R.M. Tanner, Explicit construction of concentrators from generalized N-gons, SIAM J. Algebraic Discrete Methods 5 (984) [0] F. R. K. Chung, A. Grigor yan and S.-T. au, Eigenvalues and diameters for manifolds and graphs, preprint.
Diameters and eigenvalues
CHAPTER 3 Diameters and eigenvalues 31 The diameter of a graph In a graph G, the distance between two vertices u and v, denoted by d(u, v), is defined to be the length of a shortest path joining u and
More informationEigenvalues of graphs
Eigenvalues of graphs F. R. K. Chung University of Pennsylvania Philadelphia PA 19104 September 11, 1996 1 Introduction The study of eigenvalues of graphs has a long history. From the early days, representation
More informationLogarithmic Harnack inequalities
Logarithmic Harnack inequalities F. R. K. Chung University of Pennsylvania Philadelphia, Pennsylvania 19104 S.-T. Yau Harvard University Cambridge, assachusetts 02138 1 Introduction We consider the relationship
More informationON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS
Bendikov, A. and Saloff-Coste, L. Osaka J. Math. 4 (5), 677 7 ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS ALEXANDER BENDIKOV and LAURENT SALOFF-COSTE (Received March 4, 4)
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationGradient Estimates and Sobolev Inequality
Gradient Estimates and Sobolev Inequality Jiaping Wang University of Minnesota ( Joint work with Linfeng Zhou) Conference on Geometric Analysis in honor of Peter Li University of California, Irvine January
More informationHeat Kernels on Manifolds, Graphs and Fractals
Heat Kernels on Manifolds, Graphs and Fractals Alexander Grigor yan Abstract. We consider heat kernels on different spaces such as Riemannian manifolds, graphs, and abstract metric measure spaces including
More informationHeat Kernel and Analysis on Manifolds Excerpt with Exercises. Alexander Grigor yan
Heat Kernel and Analysis on Manifolds Excerpt with Exercises Alexander Grigor yan Department of Mathematics, University of Bielefeld, 33501 Bielefeld, Germany 2000 Mathematics Subject Classification. Primary
More informationPseudo-Poincaré Inequalities and Applications to Sobolev Inequalities
Pseudo-Poincaré Inequalities and Applications to Sobolev Inequalities Laurent Saloff-Coste Abstract Most smoothing procedures are via averaging. Pseudo-Poincaré inequalities give a basic L p -norm control
More informationSpectral Geometry of Riemann Surfaces
Spectral Geometry of Riemann Surfaces These are rough notes on Spectral Geometry and their application to hyperbolic riemann surfaces. They are based on Buser s text Geometry and Spectra of Compact Riemann
More informationKernel Method: Data Analysis with Positive Definite Kernels
Kernel Method: Data Analysis with Positive Definite Kernels 2. Positive Definite Kernel and Reproducing Kernel Hilbert Space Kenji Fukumizu The Institute of Statistical Mathematics. Graduate University
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationSPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS
SPECTRAL PROPERTIES OF THE LAPLACIAN ON BOUNDED DOMAINS TSOGTGEREL GANTUMUR Abstract. After establishing discrete spectra for a large class of elliptic operators, we present some fundamental spectral properties
More informationEigenvalues and eigenfunctions of the Laplacian. Andrew Hassell
Eigenvalues and eigenfunctions of the Laplacian Andrew Hassell 1 2 The setting In this talk I will consider the Laplace operator,, on various geometric spaces M. Here, M will be either a bounded Euclidean
More informationEigenvalue comparisons in graph theory
Eigenvalue comparisons in graph theory Gregory T. Quenell July 1994 1 Introduction A standard technique for estimating the eigenvalues of the Laplacian on a compact Riemannian manifold M with bounded curvature
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationarxiv:math/ v1 [math.dg] 7 Jun 2004
arxiv:math/46v [math.dg] 7 Jun 4 The First Dirichlet Eigenvalue and Li s Conjecture Jun LING Abstract We give a new estimate on the lower bound for the first Dirichlet eigenvalue for the compact manifolds
More informationManifold Regularization
9.520: Statistical Learning Theory and Applications arch 3rd, 200 anifold Regularization Lecturer: Lorenzo Rosasco Scribe: Hooyoung Chung Introduction In this lecture we introduce a class of learning algorithms,
More informationRichard F. Bass Krzysztof Burdzy University of Washington
ON DOMAIN MONOTONICITY OF THE NEUMANN HEAT KERNEL Richard F. Bass Krzysztof Burdzy University of Washington Abstract. Some examples are given of convex domains for which domain monotonicity of the Neumann
More informationMeasurable Choice Functions
(January 19, 2013) Measurable Choice Functions Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/choice functions.pdf] This note
More informationSecond Order Elliptic PDE
Second Order Elliptic PDE T. Muthukumar tmk@iitk.ac.in December 16, 2014 Contents 1 A Quick Introduction to PDE 1 2 Classification of Second Order PDE 3 3 Linear Second Order Elliptic Operators 4 4 Periodic
More informationOn the bang-bang property of time optimal controls for infinite dimensional linear systems
On the bang-bang property of time optimal controls for infinite dimensional linear systems Marius Tucsnak Université de Lorraine Paris, 6 janvier 2012 Notation and problem statement (I) Notation: X (the
More informationSpectral Gap and Concentration for Some Spherically Symmetric Probability Measures
Spectral Gap and Concentration for Some Spherically Symmetric Probability Measures S.G. Bobkov School of Mathematics, University of Minnesota, 127 Vincent Hall, 26 Church St. S.E., Minneapolis, MN 55455,
More informationLECTURE 21: THE HESSIAN, LAPLACE AND TOPOROGOV COMPARISON THEOREMS. 1. The Hessian Comparison Theorem. We recall from last lecture that
LECTURE 21: THE HESSIAN, LAPLACE AND TOPOROGOV COMPARISON THEOREMS We recall from last lecture that 1. The Hessian Comparison Theorem K t) = min{kπ γt) ) γt) Π γt) }, K + t) = max{k Π γt) ) γt) Π γt) }.
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationDefinitions and Properties of R N
Definitions and Properties of R N R N as a set As a set R n is simply the set of all ordered n-tuples (x 1,, x N ), called vectors. We usually denote the vector (x 1,, x N ), (y 1,, y N ), by x, y, or
More informationContribution from: Springer Verlag Berlin Heidelberg 2005 ISBN
Contribution from: Mathematical Physics Studies Vol. 7 Perspectives in Analysis Essays in Honor of Lennart Carleson s 75th Birthday Michael Benedicks, Peter W. Jones, Stanislav Smirnov (Eds.) Springer
More informationOn positive solutions of semi-linear elliptic inequalities on Riemannian manifolds
On positive solutions of semi-linear elliptic inequalities on Riemannian manifolds Alexander Grigor yan University of Bielefeld University of Minnesota, February 2018 Setup and problem statement Let (M,
More informationSpectral diameter estimates for k-regular graphs
Spectral diameter estimates for k-regular graphs Gregory Quenell May 1992 An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of the adjacency matrix of a finite,
More informationNOTES ON KLEINER S PROOF OF GROMOV S POLYNOMIAL GROWTH THEOREM
NOTES ON KLEINER S PROOF OF GROMOV S POLYNOMIAL GROWTH THEOREM ROMAN SAUER Abstract. We present and explain Kleiner s new proof of Gromov s polynomial growth [Kle07] theorem which avoids the use of Montgomery-Zippin
More informationHarnack inequalities and Gaussian estimates for random walks on metric measure spaces. Mathav Murugan Laurent Saloff-Coste
Harnack inequalities and Gaussian estimates for random walks on metric measure spaces Mathav Murugan Laurent Saloff-Coste Author address: Department of Mathematics, University of British Columbia and Pacific
More information08a. Operators on Hilbert spaces. 1. Boundedness, continuity, operator norms
(February 24, 2017) 08a. Operators on Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 2016-17/08a-ops
More informationFormal Groups. Niki Myrto Mavraki
Formal Groups Niki Myrto Mavraki Contents 1. Introduction 1 2. Some preliminaries 2 3. Formal Groups (1 dimensional) 2 4. Groups associated to formal groups 9 5. The Invariant Differential 11 6. The Formal
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationCHAPTER VIII HILBERT SPACES
CHAPTER VIII HILBERT SPACES DEFINITION Let X and Y be two complex vector spaces. A map T : X Y is called a conjugate-linear transformation if it is a reallinear transformation from X into Y, and if T (λx)
More informationUniversal inequalities for eigenvalues. of elliptic operators in divergence. form on domains in complete. noncompact Riemannian manifolds
Theoretical athematics & Applications, vol.3, no., 03, 39-48 ISSN: 79-9687 print, 79-9709 online Scienpress Ltd, 03 Universal inequalities for eigenvalues of elliptic operators in divergence form on domains
More informationCMS winter meeting 2008, Ottawa. The heat kernel on connected sums
CMS winter meeting 2008, Ottawa The heat kernel on connected sums Laurent Saloff-Coste (Cornell University) December 8 2008 p(t, x, y) = The heat kernel ) 1 x y 2 exp ( (4πt) n/2 4t The heat kernel is:
More informationHeat kernels of some Schrödinger operators
Heat kernels of some Schrödinger operators Alexander Grigor yan Tsinghua University 28 September 2016 Consider an elliptic Schrödinger operator H = Δ + Φ, where Δ = n 2 i=1 is the Laplace operator in R
More informationTakens embedding theorem for infinite-dimensional dynamical systems
Takens embedding theorem for infinite-dimensional dynamical systems James C. Robinson Mathematics Institute, University of Warwick, Coventry, CV4 7AL, U.K. E-mail: jcr@maths.warwick.ac.uk Abstract. Takens
More informationGradient estimates for eigenfunctions on compact Riemannian manifolds with boundary
Gradient estimates for eigenfunctions on compact Riemannian manifolds with boundary Xiangjin Xu Department of athematics Johns Hopkins University Baltimore, D 21218 Abstract The purpose of this paper is
More informationIntroduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1
Chapter 1 Introduction Contents Motivation........................................................ 1.2 Applications (of optimization).............................................. 1.2 Main principles.....................................................
More informationLecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems
University of Warwick, EC9A0 Maths for Economists Peter J. Hammond 1 of 45 Lecture Notes 6: Dynamic Equations Part C: Linear Difference Equation Systems Peter J. Hammond latest revision 2017 September
More information[10] N. Kahale. Expander Graphs. PhD thesis, Massachusetts Institute of Technology, September
[10] N. Kahale. Expander Graphs. PhD thesis, Massachusetts Institute of Technology, September 1993. MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-591. [11] N. Kahale. Eigenvalues and
More informationThe oblique derivative problem for general elliptic systems in Lipschitz domains
M. MITREA The oblique derivative problem for general elliptic systems in Lipschitz domains Let M be a smooth, oriented, connected, compact, boundaryless manifold of real dimension m, and let T M and T
More information1 Directional Derivatives and Differentiability
Wednesday, January 18, 2012 1 Directional Derivatives and Differentiability Let E R N, let f : E R and let x 0 E. Given a direction v R N, let L be the line through x 0 in the direction v, that is, L :=
More informationWeighted Graph Laplacians and Isoperimetric Inequalities
Weighted Graph Laplacians and Isoperimetric Inequalities Fan Chung University of California, San Diego La Jolla, California 92093-0112 Kevin Oden Harvard University Cambridge, Massachusetts 02138 Abstract
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationIntroduction to Spectral Geometry
Chapter 1 Introduction to Spectral Geometry From P.-S. Laplace to E. Beltrami The Laplace operator was first introduced by P.-S. Laplace (1749 1827) for describing celestial mechanics (the notation is
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 informationNON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT
NON-UNIVERSALITY OF THE NAZAROV-SODIN CONSTANT Abstract. We prove that the Nazarov-Sodin constant, which up to a natural scaling gives the leading order growth for the expected number of nodal components
More informationNECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES
NECESSARY CONDITIONS FOR WEIGHTED POINTWISE HARDY INEQUALITIES JUHA LEHRBÄCK Abstract. We establish necessary conditions for domains Ω R n which admit the pointwise (p, β)-hardy inequality u(x) Cd Ω(x)
More informationThe p-laplacian and geometric structure of the Riemannian manifold
Workshop on Partial Differential Equation and its Applications Institute for Mathematical Sciences - National University of Singapore The p-laplacian and geometric structure of the Riemannian manifold
More informationWEYL S LEMMA, ONE OF MANY. Daniel W. Stroock
WEYL S LEMMA, ONE OF MANY Daniel W Stroock Abstract This note is a brief, and somewhat biased, account of the evolution of what people working in PDE s call Weyl s Lemma about the regularity of solutions
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationTHEODORE VORONOV DIFFERENTIABLE MANIFOLDS. Fall Last updated: November 26, (Under construction.)
4 Vector fields Last updated: November 26, 2009. (Under construction.) 4.1 Tangent vectors as derivations After we have introduced topological notions, we can come back to analysis on manifolds. Let M
More informationWave equation on manifolds and finite speed of propagation
Wave equation on manifolds and finite speed of propagation Ethan Y. Jaffe Let M be a Riemannian manifold (without boundary), and let be the (negative of) the Laplace-Beltrami operator. In this note, we
More informationUNIFORM BOUNDS FOR BESSEL FUNCTIONS
Journal of Applied Analysis Vol. 1, No. 1 (006), pp. 83 91 UNIFORM BOUNDS FOR BESSEL FUNCTIONS I. KRASIKOV Received October 8, 001 and, in revised form, July 6, 004 Abstract. For ν > 1/ and x real we shall
More informationFunctional Analysis. Martin Brokate. 1 Normed Spaces 2. 2 Hilbert Spaces The Principle of Uniform Boundedness 32
Functional Analysis Martin Brokate Contents 1 Normed Spaces 2 2 Hilbert Spaces 2 3 The Principle of Uniform Boundedness 32 4 Extension, Reflexivity, Separation 37 5 Compact subsets of C and L p 46 6 Weak
More informationData Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings
Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationThe spectral zeta function
The spectral zeta function Bernd Ammann June 4, 215 Abstract In this talk we introduce spectral zeta functions. The spectral zeta function of the Laplace-Beltrami operator was already introduced by Minakshisundaram
More informationDefinition and basic properties of heat kernels I, An introduction
Definition and basic properties of heat kernels I, An introduction Zhiqin Lu, Department of Mathematics, UC Irvine, Irvine CA 92697 April 23, 2010 In this lecture, we will answer the following questions:
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationMath 5520 Homework 2 Solutions
Math 552 Homework 2 Solutions March, 26. Consider the function fx) = 2x ) 3 if x, 3x ) 2 if < x 2. Determine for which k there holds f H k, 2). Find D α f for α k. Solution. We show that k = 2. The formulas
More information(x, y) = d(x, y) = x y.
1 Euclidean geometry 1.1 Euclidean space Our story begins with a geometry which will be familiar to all readers, namely the geometry of Euclidean space. In this first chapter we study the Euclidean distance
More informationImplicit Functions, Curves and Surfaces
Chapter 11 Implicit Functions, Curves and Surfaces 11.1 Implicit Function Theorem Motivation. In many problems, objects or quantities of interest can only be described indirectly or implicitly. It is then
More informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationMath 321 Final Examination April 1995 Notation used in this exam: N. (1) S N (f,x) = f(t)e int dt e inx.
Math 321 Final Examination April 1995 Notation used in this exam: N 1 π (1) S N (f,x) = f(t)e int dt e inx. 2π n= N π (2) C(X, R) is the space of bounded real-valued functions on the metric space X, equipped
More informationHilbert spaces. 1. Cauchy-Schwarz-Bunyakowsky inequality
(October 29, 2016) Hilbert spaces Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/fun/notes 2016-17/03 hsp.pdf] Hilbert spaces are
More informationASYMPTOTIC BEHAVIOR OF GENERALIZED EIGENFUNCTIONS IN N-BODY SCATTERING
ASYMPTOTIC BEHAVIOR OF GENERALIZED EIGENFUNCTIONS IN N-BODY SCATTERING ANDRAS VASY Abstract. In this paper an asymptotic expansion is proved for locally (at infinity) outgoing functions on asymptotically
More informationLiouville Properties for Nonsymmetric Diffusion Operators. Nelson Castañeda. Central Connecticut State University
Liouville Properties for Nonsymmetric Diffusion Operators Nelson Castañeda Central Connecticut State University VII Americas School in Differential Equations and Nonlinear Analysis We consider nonsymmetric
More informationNew Proof of Hörmander multiplier Theorem on compact manifolds without boundary
New Proof of Hörmander multiplier Theorem on compact manifolds without boundary Xiangjin Xu Department of athematics Johns Hopkins University Baltimore, D, 21218, USA xxu@math.jhu.edu Abstract On compact
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationi=1 α i. Given an m-times continuously
1 Fundamentals 1.1 Classification and characteristics Let Ω R d, d N, d 2, be an open set and α = (α 1,, α d ) T N d 0, N 0 := N {0}, a multiindex with α := d i=1 α i. Given an m-times continuously differentiable
More informationThe Dirichlet problem for non-divergence parabolic equations with discontinuous in time coefficients in a wedge
The Dirichlet problem for non-divergence parabolic equations with discontinuous in time coefficients in a wedge Vladimir Kozlov (Linköping University, Sweden) 2010 joint work with A.Nazarov Lu t u a ij
More informationContinuity. Matt Rosenzweig
Continuity Matt Rosenzweig Contents 1 Continuity 1 1.1 Rudin Chapter 4 Exercises........................................ 1 1.1.1 Exercise 1............................................. 1 1.1.2 Exercise
More informationV (v i + W i ) (v i + W i ) is path-connected and hence is connected.
Math 396. Connectedness of hyperplane complements Note that the complement of a point in R is disconnected and the complement of a (translated) line in R 2 is disconnected. Quite generally, we claim that
More informationChapter 1. Preliminaries. The purpose of this chapter is to provide some basic background information. Linear Space. Hilbert Space.
Chapter 1 Preliminaries The purpose of this chapter is to provide some basic background information. Linear Space Hilbert Space Basic Principles 1 2 Preliminaries Linear Space The notion of linear space
More informationSplines which are piecewise solutions of polyharmonic equation
Splines which are piecewise solutions of polyharmonic equation Ognyan Kounchev March 25, 2006 Abstract This paper appeared in Proceedings of the Conference Curves and Surfaces, Chamonix, 1993 1 Introduction
More informationON WEAKLY NONLINEAR BACKWARD PARABOLIC PROBLEM
ON WEAKLY NONLINEAR BACKWARD PARABOLIC PROBLEM OLEG ZUBELEVICH DEPARTMENT OF MATHEMATICS THE BUDGET AND TREASURY ACADEMY OF THE MINISTRY OF FINANCE OF THE RUSSIAN FEDERATION 7, ZLATOUSTINSKY MALIY PER.,
More informationA Faber-Krahn type inequality for regular trees
A Faber-Krahn type inequality for regular trees Josef Leydold leydold@statistikwu-wienacat Institut für Statistik, WU Wien Leydold 2003/02/13 A Faber-Krahn type inequality for regular trees p0/36 The Faber-Krahn
More informationarxiv: v1 [math.co] 27 Jul 2012
Harnack inequalities for graphs with non-negative Ricci curvature arxiv:1207.6612v1 [math.co] 27 Jul 2012 Fan Chung University of California, San Diego S.-T. Yau Harvard University May 2, 2014 Abstract
More informationDecomposition algorithms in Clifford algebras
Decomposition algorithms in Clifford algebras G. Stacey Staples 1 Department of Mathematics and Statistics Southern Illinois University Edwardsville Combinatorics and Computer Algebra Fort Collins, 2015
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More informationLECTURE 5: THE METHOD OF STATIONARY PHASE
LECTURE 5: THE METHOD OF STATIONARY PHASE Some notions.. A crash course on Fourier transform For j =,, n, j = x j. D j = i j. For any multi-index α = (α,, α n ) N n. α = α + + α n. α! = α! α n!. x α =
More informationarxiv: v1 [math.co] 14 Apr 2012
arxiv:1204.3168v1 [math.co] 14 Apr 2012 A brief review on geometry and spectrum of graphs 1 Introduction Yong Lin April 12, 2012 Shing-Tung Yau This is a survey paper. We study the Ricci curvature and
More informationList coloring hypergraphs
List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University
More informationAnalysis in weighted spaces : preliminary version
Analysis in weighted spaces : preliminary version Frank Pacard To cite this version: Frank Pacard. Analysis in weighted spaces : preliminary version. 3rd cycle. Téhéran (Iran, 2006, pp.75.
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationThe Hopf argument. Yves Coudene. IRMAR, Université Rennes 1, campus beaulieu, bat Rennes cedex, France
The Hopf argument Yves Coudene IRMAR, Université Rennes, campus beaulieu, bat.23 35042 Rennes cedex, France yves.coudene@univ-rennes.fr slightly updated from the published version in Journal of Modern
More informationTHE FUNDAMENTAL GROUP OF MANIFOLDS OF POSITIVE ISOTROPIC CURVATURE AND SURFACE GROUPS
THE FUNDAMENTAL GROUP OF MANIFOLDS OF POSITIVE ISOTROPIC CURVATURE AND SURFACE GROUPS AILANA FRASER AND JON WOLFSON Abstract. In this paper we study the topology of compact manifolds of positive isotropic
More informationLecture 2: Linear Algebra Review
EE 227A: Convex Optimization and Applications January 19 Lecture 2: Linear Algebra Review Lecturer: Mert Pilanci Reading assignment: Appendix C of BV. Sections 2-6 of the web textbook 1 2.1 Vectors 2.1.1
More informationComplete Nevanlinna-Pick Kernels
Complete Nevanlinna-Pick Kernels Jim Agler John E. McCarthy University of California at San Diego, La Jolla California 92093 Washington University, St. Louis, Missouri 63130 Abstract We give a new treatment
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More informationOn John type ellipsoids
On John type ellipsoids B. Klartag Tel Aviv University Abstract Given an arbitrary convex symmetric body K R n, we construct a natural and non-trivial continuous map u K which associates ellipsoids to
More informationProf. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India
CHAPTER 9 BY Prof. M. Saha Professor of Mathematics The University of Burdwan West Bengal, India E-mail : mantusaha.bu@gmail.com Introduction and Objectives In the preceding chapters, we discussed normed
More informationOn Systems of Diagonal Forms II
On Systems of Diagonal Forms II Michael P Knapp 1 Introduction In a recent paper [8], we considered the system F of homogeneous additive forms F 1 (x) = a 11 x k 1 1 + + a 1s x k 1 s F R (x) = a R1 x k
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More information