2000 character limit reached
Universal inequalities for Dirichlet eigenvalues on discrete groups
Published 26 Jul 2020 in math.DG, math.GR, and math.PR | (2007.13157v1)
Abstract: We prove universal inequalities for Laplacian eigenvalues with Dirichlet boundary conditions on subsets of certain discrete groups. The study of universal inequalities on Riemannian manifolds was initiated by Weyl, Polya, Yau, and others. Here we focus on a version by Cheng and Yang. Specifically, we prove Yang-type universal inequalities for Cayley graphs of finitely generated amenable groups, as well as for the d-regular tree (simple random walk on the free group).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.