際際滷

際際滷Share a Scribd company logo
Transplantation of Eigenfunctions on Isospectral Domains
Feynman Liang
Dartmouth College
Background
In 1966, Mark Kac published an article in the American Mathematical Monthly asking Can
one hear the shape of a drum? [1]. Kacs question is not actually about a three-dimensional
drum, but instead a two dimensional drumhead modeled as a planar bounded domain with
smooth boundary . Wave propagation on  is described by the wave equation:
2f
t2
= f (1)
where z = f(x, y, t) represents the drumheads displacement at time t of the point (x, y)  .
Since the drumhead is attached at the boundaries, we impose homogeneous Dirichlet bound-
ary conditions:
f(x, y, t) = 0 for all t  R and (x, y)   (2)
Separation of variables is a method for solving this PDE. Assume f(x, y, t) = g(x, y)h(t) where
g(x, y) represents a standing wave and h(t) the time evolution of the wave. Substituting into
Equation 1, we have:
g(x, y)h (t) = (g(x, y))h(t)
Rewrite this as
h (t)
h(t)
=
g(x,y)
g(x,y)
and notice that since the left-hand side is independent of (x, y)
and the right-hand side is independent of t, both must be equal to some separation constant
了  R. This yields Laplaces Equation:
g = 了g (3)
h (t) = 了h(t) (4)
A function g :   R which satis鍖es Equation 2 and Equation 3 is called a Dirichlet eigen-
function of the Laplacian on  with eigenvalue 了. The Dirichlet spectrum of  is the set
of all 了 for which there exists a Dirichlet eigenfunction. Notice that a solution to Equation 4
h(t) = Kei

了t is harmonic in time with frequency

了, representing a pure tone the drum-
head is capable of producing (via the normal mode g(x, y)). We interpret hearing a drum as
knowing the Dirichlet spectrum of , so Kacs question is really asking if spectrum determines
shape.
In 1992, Gordon, Webb, and Wolpert constructed a pair of drumheads with different shapes
(nonisometric) but identical spectrums (isospectral) [2], providing a planar counterexample to
Kacs question. In this poster, we will explore a method called transplantation for proving two
planar domains have the same spectrum and verify the results with a discretized numerical
computation.
Transplantation of Waveforms
To show two planar domains have the same spectrum, we will show how to transplant an
eigenfunction of one domain to an eigenfunction with identical eigenvalue on the other do-
main. Here we consider only smooth eigenfunctions, choosing to neglect weak solutions.
Figure 1 shows a standard example of two isospectral domains[3]. Suppose  is a Dirichlet
eigenfunction on D1. Divide D1 and D2 into an equal number of congruent triangles, and
consider the restrictions of  to each of the triangles. Note that the restriction of  still sat-
is鍖es  = 了, except now with possibly nonzero boundary values. However, smoothness
of  requires coinciding triangle edges to agree smoothly and the zero Dirichlet boundary
condition on both domains requires that triangle edges on D1 and D2 must be zero.
(a) D1 (b) D2
Figure 1: Example of two isospectral domains
By linearity of Equation 3, a linear combination of solutions  is still a solution. Hence, we
can piece together the restrictions of  onto the triangles of D1 to transplant  into a solution
 on D2. To ensure  is smooth, we must be careful to ensure the pieced together solution
