Showing math.COShow all
2 papers · 1 filter
math.CO2003
Cantorian Tableaux and Permanents
Srečko Brlek, Michel Mendès France, John Michael Robson +1
This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its r…
math.CO2000
Hard Tiling Problems with Simple Tiles
Cristopher Moore, John Michael Robson
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and s…