相关论文: Homology of spectral minimal partitions

A spectral minimal partition of a manifold is a decomposition into disjoint open sets that minimizes a spectral energy functional. While it is known that bipartite minimal partitions correspond to nodal partitions of Courant-sharp Laplacian…

In this article, we propose a state of the art concerning the nodal and spectral minimal partitions. First we focus on the nodal partitions and give some examples of Courant sharp cases. Then we are interested in minimal spectral…

We consider partitions of a finite, simple, weighted graph that minimize a spectral energy functional, defined to be the maximum of the first eigenvalues on each component. These partitions are minimized with respect to a parameter that we…

We consider two-dimensional Schr\"odinger operators in bounded domains. We analyze relations between nodal domains of eigenfunctions, spectral minimal partitions and spectral properties of the corresponding operator. The main results…

Recent work of the authors and their collaborators has uncovered fundamental connections between the Dirichlet-to-Neumann map, the spectral flow of a certain family of self-adjoint operators, and the nodal deficiency of a Laplacian…

We investigate combinatorial properties of certain configurations of a graph partition which are related to the minimality of a cut. We show that such configurations are related to the third eigenvector of the Laplacian matrix. It is well…

We study the structure of eigenfunctions of the Laplacian on quantum graphs, with a particular focus on Morse eigenfunctions via nodal and Neumann domains. Building on Courant-type arguments, we establish upper bounds for the number of…

In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…

The oscillation of a Laplacian eigenfunction gives a great deal of information about the manifold on which it is defined. This oscillation can be encoded in the nodal deficiency, an important geometric quantity that is notoriously hard to…

The geometric Langlands program is distinguished in assigning spectral decompositions to all representations, not only the irreducible ones. However, it is not even clear what is meant by a spectral decomposition when one works with…

We introduce an abstract framework for the study of clustering in metric graphs: after suitably metrising the space of graph partitions, we restrict Laplacians to the clusters thus arising and use their spectral gaps to define several…

We consider a family of non-compact manifolds $X_\eps$ (``graph-like manifolds'') approaching a metric graph $X_0$ and establish convergence results of the related natural operators, namely the (Neumann) Laplacian $\laplacian {X_\eps}$ and…

We consider the minimum-cut partitioning of a graph into more than two parts using spectral methods. While there exist well-established spectral algorithms for this problem that give good results, they have traditionally not been well…

We consider spectral minimal partitions. Continuing work of the the present authors about problems for planar domains, [23], we focus on the sphere and obtain a sharp result for 3-partitions which is related to questions from harmonic…

Harmonic morphisms, maps which preserve Laplace's equation, are intimately connected to the topic of minimal submanifolds. In this article we first characterise harmonic morphisms between Riemannian manifolds as the weakly horizontally…

Given a bounded open set $\Omega$ in $\mathbb{R}^n$ (or a compact Riemannian manifold with boundary), and a partition of $\Omega$ by $k$ open sets $\omega_j$, we consider the quantity $\max_j \lambda(\omega_j)$, where $\lambda(\omega_j)$ is…

In 2010, Butler introduced the unfolding operation on a bipartite graph to produce two bipartite graphs, which are cospectral for the adjacency and the normalized Laplacian matrices. In this article, we describe how the idea of unfolding a…

The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…

Quantum mechanics ordinarily describes particles as being pointlike, in the sense that the uncertainty $\Delta x$ can, in principle, be made arbitrarily small. It has been shown that suitable correction terms to the canonical commutation…

Given a bounded open set $\Omega$ in $ \mathbb R^n$ (or in a Riemannian manifold) and a partition of $\Omega$ by $k$ open sets $D_j$, we consider the quantity $\max_j \lambda(D_j)$ where $\lambda(D_j)$ is the ground state energy of the…