On partitions and k-polygons
この論文をさがす
抄録
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 of mathematics, the University of Tokushima
-
Journal of mathematics, the University of Tokushima 44 13-25, 2010-12
徳島大学
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1050845762393844736
-
- NII論文ID
- 110007870530
-
- NII書誌ID
- AA11595324
-
- ISSN
- 13467387
-
- 本文言語コード
- en
-
- 資料種別
- departmental bulletin paper
-
- データソース種別
-
- IRDB
- CiNii Articles