Monotilings

For every d#92;in#92;mathbb#123;N#125;, the groups #92;mathbb#123;Z#125;ᵈ and the groups of upper-triangular matrices of dimension d with integer entries posses particularly nice computable regular symmetric F{\o}lner monotilings for which we can provide the required computing algorithms `explicitly'..