An Equivalence Relation on A Set of Words of Finite Length

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages

Scientific paper

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, {\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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Equivalence Relation on A Set of Words of Finite Length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Equivalence Relation on A Set of Words of Finite Length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Equivalence Relation on A Set of Words of Finite Length will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-691836

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.