satisfy:
S.1 On edges between two adjacent triangles,  smooth.
S.2 On edges contained in D2,  = 0.
These conditions can be easily veri鍖ed on Figure 1. We will illustrate using the triangle
B + E  F in D2. Continuity ensures that  takes the same boundary value on the shared
blue edge of F and E. Hence, the sum of  on E with the  on F is zero on the blue edge
and by linearity still has eigenvalue 了. As the blue edge of B is on D1, the  to B is also zero
on this boundary. Thus, the combination B + E  F is identically zero on the blue boundary
which is also an edge on D2, satisfying S.2.
S.1 can be similarly checked; we will illustrate the red edge between B + E  F and
A + D + F is compatible. As the red edge of F is on the boundary of D1,  is zero on this
boundary. Thus, to check compatibility in D2 it suf鍖ces to show that A + D and B + E
share the same value on the red edge boundary. Notice that in D1 the triangles D and E
share a red edge as do the triangles A and B, hence by S.1 on D1  takes on the same value
for points on the red edges of D and E (and analogously for A and B). Therefore, A + Ds
red edge has the same value as B + E and  is continuous. Smoothness can be shown
using the re鍖ection property of Dirichlet eigenfunctions to fully verify S.1 on D2.
Proceeding in this manner, transplantation is able to take an eigenfunction  on D1 and
return an eigenfunction  on D2 with the same eigenvalue and satisfying boundary condi-
tions. The converse (obtaining  from ) can also be done by solving a linear system of 7
equations with 7 unknowns. Thus, the eigenvalues of D1 and D2 are identical so the two
domains are isospectral.
Numerical Veri鍖cation
To check that we have successfully constructed two isospectral domains, we will approximate
the Laplacian using 鍖nite difference and compute the spectrum of the discretized problem.
We 鍖rst discretize the two domains, yielding:
Figure 2: Discretized drumhead domains
A function g on this discretized domain is given by its value at each point, which can be viewed
as a 鍖nite dimensional vector g. In this discrete setting, the Laplacian g(x, y) takes the form:
g(x, y) =
g(x + h, y)  2g(x, y) + g(x  h, y)
h2
+
g(x, y + h)  2g(x, y) + g(x, y  h)
h2
(5)
where h is the distance between adjacent grid points. Equation 5 is a linear combination of
points {g(x, y), g(x賊h, y), g(x, y賊h)} and can be written as a matrix A operating on g, allowing
us to rewrite Equation 3:
g = 了g  A g = 了g
Computing the eigenvectors of A will then yield the value of eigenfunctions at the grid points.
If the two domains are truly isospectral, then the set of eigenvalues of A should be the same
for both domains. Carrying out this computation, Figure 3 shows the 鍖rst eight (truncated)
eigenvalues[4].
D1 D2
10.1659 10.1659
14.6306 14.6306
20.7176 20.7176
26.1151 26.1151
28.9835 28.9835
36.7741 36.7741
42.2830 42.2830
46.0342 46.0342
Figure 3: First eight eigenvalues of the discretized Laplacian on D1 and D2
Notice that the eigenvalues agree up to numerical roundoff, consistent with the fact that the
two domains are isospectral. In Figure 4 we visualize the corresponding eigenfunctions by
linearly interpolating between grid points.
Figure 4: Eigenfunctions of the discretized Laplacian on D1 and D2, linearly interpolated
Of particular interest is the eigenfunction corresponding to the 9th eigenvalue, which consists
of solutions on the basic isosceles triangle re鍖ected to cover the entire domain. Transplanta-
tion from D1 to D2 can be easily veri鍖ed here by comparing the polarity (indicated by color in
Figure 4) of each triangle patch.
References
[1] Marc Kac, Can one hear the shape of a drum?, Amer. Math. Monthly 73 (1966), 1-23.
[2] Carolyn Gordon, David Webb, Scott Wolpert, One cannot hear the shape of a drum, Bull.
Amer. Math. Soc. 27 (1992), 134-138.
[3] Gordon, Carolyn; Webb, David, You cant hear the shape of a drum, American Scientist
84 (JanuaryFebruary): 4655
[4] Moler, Cleve. Can One Hear the Shape of a Drum? Cleves Corner: Cleve Moler on
Mathematics and Computing. The MathWorks, Inc., 6 Aug. 2012. Web. 05 Mar. 2015.

More Related Content

What's hot (19)

