On partitions and k-polygons

Access this Article

Search this Article

Author(s)

    • Doi Takuya
    • Department of Mathematical Sciences,Faculty of Integrated Arts and Sciences The University of Tokushima
    • Katayama Shin-ichi
    • Department of Mathematical Sciences,Faculty of Integrated Arts and Sciences The University of Tokushima

Abstract

Let C be a circle divided into n parts equally. The set of the ends of these parts on C are denoted by S = {P0; P1,....,Pn-1}. Let Ck(n) be the number of incongruent k-polygons inscribed in C, where the vertices of k-polygons are chosen from S. In this note, we shall investigate the generating functions of C4(n) and C5(n).

Journal

  • Journal of mathematics, the University of Tokushima

    Journal of mathematics, the University of Tokushima (44), 13-25, 2010-12

    The University of Tokushima

Codes

  • NII Article ID (NAID)
    110007870530
  • NII NACSIS-CAT ID (NCID)
    AA11595324
  • Text Lang
    ENG
  • Article Type
    departmental bulletin paper
  • ISSN
    1346-7387
  • Data Source
    NII-ELS  IR 
Page Top