2002/10/17 by S. Kitaev, Kitaev, S., T. Mansour +1
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.math/0210268
9 pages, 1 figure
arxiv created 2002/10/17 · arxiv updated 2009/11/30
We introduce Peano words, which are words corresponding to finite approximations of the Peano space filling curve. We then find the number of occurrences of certain patterns in these words.