Article
Keywords:
enumerative combinatorics; self-avoiding path; convex polygon
Summary:
The paper deals with counting sets of given magnitude whose elements are self-avoiding paths with nodes from a fixed set of points on a circle. Some of the obtained formulae provide new properties of entries in ``The On-line Encyclopaedia of Integer Sequences", while others generate new entries therein.
References:
[1] Kortezov I.:
Sets of non-self-intersecting paths connecting the vertices of a convex polygon. Mathematics and Informatics 65 (2022), no. 6, 546–555.
DOI 10.53656/math2022-6-4-set
[2] Kortezov I.: Sets of paths between vertices of a polygon. Mathematics Competitions 35 (2022), no. 2, 35–43.