SETS OF NON-SELF-INTERSECTING PATHS CONNECTING THE VERTICES OF A CONVEX POLYGON

被引:0
|
作者
Kortezov, Ivaylo [1 ]
机构
[1] Bulgarian Acad Sci, Inst Math & Informat, Acad G Bonchev St,Block 8, Sofia 1113, Bulgaria
来源
MATHEMATICS AND INFORMATICS | 2022年 / 65卷 / 06期
关键词
enumerative combinatorics; non-self-intersecting paths; convex polygons; OEIS;
D O I
10.53656/math2022-6-4-set
中图分类号
G40 [教育学];
学科分类号
040101 ; 120403 ;
摘要
The paper deals with counting the sets of non-self-intersecting paths whose nodes form a partitioning of the set of vertices of a given convex polygon. There turn to exist compact formulae when the magnitude of these sets is fixed. Some of these formulae provide new properties for some of the entries of the Online Encyclopedia of Integer Sequences, while others generate new entries therein.
引用
收藏
页码:546 / 555
页数:10
相关论文
共 11 条