We consider paths in the square lattice and use a valuation called the winding number in order to exhibit some combinatorial properties on these paths. As a corollary, we obtain a characteristic property of self-avoiding closed paths, generalizing in this way a recent result of Daurat and Nivat (2003) on the boundary properties of polyominoes concerning salient and reentrant points. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Brlek, S., Labelle, G., & Lacasse, A. (2005). A note on a result of Daurat and Nivat. In Lecture Notes in Computer Science (Vol. 3572, pp. 189–198). Springer Verlag. https://doi.org/10.1007/11505877_17
Mendeley helps you to discover research relevant for your work.