Questions tagged [scissors-congruence]
Equidecomposability of polyhedra under cutting-and-pasting along faces, and generalizations. Hilbert's third problem, Dehn's invariants. Homological developments motivated by these issues.
22 questions
3
votes
2
answers
450
views
Recent progress towards $K_0$ of the category of $k$-varieties?
Let $\text{Var}_k$ be the category of varieties over $k$. The Grothendieck ring of $\text{Var}_k$ is the ring
$$K_0(\text{Var}_k)= \{\text{isomorphism classes of finite type varieties over }k \}/([X]=[...
2
votes
0
answers
187
views
Étale-multiplicative motivic measures
Recall that a motivic measure is a function $\mu$ that associates to each variety $X/k$ an element of some ring $R$, such that
If $X\cong X'$ then $\mu(X)=\mu(X')$.
If $Y\subseteq X$ is a closed ...
- 211
10
votes
0
answers
240
views
Do cut-length-minimizing equidissections exist?
Suppose $A,B$ are polygons of equal area. By the Wallace-Bolyai-Gerwien theorem, $A$ and $B$ are equidissectable: we can make finitely many straight-line cuts in $A$ and rearrange the resulting pieces ...
- 19.1k
6
votes
1
answer
251
views
Looking for clarification of C-H Sah's definition of abstract scissors congruence
In C-H Sah's book Hilbert's third problem: scissors congruence, the author defines the data for abstract scissors congruence in order to prove Zylev's theorem by combinatorial means in great ...
8
votes
1
answer
930
views
Importance of third homology of $\operatorname{SL}_{2}$ over a field
$\DeclareMathOperator\SL{SL}$I am reading some papers about the third homology of linear groups. In particular for the $\SL_{2}$ over a field. Why is it important to study these homologies?
I have ...
- 269
3
votes
2
answers
354
views
Partition of polygons into 'congruent sets of polygons'
Definition: Two finite sets of polygons $A$ and $B$ are congruent if we can match polygons in $A$ in a one-one manner with polygons in $B$ with each matched pair of polygons mutually congruent.
...
- 7,583
3
votes
1
answer
114
views
Scissor congruence for foliated polygons
Given two polygons of equal area with horizontal foliations, can one describe the obstruction (if there is any but I suspect the answer to be yes) to scissor-equivalence respecting the horizontal ...
- 18.6k
21
votes
3
answers
1k
views
Cutting of a regular polygon into congruent pieces
Question. For which $N$ it is possible to cut a regular $N$-gon into congruent pieces such that the center of the regular polygon lies strictly inside one of the pieces? For $N=3,4$ there are trivial ...
- 701
2
votes
1
answer
359
views
On a possible variant of Monsky's theorem
See Wikipedia for Monsky's theorem which states: it is not possible to dissect a square into an odd number of triangles all of equal area.
Questions: Are there quadrilaterals that allow partition into ...
- 7,583
2
votes
1
answer
334
views
Cutting polygons into mutually similar and non-congruent pieces
It is well-known that a square can be cut into a finite number of squares all of mutually different sides (hence mutually non-congruent) - for example, see https://en.wikipedia.org/wiki/...
- 7,583
2
votes
1
answer
246
views
On congruent partitions of planar regions
Given any integer $n$, any rectangular region or any sector of a disc (including the full disk as a boundary case) can be cut into $n$ mutually congruent pieces - by equally spaced parallel lines and ...
- 7,583
6
votes
1
answer
304
views
Is Sydler's theorem concerning Dehn invariants constructive?
Sydler proved something of a converse to Dehn's negative resolution
of Hilbert's 3rd problem. To quote Wikipedia, Sydler showed that
"every two Euclidean polyhedra with the same volumes and Dehn ...
- 154k
6
votes
1
answer
636
views
Cutting the unit square into pieces with rational length sides
The following questions seem related to the still open question whether there is a point(s) whose distances from the 4 corners of a unit square are all rational.
To cut a unit square into n (a finite ...
- 7,583
2
votes
0
answers
631
views
On dissecting a triangle into another triangle
It is easy to see that an equilateral triangle can be cut into 2 identical 30-60-90 degrees right triangles which can then be patched together to form a 30-30-120 degrees triangle. So, via 2 ...
- 7,583
2
votes
1
answer
822
views
Partitioning polygons into acute isosceles triangles
Question: Given an $N$-vertex polygon (not necessarily convex). It is to be cut into the least number of acute isosceles triangles.
Based on this MathSE discussion, one can think of a method to get $\...
- 7,583