Matrix Models of 2D String Theory in Non-trivial Backgrounds
Matrix Models of 2D String Theory in Non-trivial BackgroundsMatrix Models of 2D String Theory in Non-trivial Backgrounds
Matrix Models of 2D String Theory in Non-trivial Backgrounds
Utrecht University
Sol60
Sol60Sol60
Sol60
eli priyatna laidan
Brian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello: Research in Mathematical Group Representation Theory and SymmetryBrian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello
Geometry 201 unit 2.6
Geometry 201 unit 2.6Geometry 201 unit 2.6
Geometry 201 unit 2.6
Mark Ryder
Local Volatility 1
Local Volatility 1Local Volatility 1
Local Volatility 1
Ilya Gikhman
Riemann sumsdefiniteintegrals
Riemann sumsdefiniteintegralsRiemann sumsdefiniteintegrals
Riemann sumsdefiniteintegrals
Dr. Jennifer Chang Wathall
1.3.2B Introduction to Proof
1.3.2B Introduction to Proof1.3.2B Introduction to Proof
1.3.2B Introduction to Proof
smiller5
Prob2
Prob2Prob2
Prob2
R湛a Con Con R湛a
Chapter2 part2
Chapter2 part2Chapter2 part2
Chapter2 part2
Jabri Juhinin
boolean algebra(continued)
boolean algebra(continued)boolean algebra(continued)
boolean algebra(continued)
kanyuma jitjumnong
Geometry 201 unit 2.5
Geometry 201 unit 2.5Geometry 201 unit 2.5
Geometry 201 unit 2.5
Mark Ryder
NIACFDS2014-12-16_Nishikawa_BoundaryFormula
NIACFDS2014-12-16_Nishikawa_BoundaryFormulaNIACFDS2014-12-16_Nishikawa_BoundaryFormula
NIACFDS2014-12-16_Nishikawa_BoundaryFormula
Hiroaki Nishikawa
poster
posterposter
poster
Rebecca Simms
The wild McKay correspondence
The wild McKay correspondenceThe wild McKay correspondence
The wild McKay correspondence
Takehiko Yasuda
Perspectives on the wild McKay correspondence
Perspectives on the wild McKay correspondencePerspectives on the wild McKay correspondence
Perspectives on the wild McKay correspondence
Takehiko Yasuda
Chapter 2
Chapter 2Chapter 2
Chapter 2
Eka Puspita Sari
Dependency preserving
Dependency preservingDependency preserving
Dependency preserving
Jagadeesh Boddipu
Large-scale structure non-Gaussianities with modal methods (Ascona)
Large-scale structure non-Gaussianities with modal methods (Ascona)Large-scale structure non-Gaussianities with modal methods (Ascona)
Large-scale structure non-Gaussianities with modal methods (Ascona)
Marcel Schmittfull
Minimum spanning Tree
Minimum spanning TreeMinimum spanning Tree
Minimum spanning Tree
Narendra Singh Patel
Matrix Models of 2D String Theory in Non-trivial Backgrounds
Matrix Models of 2D String Theory in Non-trivial BackgroundsMatrix Models of 2D String Theory in Non-trivial Backgrounds
Matrix Models of 2D String Theory in Non-trivial Backgrounds
Utrecht University
Brian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello: Research in Mathematical Group Representation Theory and SymmetryBrian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello: Research in Mathematical Group Representation Theory and Symmetry
Brian Covello
Geometry 201 unit 2.6
Geometry 201 unit 2.6Geometry 201 unit 2.6
Geometry 201 unit 2.6
Mark Ryder
Local Volatility 1
Local Volatility 1Local Volatility 1
Local Volatility 1
Ilya Gikhman
1.3.2B Introduction to Proof
1.3.2B Introduction to Proof1.3.2B Introduction to Proof
1.3.2B Introduction to Proof
smiller5
Geometry 201 unit 2.5
Geometry 201 unit 2.5Geometry 201 unit 2.5
Geometry 201 unit 2.5
Mark Ryder
NIACFDS2014-12-16_Nishikawa_BoundaryFormula
NIACFDS2014-12-16_Nishikawa_BoundaryFormulaNIACFDS2014-12-16_Nishikawa_BoundaryFormula
NIACFDS2014-12-16_Nishikawa_BoundaryFormula
Hiroaki Nishikawa
The wild McKay correspondence
The wild McKay correspondenceThe wild McKay correspondence
The wild McKay correspondence
Takehiko Yasuda
Perspectives on the wild McKay correspondence
Perspectives on the wild McKay correspondencePerspectives on the wild McKay correspondence
Perspectives on the wild McKay correspondence
Takehiko Yasuda
Large-scale structure non-Gaussianities with modal methods (Ascona)
Large-scale structure non-Gaussianities with modal methods (Ascona)Large-scale structure non-Gaussianities with modal methods (Ascona)
Large-scale structure non-Gaussianities with modal methods (Ascona)
Marcel Schmittfull

