Logo do repositório
 
Publicação

On Neumann-type partitions of metric graphs

dc.contributor.authorBaptista, Luís Carlos Nascimento
dc.contributor.institutionFaculty of Sciences
dc.contributor.institutionDepartment of Mathematics
dc.contributor.supervisorKennedy, James Bernard
dc.date.accessioned2026-01-06T16:00:01Z
dc.date.available2026-01-06T16:00:01Z
dc.date.issued2025
dc.descriptionTese de Mestrado, Matemática, 2025, Universidade de Lisboa, Faculdade de Ciências
dc.description.abstractIn this thesis we will study operator theory in metric graphs and how it induces problems on partitions. We will start by formalizing the construction of metric graphs and Laplacians operators on them. Then by defining partitions of metric graphs we will be able to define minimization and maximization problems involving partitions. Starting by introducing the well studied spectral minimal partitions on graphs [12] (on subsets of Rd see [A. Henrot, De Gruyter Open, Warsaw, 2017], for example) we will then relate them to Neumann domains. The most important new results are Theorem 2.3.4 and Theorem 2.3.6. We will also characterize spectral minimal partitions to eigenvalues of the Laplacian heorem 2.3.10. We will then pose a new partition based problem using the mean distance function of a graph, ρ [Baptista, Kennedy and Mugnolo, J. Geom. Anal. 34 (2024), 137] and then study its asymptotic behaviour, Theorem 3.2.2, and how it relates with the spectral minimal partition problem, Corollary 3.2.5.en
dc.formatapplication/pdf
dc.identifier.tid204122449
dc.identifier.urihttp://hdl.handle.net/10400.5/116490
dc.language.isoeng
dc.subjectMetric graphs
dc.subjectLaplacian
dc.subjectPartitions
dc.subjectNeumann Domains
dc.subjectMean Distance
dc.titleOn Neumann-type partitions of metric graphsen
dc.typemaster thesis
dspace.entity.typePublication
rcaap.rightsopenAccess

Ficheiros

Principais
A mostrar 1 - 1 de 1
A carregar...
Miniatura
Nome:
TM_Luis_Baptista.pdf
Tamanho:
847.52 KB
Formato:
Adobe Portable Document Format