Sets of Non-Self-Intersecting Paths Connecting the Vertices of a Convex Polygon

Ivaylo Kortezov
Institute of Mathematics and Informatics – BAS, Sofia, Bulgaria

https://doi.org/10.53656/math2022-6-4-set

Abstract. 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 On-line Encyclopedia of Integer Sequences, while others generate new entries therein.
Keywords: enumerative combinatorics; non-self-intersecting paths; convex polygons; OEIS

Свързани статии:

Solving Real-World Problems Using the Dynamic Mathematical Software The Teacher`s Competence Profile – Training in a University Environment The Intersection of Sports, Security, and Crypto Fan Tokens Model For Course Subject “Artificial Intelligence” For Secondary School – Conceptual And Content Perspectives