Differences

This shows you the differences between two versions of the page.

--- start [2025/12/11 09:19] – anna.frid
+++ start [2025/12/12 20:34] (current) – anna.frid
@@ Line 23: / Line 23: @@
-**January 6 2026: Louis Marin**
+**January 6 2026: Louis Marin** //Maximal 2-dimensional binary words of bounded degree//
+(Authors: Alexandre Blondin Massé, Alain Goupil, Raphael L'Heureux, Louis Marin)
+Let $d$ be an integer between $0$ and $4$, and $W$ be a $2$-dimensional word of dimensions $h \times w$ on the binary alphabet $\{0, 1\}$, where $h, w \in \mathbb Z > 0$. Assume that each occurrence of the letter $1$ in $W$ is adjacent to at most $d$ letters $1$. We provide an exact formula for the maximum number of letters $1$ that can occur in $W$ for fixed $(h, w)$. As a byproduct, we deduce an upper bound on the length of maximum snake polyominoes contained in a $h \times w$ rectangle.
 **January 20 2026: Savinien Kreczman**