Skip to main content
Article thumbnail
Location of Repository

GENERATING AND COUNTING HEXAGONAL SYSTEMS

By Ivan Stoinenovi, Ratho Iolfui and Rade Onoanrof-h L

Abstract

An algorithm for generating and counting nonisonorphic hexagonal systens of the given perimeter is presented which enables us to determine the nurber of nonisomorph'ic hexagonal systems of the perimeter n up to n = 46. l.{e also detennine the number of nonisomorphic.hexagonal systems with h hexagons for h < 1,|. 1. DEFINITION AND CHARACTERIZATION tn [l.l a characterlzation of hexagonal systems is given using the words over the alphabet V = {0,I,2,3,4,5}, and a functLon f which maps the set of all the flnite oriented paths of the hexagonal grid H (r'tg. f) lnto the set V* = U Vn of all the words over the alnhabet V. It ls known n>0 that the Euclj-dean plane'can be tlled with the regular congruent hexagons. In thls sray an infinl-te hexagons grid H i

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.363.5669
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.site.uottawa.ca/~iv... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.