2 papers
math.CO2025
Maximal 2-dimensional binary words of bounded degree
Alexandre Blondin Massé, Alain Goupil, Ralphael L'Heureux +1
Let d be an integer between 0 and 4, and W be a 2-dimensional word of dimensions h x w on the binary alphabet {0, 1}, where h, w in Z > 0. Assume that each occurrence of the letter…
cs.DM2024
Counting Polyominoes in a Rectangle b x h
Louis Marin
In this paper, we provide methods to automatically obtain automata that generate polyominoes inscribed in a rectangle of fixed width and increasing height. We use them to obtain th…