6533b82cfe1ef96bd128eb1c
RESEARCH PRODUCT
Generalizations of the periodicity Theorem of Fine and Wilf
Filippo MignosiRaffaele Giancarlosubject
Normal subgroupDiscrete mathematicsCombinatoricsVertex-transitive graphCayley graphEfficient algorithmPattern matchingMathematicsdescription
We provide three generalizations to the two-dimensional case of the well known periodicity theorem by Fine and Wilf [4] for strings (the one-dimensional case). The first and the second generalizations can be further extended to hold in the more general setting of Cayley graphs of groups. Weak forms of two of our results have been developed for the design of efficient algorithms for two-dimensional pattern matching [2, 3, 6].
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2005-11-22 |