Similar to transplantation-isospectral-poster (20)

graph theory
graph theorygraph theory
graph theory
Shashank Singh
Physics Assignment Help
Physics Assignment Help Physics Assignment Help
Physics Assignment Help
Edu Assignment Help
Thesis
ThesisThesis
Thesis
Aspen DeVries
Sol63
Sol63Sol63
Sol63
eli priyatna laidan
Note on Character Theory-summer 2013
Note on Character Theory-summer 2013Note on Character Theory-summer 2013
Note on Character Theory-summer 2013
Fan Huang (Wright)
GRAPH THEORY - Basic definition with examples
GRAPH THEORY - Basic definition with examplesGRAPH THEORY - Basic definition with examples
GRAPH THEORY - Basic definition with examples
Gayathri M
Numerical Analysis Assignment Help
Numerical Analysis Assignment HelpNumerical Analysis Assignment Help
Numerical Analysis Assignment Help
Math Homework Solver
1 ECE 6340 Fall 2013 Homework 8 Assignment.docx
 1 ECE 6340 Fall 2013  Homework 8 Assignment.docx 1 ECE 6340 Fall 2013  Homework 8 Assignment.docx
1 ECE 6340 Fall 2013 Homework 8 Assignment.docx
joyjonna282
Research_Jones_Polynomial
Research_Jones_PolynomialResearch_Jones_Polynomial
Research_Jones_Polynomial
Mariya Prokhorenko
Graph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Graph Theory,Graph Terminologies,Planar Graph & Graph ColouringGraph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Graph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Saurabh Kaushik
Differential Equations Assignment Help
Differential Equations Assignment HelpDifferential Equations Assignment Help
Differential Equations Assignment Help
Math Homework Solver
1309.0130v1
1309.0130v11309.0130v1
1309.0130v1
William Long
Equivalence relations
Equivalence relationsEquivalence relations
Equivalence relations
Tarun Gehlot
Implicit schemes for wave models
Implicit schemes for wave modelsImplicit schemes for wave models
Implicit schemes for wave models
Mathieu Dutour Sikiric
Differential Equations Assignment Help
Differential Equations Assignment HelpDifferential Equations Assignment Help
Differential Equations Assignment Help
Maths Assignment Help
Stochastic Processes Homework Help
Stochastic Processes Homework Help Stochastic Processes Homework Help
Stochastic Processes Homework Help
Statistics Assignment Help
Problem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element MethodProblem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element Method
Peter Herbert
Geometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pdeGeometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pde
Springer
student-problem-solutions.pdf
student-problem-solutions.pdfstudent-problem-solutions.pdf
student-problem-solutions.pdf
ssuser4d4e5a
student-problem-solutions.PDF
student-problem-solutions.PDFstudent-problem-solutions.PDF
student-problem-solutions.PDF
KarminderSingh7
Note on Character Theory-summer 2013
Note on Character Theory-summer 2013Note on Character Theory-summer 2013
Note on Character Theory-summer 2013
Fan Huang (Wright)
GRAPH THEORY - Basic definition with examples
GRAPH THEORY - Basic definition with examplesGRAPH THEORY - Basic definition with examples
GRAPH THEORY - Basic definition with examples
Gayathri M
Numerical Analysis Assignment Help
Numerical Analysis Assignment HelpNumerical Analysis Assignment Help
Numerical Analysis Assignment Help
Math Homework Solver
1 ECE 6340 Fall 2013 Homework 8 Assignment.docx
 1 ECE 6340 Fall 2013  Homework 8 Assignment.docx 1 ECE 6340 Fall 2013  Homework 8 Assignment.docx
