Graphs which sound the same
53 mins 35 secs,
333.04 MB,
QuickTime
384x288,
25.0 fps,
44100 Hz,
848.6 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Smilansky, U (Weizmann Institute of Science)
Wednesday 11 April 2007, 15:00-16:00 Graph Models of Mesoscopic Systems, Wave-Guides and Nano-Structures |
|---|
| Created: | 2008-03-25 09:08 | ||
|---|---|---|---|
| Collection: | Analysis on Graphs and its Applications | ||
| Publisher: | Isaac Newton Institute | ||
| Copyright: | Smilansky, U | ||
| Language: | eng (English) | ||
| Credits: |
|
||
| Abstract: | After a short review of the conditions for unique spectral inversion for quantum graphs, I shall describe a method for constructing families of isospectral yet not isometric garphs: "graphs which sound the same". I shall then discuss the conjecture that graphs which sound the same can be resolved by the difference between their sequences of counts of nodal domains, and will present a proof that this is indeed the case for a simple yet non trivial example. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 480x360 | 1.84 Mbits/sec | 739.66 MB | View | Download | |
| WebM | 480x360 | 701.68 kbits/sec | 274.95 MB | View | Download | |
| Flash Video | 480x360 | 806.26 kbits/sec | 316.42 MB | View | Download | |
| iPod Video | 480x360 | 505.32 kbits/sec | 198.32 MB | View | Download | |
| QuickTime * | 384x288 | 848.6 kbits/sec | 333.04 MB | View | Download | |
| MP3 | 44100 Hz | 125.02 kbits/sec | 48.85 MB | Listen | Download | |
| Windows Media Video | 476.85 kbits/sec | 187.14 MB | View | Download | ||
| Auto | (Allows browser to choose a format it supports) | |||||