Presentation is loading. Please wait.

Presentation is loading. Please wait.

Adam Sawicki, Rami Band, Uzy Smilansky Scattering from isospectral graphs.

Similar presentations


Presentation on theme: "Adam Sawicki, Rami Band, Uzy Smilansky Scattering from isospectral graphs."— Presentation transcript:

1 Adam Sawicki, Rami Band, Uzy Smilansky Scattering from isospectral graphs

2 This question was asked by Marc Kac (1966). Is it possible to have two different drums with the same spectrum ( isospectral drums ) ? ‘Can one hear the shape of a drum ?’ Marc Kac ( )

3 A Drum is an elastic membrane which is attached to a solid planar frame. The spectrum is the set of the Laplacian’s eigenvalues,, (usually with Dirichlet boundary conditions): A few wavefunctions of the Sinai ‘drum’: The spectrum of a drum, …,, …,, …,, …,

4 Isospectral drums Gordon, Webb and Wolpert (1992): ‘One cannot hear the shape of a drum’ Using Sunada’s construction (1985)

5 Isospectral drums – A transplantation proof Given an eigenfunction on drum (a), create an eigenfunction with the same eigenvalue on drum (b). (a)(b)

6 Isospectral drums – A transplantation proof Given an eigenfunction on drum (a), create an eigenfunction with the same eigenvalue on drum (b). (a)(b)

7 We can use another basic building block Isospectral drums – A transplantation proof

8 … or even a funny shaped building block … Isospectral drums – A transplantation proof

9 … or cut it in a nasty way (and ruin the connectivity) … Isospectral drums – A transplantation proof

10 Okada, Shudo, Tasaki and Harayama conjecture (2005) that ‘One can distinguish isospectral drums by measuring their scattering poles’ ‘Can one hear the shape of a drum ?’: revisited

11 What’s next? Scattering matrices of quantum graphs. Isospectral construction. Scattering from isospectral quantum graphs. Back to drums.

12 A quantum graph is defined by: A graph A length for each edge A scattering matrix for each vertex (indicates vertex conditions) The eigenfunctions of the Laplacian are given by on each of the edges e of the graph. They can be described by these coefficients. L 13 L 23 L 34 L 45 L Quantum Graphs

13 A quantum graph is defined by: A graph A length for each edge A scattering matrix for each vertex (indicates vertex conditions) The eigenfunctions of the Laplacian are described by L 13 L 23 L 34 L 45 L Quantum Graphs

14 L 13 L 23 L 34 L 45 L 46 Quantum Graphs

15 A quantum graph is defined by: A graph A length for each edge A scattering matrix for each vertex (indicates boundary conditions) The eigenfunctions are described by Examples of several eigenfunctions of the Laplacian on the graph above: L 13 L 23 L 34 L 45 L Quantum Graphs - Introduction

16 L 13 L 23 L 34 L 45 L Quantum Graphs – Attaching leads

17 L 13 L 23 L 34 L 45 L Quantum Graphs – Attaching leads

18 L 13 L 23 L 34 L 45 L Quantum Graphs – Attaching leads The poles of S(k) are below the real axis.

19 Theorem (R. Band, O. Parzanchevski, G. Ben-Shach) Let Γ be a graph which obeys a symmetry group G. Let H 1, H 2 be two subgroups of G with representations R 1, R 2 that satisfy then the graphs, are isospectral. Theorem (R.Band, O. Parzanchevski, G. Ben-Shach) The graphs, constructed according to the conditions above, possess a transplantation. Remark – The theorems are applicable for other geometrical objects such as manifolds and drums. Isospectral theorem D N D N N D

20 Transplantation The transplantation of our example is D N N D D N A B A-B A+B

21 Transplantation & Scattering We may apply the isospectral construction on graphs with leads:

22 Transplantation & Scattering We may apply the isospectral construction on graphs with leads: The transplantation relates the function’s values on the leads: In particular S 1 (k), S 2 (k) have the same pole structure. In addition, we have the scattering relations: gf

23 ‘Can one hear the shape of a graph ?’: revisited Definition – The graphs Γ 1, Γ 2 are called isoscattering if they can be extended to scattering systems which share the same pole structure. The isospectral construction can be used to construct isoscattering graphs. Two isospectral graphs are also isoscattering. The possible extensions of these graphs to isopolar scattering systems depend on the symmetry that was used in the construction. The isospectral construction applies also to manifolds and drums - Why the scattering results for drums and graphs are different?

24 The isospectral drums construction Buser, Conway, Doyle, Semmler (1994)

25 AS, Rami Band, Uzy Smilansky Scattering from isospectral graphs


Download ppt "Adam Sawicki, Rami Band, Uzy Smilansky Scattering from isospectral graphs."

Similar presentations


Ads by Google