Periodicity in rectangular arrays

From MaRDI portal
Publication:344541

DOI10.1016/J.IPL.2016.09.011zbMATH Open1392.68216arXiv1602.06915OpenAlexW2280015856MaRDI QIDQ344541FDOQ344541


Authors: Guilhem Gamard, Gwénaël Richomme, Taylor J. Smith, Jeffrey Shallit Edit this on Wikidata


Publication date: 23 November 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: We discuss several two-dimensional generalizations of the familiar Lyndon-Schutzenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We count the number of m x n arrays that are primitive. Finally, we show that one can test primitivity and compute the primitive root of an array in linear time.


Full work available at URL: https://arxiv.org/abs/1602.06915




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Periodicity in rectangular arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344541)