Computer Science – Discrete Mathematics
Scientific paper
2007-10-10
Forma 22 (2007) 15-30
Computer Science
Discrete Mathematics
13 pages, 2 figures, the final version for FORMA with typo fixed
Scientific paper
In south India, there are traditional patterns of line-drawings encircling dots, called ``Kolam'', among which one-line drawings or the ``infinite Kolam'' provide very interesting questions in mathematics. For example, we address the following simple question: how many patterns of infinite Kolam can we draw for a given grid pattern of dots? The simplest way is to draw possible patterns of Kolam while judging if it is infinite Kolam. Such a search problem seems to be NP complete. However, it is certainly not. In this paper, we focus on diamond-shaped grid patterns of dots, (1-3-5-3-1) and (1-3-5-7-5-3-1) in particular. By using the knot-theory description of the infinite Kolam, we show how to find the solution, which inevitably gives a sketch of the proof for the statement ``infinite Kolam is not NP complete.'' Its further discussion will be given in the final section.
No associations
LandOfFree
Solving Infinite Kolam in Knot Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Solving Infinite Kolam in Knot Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Infinite Kolam in Knot Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-462717