整数网格子图上的斯特克洛夫特征值问题

IF 0.7 4区 数学 Q2 MATHEMATICS
Wen Han, Bobo Hua
{"title":"整数网格子图上的斯特克洛夫特征值问题","authors":"Wen Han, Bobo Hua","doi":"10.4310/cag.2023.v31.n2.a4","DOIUrl":null,"url":null,"abstract":"We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first non-trivial eigenvalue of the Dirichlet-to-Neumann operator tends to zero as the number of vertices of the subgraph tends to infinity.","PeriodicalId":50662,"journal":{"name":"Communications in Analysis and Geometry","volume":"71 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Steklov eigenvalue problem on subgraphs of integer lattices\",\"authors\":\"Wen Han, Bobo Hua\",\"doi\":\"10.4310/cag.2023.v31.n2.a4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first non-trivial eigenvalue of the Dirichlet-to-Neumann operator tends to zero as the number of vertices of the subgraph tends to infinity.\",\"PeriodicalId\":50662,\"journal\":{\"name\":\"Communications in Analysis and Geometry\",\"volume\":\"71 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications in Analysis and Geometry\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.4310/cag.2023.v31.n2.a4\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Analysis and Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.4310/cag.2023.v31.n2.a4","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 11

摘要

我们研究了整数网格 $\mathbb{Z}^n$ 的有限子图上的 Dirichlet-to-Neumann 算子的特征值。我们利用子图的顶点数来估计前 $n + 1$ 个特征值。作为推论,我们证明当子图的顶点数趋于无穷大时,Dirichlet-to-Neumann 算子的第一个非三维特征值趋于零。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Steklov eigenvalue problem on subgraphs of integer lattices
We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first non-trivial eigenvalue of the Dirichlet-to-Neumann operator tends to zero as the number of vertices of the subgraph tends to infinity.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.60
自引率
0.00%
发文量
4
审稿时长
>12 weeks
期刊介绍: Publishes high-quality papers on subjects related to classical analysis, partial differential equations, algebraic geometry, differential geometry, and topology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信