An Algorithmically Unsolvable Problem in Analysis

DOI10.2307/2045124MaRDI QIDQ3664097zbMATH OpenOpenAlexFDO

Authors Andrew Lenard, John Stillwell

Publication date 1983

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

zbMATH Keywords

amenable fundamental groupeigenvalue of the LaplacianMarkov property

Mathematics Subject Classification ID

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

Cites work

• Amenability and the spectrum of the Laplacian
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 3246034 (Why is no real title available?)
• scientific article; zbMATH DE number 3277970 (Why is no real title available?)
• scientific article; zbMATH DE number 3390004 (Why is no real title available?)
• The word problem and the isomorphism problem for groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3664097)