We study square-tiled tori, that is, tori obtained from a finite collection of unit squares by parallel side identifications. Square-tiled can be parametrized in natural way allows to count the number tiled given square tiles. There is $\mathrm{SL}(2,\mathbf{Z})$-action on and we classify $\mathrm{SL}(2,\mathbf{Z})$-orbits using two numerical invariants easily computed. deduce exact size every ...

A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the third century. We detail the reasoning behind some of the main known solutions. Finally, we give a new solution and three ruler-and-compass constructions. We con...