Berkolaiko, G (Texas A and M)
Monday 02 April 2007, 14:00-15:00
Quantum Graphs, their Spectra and Applications

Berkolaiko, G (Texas A and M) Monday 02 April 2007, 14:00-15:00 Quantum Graphs, their Spectra and Applications

A lower bound for nodal count on discrete and metric graphs

Analysis on graphs and other discrete structures has been developing for quite some time, in particular due to applications to number theory, algebra, probability theory, spectral geometry, as well as to its usefulness in many practical problems. This area, however, has experienced recently a significant boost in terms of new important applications arising, new methods being developed, and new models introduced not studied before. This has happened due to numerous new applications arising in different areas of mathematics, sciences, and engineering. They swipe throughout a wide scientific landscape, which besides the fields already mentioned includes nanotechnology, microelectronics, quantum chemistry, superconductivity, optics, etc.

Read more at: http://www.newton.ac.uk/programmes/AGA/

Analysis on graphs and other discrete structures has been developing for quite some time, in particular due to applications to number theory, algebra, probability theory, spectral geometry, as well as to its usefulness in many practical problems. This area, however, has experienced recently a significant boost in terms of new important applications arising, new methods being developed, and new models introduced not studied before. This has happened due to numerous new applications arising in different areas of mathematics, sciences, and engineering. They swipe throughout a wide scientific landscape, which besides the fields already mentioned includes nanotechnology, microelectronics, quantum chemistry, superconductivity, optics, etc. Read more at: http://www.newton.ac.uk/programmes/AGA/

Share A lower bound for nodal count on discrete and metric graphs

Sign up to save your podcasts

A lower bound for nodal count on discrete and metric graphs

A lower bound for nodal count on discrete and metric graphs

More shows like Analysis on Graphs and its Applications

Public Lectures from the Faculty of Law, University of Cambridge

Philosophy

Social and Developmental Psychology Seminar Series

Hay Festival lectures

Crystallography

Random Geometry

Medieval History Seminars

Moral Sciences Club

Things Seminar

Treasuries of Knowledge