Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On extremal eigenvalues of the graph Laplacian
Stockholm University, Faculty of Science, Department of Mathematics.ORCID iD: 0000-0001-9725-0265
(English)Manuscript (preprint) (Other academic)
Abstract [en]

Upper and lower estimates of eigenvalues of the Laplacian on a metric graph have been established in 2017 by G. Berkolaiko, J.B. Kennedy, P. Kurasov and D. Mugnolo. Both these estimates can be achieved at the same time only by highly degenerate eigenvalues which we call maximally degenerate. By comparison with the maximal eigenvalue multiplicity proved by I. Kac and V. Pivovarchik in 2011 we characterize the family of graphs exhibiting maximally degenerate eigenvalues which we call lasso trees, namely graphs constructed from trees by attaching lasso graphs to some of the vertices.

Keywords [en]
quantum graphs, eigenvalue inequalities, eigenvalue multiplicity
National Category
Mathematical Analysis
Research subject
Mathematics
Identifiers
URN: urn:nbn:se:su:diva-185475OAI: oai:DiVA.org:su-185475DiVA, id: diva2:1469652
Available from: 2020-09-22 Created: 2020-09-22 Last updated: 2022-02-25Bibliographically approved
In thesis
1. Extremal eigenvalues and geometry of quantum graphs
Open this publication in new window or tab >>Extremal eigenvalues and geometry of quantum graphs
2020 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This thesis consists of four papers concerning topics in the spectral theory of quantum graphs, which are differential operators on metric graphs.

In paper I we present a family of graphs with an arbitrary number of cycles for which a certain eigenvalue upper estimate is sharp. This result disproves that such estimate could be improved as it was conjectured in the paper where it was originally derived.

In paper II we study the problem of maximizing the first eigenvalue—also called ground-state energy—of the Schrödinger operator on a fixed metric graph with delta-type vertex conditions subject to integral constraints on the potential and coupling constant. Depending on whether an optimal solution exists or not we either characterize the optimal potential and coupling constant or we discuss the asymptotic behaviour. Remarkably, it appears that the solution is independent of the topology of the graph. In particular, for strong potential the ground-state is given as a function of the distance from the nearest vertex.

Paper III deals with the inverse problem of recovering the number of independent cycles of a graph from a limited number of the smallest eigenvalues of the standard Laplacian. The mathematical analysis of the method is supported by numerical simulations inspired by a recent experiment where the spectrum is obtained by measuring resonances in a microwave network.

In paper IV we present a class of graphs for which both upper and lower estimates, recently established, are sharp on the same infinite sequence of eigenvalues. This is possible due to the presence of multiple eigenvalues.

Place, publisher, year, edition, pages
Stockholm: Department of Mathematics, Stockholm University, 2020. p. 35
Keywords
quantum graphs, spectral estimates, trace formula, Euler characteristic
National Category
Mathematical Analysis
Research subject
Mathematics
Identifiers
urn:nbn:se:su:diva-185477 (URN)978-91-7911-278-3 (ISBN)978-91-7911-279-0 (ISBN)
Public defence
2020-11-06, sal 14, hus 5, Kräftriket, Roslagsvägen 101, Stockholm, 13:00 (English)
Opponent
Supervisors
Available from: 2020-10-14 Created: 2020-09-22 Last updated: 2022-02-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Full text

Authority records

Serio, Andrea

Search in DiVA

By author/editor
Serio, Andrea
By organisation
Department of Mathematics
Mathematical Analysis

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 41 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf