Enumeration formula for (2,n)-cubes in discrete planes
Résumé
We compute the number of local configurations of size 2×n on naive discrete planes using combinatorics on words, two-dimensional Rote sequences, and Berstel-Pocchiola diagrams.
We compute the number of local configurations of size 2×n on naive discrete planes using combinatorics on words, two-dimensional Rote sequences, and Berstel-Pocchiola diagrams.
Connectez-vous pour contacter le contributeur
https://hal.science/hal-00752236
Soumis le : jeudi 15 novembre 2012-11:01:03
Dernière modification le : mardi 4 novembre 2025-11:59:11