Critical connectedness of thin arithmetical discrete planes
Résumé
The critical thickness of an arithmetical discrete plane refers to the infimum thickness that preserves its $2$-connectedness. This infimum thickness can be computed thanks to a multidimensional continued fraction algorithm, namely the fully subtractive algorithm. We provide a characterization of the discrete planes with critical thickness that contain the origin and that are $2$-connected.