An Equivalence Relation on A Set of Words of Finite Length

Simple item page
dc.creatorMeemark, Yotsanan
dc.creatorThitipak, Tassawee
dc.date2008-04-28
dc.date.accessioned2026-07-07T09:35:37Z
dc.date.available2026-07-07T09:35:37Z
dc.descriptionIn 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, {\bf 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 $\mathbb{Z}/N\mathbb{Z}$ where $N$ is a positive integer. We have arithmetic results parallel to Bacher's.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/0804.4410
dc.identifierhttp://arxiv.org/abs/0804.4410
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159891
dc.subjectCombinatorics
dc.subjectNumber Theory
dc.subject20G40; 05E15
dc.titleAn Equivalence Relation on A Set of Words of Finite Length
dc.typetext

Files

Collections

arXiv