An Algorithmically Unsolvable Problem in Analysis

DOI10.2307/2045124zbMATH Open0516.58043OpenAlexW4238207351MaRDI QIDQ3664097FDOQ3664097

Authors: 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Amenability and the spectrum of the Laplacian
• Title not available (Why is that?)
• 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)