Nodal domains and spectral critical partitions on graphs

45 mins 27 secs, 169.59 MB, iPod Video 480x270, 50.0 fps, 44100 Hz, 509.44 kbits/sec

Share this media item:

Embed this media item:

<iframe width="_width_" height="_height_" src="https://sms.cam.ac.uk/media/867453/embed" frameborder="0" scrolling="no" allowfullscreen></iframe>

Choose size:

About this item

Available Formats

About this item

Description:	Berkolaiko, G (Texam A and M University) Monday 26 July 2010, 11:15-12.00

Created:

2010-07-28 10:33

Collection:

Analysis on Graphs and its Applications

Publisher:

Isaac Newton Institute

Berkolaiko, G

Language:

eng (English)

Distribution:

World

(downloadable)

Credits:

Author:	Berkolaiko, G
Producer:	Steve Greenham

Explicit content:

Aspect Ratio:

16:9

Screencast:

Bumper:

/sms-ingest/static/1920x1080-16x9-sms-bumper.mp4

Trailer:

/sms-ingest/static/1920x1080-16x9-sms-trailer.mp4


Abstract:	The $k$-th eigenfunction of a Schrodinger operator on a bounded regular domain $\Omega$ with Dirichlet boundary conditions defines a partition of $\Omega$ into $n$ nodal subdomains. A famous result by Courant establishes that $n \leq k$; the number $k-n$ will be referred to as the nodal deficiency. The nodal subdomains, when endowed with Dirichlet boundary conditions, have equal first eigenvalue, which coincides with the $k$-th eigenvalue of the original Schrodinger problem. Additionally, the partition is bipartite, i.e. it consists of positive and negative subdomains (corresponding to the sign of the eigenfunction), with two domains of the same sign not sharing a boundary. Conversely, for a given partition, define the energy of the partition to be the largest of the first Dirichlet eigenvalues of its subdomains. An $n$-partition with the minimal energy is called the minimal $n$-partition. It is interesting to relate the extremal properties of the partitions to the eigenstates of the operator on $\Omega$. Recently, Helffer, Hoffmann-Ostenhof and Terracini proved that $n$-th minimal partition is bipartite if and only if it corresponds to a Courant-sharp eigenfunction (an eigenfunction with nodal deficiency zero). We study partitions on quantum graphs and discover a complete characterization of eigenfunctions as critical equipartitions. More precisely, equipartitions are partitions with all first eigenvalues equal. We parameterize the manifold of all equipartitions and consider the energy of an $n$-equipartition as a function on this manifold. For a generic graph and large enough $n$ we establish the following theorem: a critical point of the energy function with $b$ unstable directions is a bipartite equipartition if and only if it corresponds to an eigenfunction with nodal deficiency $b$. Since by constructions it has $n$ nodal domains it is therefore the $n+b$-th eigenfunction in the spectral sequence. Since at a minimum the number of unstable directions is $b=0$, our results include the quantum graph analogue of the results of Helffer et al. They also provide a new formulation of known bounds on the number of nodal domains on generic graphs. This is joint work with Rami Band, Hillel Raz and Uzy Smilansky.

Abstract:

The $k$-th eigenfunction of a Schrodinger operator on a bounded regular domain $\Omega$ with Dirichlet boundary conditions defines a partition of $\Omega$ into $n$ nodal subdomains. A famous result by Courant establishes that $n \leq k$; the number $k-n$ will be referred to as the nodal deficiency. The nodal subdomains, when endowed with Dirichlet boundary conditions, have equal first eigenvalue, which coincides with the $k$-th eigenvalue of the original Schrodinger problem. Additionally, the partition is bipartite, i.e. it consists of positive and negative subdomains (corresponding to the sign of the eigenfunction), with two domains of the same sign not sharing a boundary. Conversely, for a given partition, define the energy of the partition to be the largest of the first Dirichlet eigenvalues of its subdomains. An $n$-partition with the minimal energy is called the minimal $n$-partition. It is interesting to relate the extremal properties of the partitions to the eigenstates of the operator on $\Omega$. Recently, Helffer, Hoffmann-Ostenhof and Terracini proved that $n$-th minimal partition is bipartite if and only if it corresponds to a Courant-sharp eigenfunction (an eigenfunction with nodal deficiency zero). We study partitions on quantum graphs and discover a complete characterization of eigenfunctions as critical equipartitions. More precisely, equipartitions are partitions with all first eigenvalues equal. We parameterize the manifold of all equipartitions and consider the energy of an $n$-equipartition as a function on this manifold. For a generic graph and large enough $n$ we establish the following theorem: a critical point of the energy function with $b$ unstable directions is a bipartite equipartition if and only if it corresponds to an eigenfunction with nodal deficiency $b$. Since by constructions it has $n$ nodal domains it is therefore the $n+b$-th eigenfunction in the spectral sequence. Since at a minimum the number of unstable directions is $b=0$, our results include the quantum graph analogue of the results of Helffer et al. They also provide a new formulation of known bounds on the number of nodal domains on generic graphs. This is joint work with Rami Band, Hillel Raz and Uzy Smilansky.

Available Formats

Format	Quality	Bitrate	Size
MPEG-4 Video	640x360	1.84 Mbits/sec	629.24 MB	View	Download
WebM	640x360	2.03 Mbits/sec	692.48 MB	View	Download
Flash Video	484x272	571.93 kbits/sec	190.39 MB	View	Download
iPod Video *	480x270	509.44 kbits/sec	169.59 MB	View	Download
MP3	44100 Hz	125.0 kbits/sec	41.43 MB	Listen	Download
Auto	(Allows browser to choose a format it supports)

Streaming Media Service Upload

Nodal domains and spectral critical partitions on graphs