An Algorithmically Unsolvable Problem in Analysis

DOI10.2307/2045124zbMath0516.58043OpenAlexW4238207351MaRDI QIDQ3664097

Andrew Lenard, John Stillwell

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/2045124

zbMATH Keywords

Markov propertyeigenvalue of the Laplacianamenable fundamental group

Mathematics Subject Classification ID

Spectral problems; spectral geometry; scattering theory on manifolds (58J50) Undecidability and degrees of sets of sentences (03D35) Global Riemannian geometry, including pinching (53C20) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Potential theory on Riemannian manifolds and other spaces (31C12)

Cites Work

• The word problem and the isomorphism problem for groups
• Amenability and the spectrum of the Laplacian
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algorithmically Unsolvable Problem in Analysis