arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.00520math-phmath.MPmath.SP
收藏

优化光谱间隙的量子图

Quantum graphs which optimize the spectral gap

Ram Band, Guillaume Lévy

摘要:

一个有限的离散图变成一个量子(度量)图,一旦有限的长度被分配给每个边缘和一维拉普拉斯算子是采取。我们研究了谱隙(第一个正拉普拉斯特征值)对边长选择的依赖性。特别地,从一个特定的离散图开始,我们寻找一个最佳的(最大或最小)光谱间隙的量子图。我们完全解决了所有图的最小化问题。我们开发的工具,调查的最大化问题,并解决它的一些家庭的图。

英文摘要:

A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive Laplacian eigenvalue) on the choice of edge lengths. In particular, starting from a certain discrete graph, we seek the quantum graph for which an optimal (either maximal or minimal) spectral gap is obtained. We fully solve the minimization problem for all graphs. We develop tools for investigating the maximization problem and solve it for some families of graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