de Bruijn arrays for L-fillings

TL;DR

This paper introduces a method using modular arithmetic to construct de Bruijn arrays that encompass all possible fillings of a specific 2x2 array shape with digits from a finite set.

Contribution

The paper presents a novel construction of de Bruijn arrays for L-fillings using modular arithmetic techniques.

Findings

Constructed de Bruijn arrays include all L-fillings.

Method applies to any digit set size k.

Efficient generation of all fillings achieved.

Abstract

We use modular arithmetic to construct a de Bruijn array containing all fillings of an L (a 2 x 2 array with the upper right corner removed) with digits chosen from {0,...,k-1}.