About 3,370 results
|As an application of the previous theorem we shall prove that a rectangle can be |
decomposed into finitely many nonoverlapping ... Therefore, by our previous
theorem, b/a is rational. ... The basic idea of the proof of Dehn's theorem is
|We will call this more general result the Dehn-Thurston Theorem and will derive |
the analogue of this theorem in the setting of train tracks in Theorem 3.1.1. The
remainder of this section is devoted to a discussion of Dehn's Theorem itself; ...
|Thus, Dehn's theorem reduces the trivial link recognition problem to the free |
group recognition problem (for some class of groups). In the general case, the
free group recognition problem is undecidable. For more details see [Bir] and [BZ]
|There is a similar but simpler rational independence theorem for the tensor |
product R & R discussed in the previous set of exercises. 5.7.2. ... Dehn's
theorem The regular tetrahedron is not equidecomposable with the cube. Proof
Ifo is a ...
|SCISSORS-CONGRUENCE OF POLYHEDRA AND DEHN'S THEOREM 111 The |
problem we are discussing here is called Hilbert's Third Problem. In the same
year (1900), soon after Hilbert presented the problem, his student Max Dehn ...
|Theorem 4.9. Suppose that P is a convex polytope in R", d=3, and G(p) is a bar |
framework consisting of the vertices and edges of ... This follows a suggestion of
Lee, which has generated some interest in the various proofs of Dehn's Theorem.
|... but the formulas below seem to us self-explanatory), the construction of the |
previous section assigns to every convex (actually, not necessarily convex)
polyhedron a certain invariant, Dehn(P) ∈ R ⊗Q (R/πQ), and Dehn's Theorem
states that ...
|Second, which rectangles have perfect squarings? This question is considerably |
more difficult to answer. The result below, greatly extending Dehn's theorem (
Theorem 4), was proved by Sprague in 1940. Theorem 5 A rectangle has a