Equidecomposability (scissors congruence) of polyhedra in R^3 and R^4 is algorithmically decidable: Hilbert's 3rd problem revisited

MaRDI QIDQ3602153zbMATH OpenFDO

Authors Vladik Kreinovich

Publication date 12 February 2009

zbMATH Keywords

Hilbert's third problemscissors congruenceelementary geometryTarski algorithmequidecomposabilityalgorithmical decidability

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Dissections and valuations (Hilbert's third problem, etc.) (52B45)

Recommendations

• A New Approach to Hilbert's Third Problem
• A feasible algorithm for checking \(n\)-scissors congruence of polyhedra in \({\mathbb R}^d\)
• scientific article; zbMATH DE number 3947055
• Non-Euclidean geometry and volumes of hyperbolic polyhedra
• Polytopes that fill \(\mathbb{R}^ n\) and scissors congruence

Cited in

(6)

• Hilbert's third problem and a conjecture of Goncharov
• Polytopes that fill \(\mathbb{R}^ n\) and scissors congruence
• Equidecomposability of polyhedra: a solution of Hilbert's third problem in Kraków before ICM 1900
• Hinged dissections exist
• A feasible algorithm for checking \(n\)-scissors congruence of polyhedra in \({\mathbb R}^d\)
• scientific article; zbMATH DE number 3947055 (Why is no real title available?)

This page was built for publication: Equidecomposability (scissors congruence) of polyhedra in \(\mathbb R^3\) and \(\mathbb R^4\) is algorithmically decidable: Hilbert's 3rd problem revisited

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