1 ECE 6340 Fall 2013 Homework 8 Assignment.docx
joyjonna282
Graph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Graph Theory,Graph Terminologies,Planar Graph & Graph ColouringGraph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Graph Theory,Graph Terminologies,Planar Graph & Graph Colouring
Saurabh Kaushik
Differential Equations Assignment Help
Differential Equations Assignment HelpDifferential Equations Assignment Help
Differential Equations Assignment Help
Math Homework Solver
Equivalence relations
Equivalence relationsEquivalence relations
Equivalence relations
Tarun Gehlot
Differential Equations Assignment Help
Differential Equations Assignment HelpDifferential Equations Assignment Help
Differential Equations Assignment Help
Maths Assignment Help
Problem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element MethodProblem Solving by Computer Finite Element Method
Problem Solving by Computer Finite Element Method
Peter Herbert
Geometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pdeGeometric properties for parabolic and elliptic pde
Geometric properties for parabolic and elliptic pde
Springer
student-problem-solutions.pdf
student-problem-solutions.pdfstudent-problem-solutions.pdf
student-problem-solutions.pdf
ssuser4d4e5a
student-problem-solutions.PDF
student-problem-solutions.PDFstudent-problem-solutions.PDF
student-problem-solutions.PDF
KarminderSingh7

More from Feynman Liang (8)

Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Feynman Liang
Accelerating Metropolis Hastings with Lightweight Inference Compilation
Accelerating Metropolis Hastings with Lightweight Inference CompilationAccelerating Metropolis Hastings with Lightweight Inference Compilation
Accelerating Metropolis Hastings with Lightweight Inference Compilation
Feynman Liang
Detecting paraphrases using recursive autoencoders
Detecting paraphrases using recursive autoencodersDetecting paraphrases using recursive autoencoders
Detecting paraphrases using recursive autoencoders
Feynman Liang
A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)
Feynman Liang
Recursive Autoencoders for Paraphrase Detection (Socher et al)
Recursive Autoencoders for Paraphrase Detection (Socher et al)Recursive Autoencoders for Paraphrase Detection (Socher et al)
Recursive Autoencoders for Paraphrase Detection (Socher et al)
Feynman Liang
Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
 Engineered histone acetylation using DNA-binding domains (DBD), chemical ind... Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
Feynman Liang
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
Feynman Liang
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Feynman Liang
Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Beyond Blacklists: AI Application Security in the Age of AI (WWHF 2024)
Feynman Liang
Accelerating Metropolis Hastings with Lightweight Inference Compilation
Accelerating Metropolis Hastings with Lightweight Inference CompilationAccelerating Metropolis Hastings with Lightweight Inference Compilation
Accelerating Metropolis Hastings with Lightweight Inference Compilation
Feynman Liang
Detecting paraphrases using recursive autoencoders
Detecting paraphrases using recursive autoencodersDetecting paraphrases using recursive autoencoders
Detecting paraphrases using recursive autoencoders
Feynman Liang
A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)A Unifying Review of Gaussian Linear Models (Roweis 1999)
A Unifying Review of Gaussian Linear Models (Roweis 1999)
Feynman Liang
Recursive Autoencoders for Paraphrase Detection (Socher et al)
Recursive Autoencoders for Paraphrase Detection (Socher et al)Recursive Autoencoders for Paraphrase Detection (Socher et al)
Recursive Autoencoders for Paraphrase Detection (Socher et al)
Feynman Liang
Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
 Engineered histone acetylation using DNA-binding domains (DBD), chemical ind... Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
