Related papers: Geometric spectral optimization on surfaces

We develop spectral methods for ODEs and operator eigenvalue problems that are based on a least-squares formulation of the problem. The key tool is a method for rectangular generalized eigenvalue problems, which we extend to quasimatrices…

For every given $\beta<0$, we study the problem of maximizing the first Robin eigenvalue of the Laplacian $\lambda_\beta(\Omega)$ among convex (not necessarily smooth) sets $\Omega\subset\mathbb{S}^{n}$ with fixed perimeter. In particular,…

We show that the first eigenvalue of a closed Riemannian surface normalized by the area can be strictly increased by attaching a cylinder or a cross cap. As a consequence we obtain the existence of maximizing metrics for the normalized…

In this paper, we investigate the first eigenvalues of two closed eigenvalue problems of the bi-Beltrami-Laplacian on minimal embedded isoparametric hypersurface in the unit sphere $\mathbb{S}^{n+1}(1)$. Although many mathematicians want to…

Suppose that $\Sigma^n\subset\mathbb{S}^{n+1}$ is a closed embedded minimal hypersurface. We prove that the first non-zero eigenvalue $\lambda_1$ of the induced Laplace-Beltrami operator on $\Sigma$ satisfies $\lambda_1 \geq \frac{n}{2}+…

We consider an optimization problem for the first Dirichlet eigenvalue of the $p$-Laplacian on a hypersurface in $\mathbb{R}^{2n}$, with $n \ge 2$. If $p \ge 2n-1$, then among hypersurfaces in $\mathbb{R}^{2n}$ which are $O(n) \times…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

In this paper, we prove new pinching theorems for the first eigenvalue of the Laplacian on compact hypersurfaces of the Euclidean space. These pinching results are associated with the upper bound for the first eigenvalue in terms of higher…

In this paper, we give a lower bound for the spectrum of the Laplacian on minimal hypersurfaces immersed into $H^m \times R$. As an application, in dimension 2, we prove that a complete minimal surface with finite total extrinsic curvature…

In this paper we prove that solutions to several shape optimization problems in the plane, with a convexity constraint on the admissible domains, are polygons. The main terms of the shape functionals we consider are either E f ($\Omega$),…

We consider an optimization problem for the eigenvalues of a multi-material elastic structure that was previously introduced by Garcke et al. [Adv. Nonlinear Anal. 11 (2022), no. 1, 159--197]. There, the elastic structure is represented by…

In this paper, a spectral method based on conformal mappings is proposed to solve Steklov eigenvalue problems and their related shape optimization problems in two dimensions. To apply spectral methods, we first reformulate the Steklov…

The Laplace-Beltrami operator on (the surface of) a triaxial ellipsoid admits a sequence of real eigenvalues diverging to plus infinity. By introducing ellipsoidal coordinates, this eigenvalue problem for a partial differential operator is…

We consider a linear-quadratic optimization problem with pointwise bounds on the state for which the constraint is given by the Laplace-Beltrami equation (to have uniqueness we add an lower order term) on a two-dimensional surface . By…

We investigate two related problems concerning the dimension of joint eigenspaces of the Laplace--Beltrami operator and a finite set of Hecke operators on $\mathbb{X}=\mathrm{PGL}_2(\mathbb{Z})\backslash \mathbb{H}$. First, we consider…

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…

Spectral methods include a family of algorithms related to the eigenvectors of certain data-generated matrices. In this work, we are interested in studying the geometric landscape of the eigendecomposition problem in various spectral…

In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…

The famous Yang-Yau inequality provides an upper bound for the first eigenvalue of the Laplacian on an orientable Riemannian surface solely in terms of its genus $\gamma$ and the area. Its proof relies on the existence of holomorhic maps to…