Differences

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

--- start [2025/12/09 15:13] – anna.frid
+++ start [2025/12/12 20:34] (current) – anna.frid
@@ Line 23: / Line 23: @@
-**December 23 2025: Savinien Kreczman**
+**January 6 2026: Louis Marin** //Maximal 2-dimensional binary words of bounded degree//
-**January 6 2026: Louis Marin**
+(Authors: Alexandre Blondin Massé, Alain Goupil, Raphael L'Heureux, Louis Marin)
-**January 20 2026: Léo Vivion**
+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**
 **February 3 2026: Annika Huch **
@@ Line 37: / Line 41: @@
 **March 17 2026: Gwenael Richomme**
-**March 30 2026: Paulina Cecchi Bernales**
+**March 31 2026: Paulina Cecchi Bernales**
 **April 14 2026: Idrissa Kaboré** //On modulo-recurrence and window complexity in infinite words//
@@ Line 44: / Line 48: @@
 **April 28 2026: [[https://kmlinux.fjfi.cvut.cz/~balkolub/| Ľubomíra Dvořáková]]** //Attractors of sequences coding beta-integers//
+**May 12 2026: Léo Vivion**
 **May 26 2026: Reem Yassawi**