Engineered histone acetylation using DNA-binding domains (DBD), chemical ind...
Feynman Liang
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
A LOV2 Domain-Based Optogenetic Tool to Control Protein Degradation and Cellu...
Feynman Liang
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Integrated Genomic and Proteomic Analyses of a Systematically Perturbed Metab...
Feynman Liang

transplantation-isospectral-poster

  • 1. Transplantation of Eigenfunctions on Isospectral Domains Feynman Liang Dartmouth College Background In 1966, Mark Kac published an article in the American Mathematical Monthly asking Can one hear the shape of a drum? [1]. Kacs question is not actually about a three-dimensional drum, but instead a two dimensional drumhead modeled as a planar bounded domain with smooth boundary . Wave propagation on is described by the wave equation: 2f t2 = f (1) where z = f(x, y, t) represents the drumheads displacement at time t of the point (x, y) . Since the drumhead is attached at the boundaries, we impose homogeneous Dirichlet bound- ary conditions: f(x, y, t) = 0 for all t R and (x, y) (2) Separation of variables is a method for solving this PDE. Assume f(x, y, t) = g(x, y)h(t) where g(x, y) represents a standing wave and h(t) the time evolution of the wave. Substituting into Equation 1, we have: g(x, y)h (t) = (g(x, y))h(t) Rewrite this as h (t) h(t) = g(x,y) g(x,y) and notice that since the left-hand side is independent of (x, y) and the right-hand side is independent of t, both must be equal to some separation constant 了 R. This yields Laplaces Equation: g = 了g (3) h (t) = 了h(t) (4) A function g : R which satis鍖es Equation 2 and Equation 3 is called a Dirichlet eigen- function of the Laplacian on with eigenvalue 了. The Dirichlet spectrum of is the set of all 了 for which there exists a Dirichlet eigenfunction. Notice that a solution to Equation 4 h(t) = Kei 了t is harmonic in time with frequency 了, representing a pure tone the drum- head is capable of producing (via the normal mode g(x, y)). We interpret hearing a drum as knowing the Dirichlet spectrum of , so Kacs question is really asking if spectrum determines shape. In 1992, Gordon, Webb, and Wolpert constructed a pair of drumheads with different shapes (nonisometric) but identical spectrums (isospectral) [2], providing a planar counterexample to Kacs question. In this poster, we will explore a method called transplantation for proving two planar domains have the same spectrum and verify the results with a discretized numerical computation. Transplantation of Waveforms To show two planar domains have the same spectrum, we will show how to transplant an eigenfunction of one domain to an eigenfunction with identical eigenvalue on the other do- main. Here we consider only smooth eigenfunctions, choosing to neglect weak solutions. Figure 1 shows a standard example of two isospectral domains[3]. Suppose is a Dirichlet eigenfunction on D1. Divide D1 and D2 into an equal number of congruent triangles, and consider the restrictions of to each of the triangles. Note that the restriction of still sat- is鍖es = 了, except now with possibly nonzero boundary values. However, smoothness of requires coinciding triangle edges to agree smoothly and the zero Dirichlet boundary condition on both domains requires that triangle edges on D1 and D2 must be zero. (a) D1 (b) D2 Figure 1: Example of two isospectral domains By linearity of Equation 3, a linear combination of solutions is still a solution. Hence, we can piece together the restrictions of onto the triangles of D1 to transplant into a solution on D2. To ensure is smooth, we must be careful to ensure the pieced together solution satisfy: S.1 On edges between two adjacent triangles, smooth. S.2 On edges contained in D2, = 0. These conditions can be easily veri鍖ed on Figure 1. We will illustrate using the triangle B + E F in D2. Continuity ensures that takes the same boundary value on the shared blue edge of F and E. Hence, the sum of on E with the on F is zero on the blue edge and by linearity still has eigenvalue 了. As the blue edge of B is on D1, the to B is also zero on this boundary. Thus, the combination B + E F is identically zero on the blue boundary which is also an edge on D2, satisfying S.2. S.1 can be similarly checked; we will illustrate the red edge between B + E F and A + D + F is compatible. As the red edge of F is on the boundary of D1, is zero on this boundary. Thus, to check compatibility in D2 it suf鍖ces to show that A + D and B + E share the same value on the red edge boundary. Notice that in D1 the triangles D and E share a red edge as do the triangles A and B, hence by S.1 on D1 takes on the same value for points on the red edges of D and E (and analogously for A and B). Therefore, A + Ds red edge has the same value as B + E and is continuous. Smoothness can be shown using the re鍖ection property of Dirichlet eigenfunctions to fully verify S.1 on D2. Proceeding in this manner, transplantation is able to take an eigenfunction on D1 and return an eigenfunction on D2 with the same eigenvalue and satisfying boundary condi- tions. The converse (obtaining from ) can also be done by solving a linear system of 7 equations with 7 unknowns. Thus, the eigenvalues of D1 and D2 are identical so the two domains are isospectral. Numerical Veri鍖cation To check that we have successfully constructed two isospectral domains, we will approximate the Laplacian using 鍖nite difference and compute the spectrum of the discretized problem. We 鍖rst discretize the two domains, yielding: Figure 2: Discretized drumhead domains A function g on this discretized domain is given by its value at each point, which can be viewed as a 鍖nite dimensional vector g. In this discrete setting, the Laplacian g(x, y) takes the form: g(x, y) = g(x + h, y) 2g(x, y) + g(x h, y) h2 + g(x, y + h) 2g(x, y) + g(x, y h) h2 (5) where h is the distance between adjacent grid points. Equation 5 is a linear combination of points {g(x, y), g(x賊h, y), g(x, y賊h)} and can be written as a matrix A operating on g, allowing us to rewrite Equation 3: g = 了g A g = 了g Computing the eigenvectors of A will then yield the value of eigenfunctions at the grid points. If the two domains are truly isospectral, then the set of eigenvalues of A should be the same for both domains. Carrying out this computation, Figure 3 shows the 鍖rst eight (truncated) eigenvalues[4]. D1 D2 10.1659 10.1659 14.6306 14.6306 20.7176 20.7176 26.1151 26.1151 28.9835 28.9835 36.7741 36.7741 42.2830 42.2830 46.0342 46.0342 Figure 3: First eight eigenvalues of the discretized Laplacian on D1 and D2 Notice that the eigenvalues agree up to numerical roundoff, consistent with the fact that the two domains are isospectral. In Figure 4 we visualize the corresponding eigenfunctions by linearly interpolating between grid points. Figure 4: Eigenfunctions of the discretized Laplacian on D1 and D2, linearly interpolated Of particular interest is the eigenfunction corresponding to the 9th eigenvalue, which consists of solutions on the basic isosceles triangle re鍖ected to cover the entire domain. Transplanta- tion from D1 to D2 can be easily veri鍖ed here by comparing the polarity (indicated by color in Figure 4) of each triangle patch. References [1] Marc Kac, Can one hear the shape of a drum?, Amer. Math. Monthly 73 (1966), 1-23. [2] Carolyn Gordon, David Webb, Scott Wolpert, One cannot hear the shape of a drum, Bull. Amer. Math. Soc. 27 (1992), 134-138. [3] Gordon, Carolyn; Webb, David, You cant hear the shape of a drum, American Scientist 84 (JanuaryFebruary): 4655 [4] Moler, Cleve. Can One Hear the Shape of a Drum? Cleves Corner: Cleve Moler on Mathematics and Computing. The MathWorks, Inc., 6 Aug. 2012. Web. 05 Mar. 2015.