An equivalence relation on a set of words of finite length

DOI10.1016/J.EJC.2008.09.029MaRDI QIDQ1024270zbMATH OpenOpenAlexFDO

Authors Yotsanan Meemark, Tassawee Thitipak

Publication date 17 June 2009

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Abstract: In this work, we study several equivalence relations induced from the partitions of the sets of words of finite length. We have results on words over finite fields extending the work of Bacher (2002, Europ. J. Combinatorics, {�f 23}, 141-147). Cardinalities of its equivalence classes and explicit relationships between two words are determined. Moreover, we deal with words of finite length over the ring $mathbbZ/NmathbbZ$ where $N$ is a positive integer. We have arithmetic results parallel to Bacher's.

Recommendations

• Relations on words
• Equivalence relations defined by numbers of occurrences of factors
• The binomial equivalence classes of finite words
• Power sums associated with certain recursive procedures on words
• Structure of classes of circular words defined by a quadratic equivalence

Cites work

• scientific article; zbMATH DE number 3404329 (Why is no real title available?)
• SL\(_2(k)\) and a subset of words over \(k\)

This page was built for publication: An equivalence relation on a set of words of finite length

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