Ivan's island
  • Home
  • Blog
  • CATEGORIES
  • Rules

Kolmogorov's Button

3/3/2019

0 Comments

 
Обаждам се на приятел да го поздравя по случай рождения му ден. Разговорът е симетричен: започва с моите пожелания и завършва с неговите - да съм публикувал нещо математическо. Как да му кажа че математическите ми открития са несвързани едно с друго и имат средна дължина от 2 изречения? Такива неща никой не публикува. Затова ... решавам сам да си публикувам нещо старо, отпреди доста години.
When he was a 5-year-old boy Andrey Kolmogorov asked questions like
How many distinct patterns can you create with a thread while sewing on a four-hole button?

Unfortunately, there is no information on the Web what the answer was and had Kolmogorov found it himself. In a book about Grigori Perelman, Masha Gessen admitted that two professional mathematicians, both former students of Kolmogorov, had given different answers.

We found the number of patterns p in several cases where single-color thread was involved. We also found the number of patterns in several cases where threads of different colors c were used, including the case where the buttonholes were located on the vertices of a generic convex n-gon (i.e. a convex n-gon with no more than two diagonals intersecting at any point in its interior). Now, let us try the more complicated case involving different color threads and buttonholes located on the vertices of a “plain vanilla” regular convex n-gon and then generalize our findings with respect to all convex n-gons.

Assumptions:
A1. It is mandatory to utilize the buttonholes. There are many ways to sew on a button without utilizing the buttonholes but let us forget about them for the time being.
A2. All n buttonholes are located on the vertices of a regular convex n-gon.
A3. Different-color threads might be used for different segments between the buttonholes (where c is the number of colors).
A4. Only buttonhole-to-buttonhole connections are used. No cross-border connections are allowed.

Calculation:
1. Some of the regular convex n-gons are generic ones – those, whose number of vertices is an odd number (n = 2*q + 1) plus the square, where n = 4. We have already found (see OEIS A209916) that for the generic convex n-gons the number of patterns p is
p = ((c+1)^((n-1)*n/2) * (c*(c-1))^Binomial(n, 4)) - 1
as all possible intersections totaling Binomial(n, 4) must be counted twice when two differently painted diagonals, totaling c*(c-1), intersect (as two different patterns exist for every two colors, which you can see below).
Picture
Now we will cover those regular convex n-gons where n is an even number greater than 4 (i.e. when n = 2*q and q > 2).

2. Thanks to Bjorn Poonen and Michael Rubinstein and their paper “THE NUMBER OF INTERSECTION POINTS MADE BY THE DIAGONALS OF A REGULAR POLYGON” we know some things about regular polygons that we can use now:
a) When n = 2*q the number of diagonals intersecting at a point (except for the center of the n-gon) may be 2, 3, 4, 5, 6 or 7;
b) When n = 2*q the number of diagonals intersecting at the center of the n-gon is n/2.

3. The number of intersection points I(n) of the diagonals can be represented in the following manner: I(n) = i(2)+i(3)+i(4)+i(5)+i(6)+i(7)+i(n/2),
where i(k) (k = 2, …, 7) is the number of points where k diagonals intersect and i(n/2) is the center of the regular n-gon where n/2 diagonals intersect (in the case of n = 2*q, q > 1). Therefore, i(n/2) must be separately counted only in the cases where n = 2*q and q > 7.
​
4. In it. 1 above, we saw that two different-color threads (e.g. red and green) look differently when the threads intersect (depending on which one is on top of the other). The same is true when the number of different-color threads is 3, 4 and more (see below how many patterns are there when three differently painted diagonals intersect at a point).
Picture
Therefore, when trying to find the number of different patterns, it is not enough to count the number of edges and diagonals. We also have to count twice the cases where two different-color diagonals intersect, three times the cases where three different-color diagonals intersect etc.

5. Based on it. 2-4 above the formula in it. 1 above takes the following form:
p = (M1*M2*M3) - 1, where
Picture
and where -1 stands for the case when the button is attached to the cloth only by “0-color” threads, i.e. the case where the button is not attached at all.

6. This formula could be used for any convex n-gon, as long as we remember that in the cases of n = 2*q + 1, as well as in the cases of n = 2*q and q ≤ 7, we do not need to multiply by the third term (i.e. by M3) as the central intersection point either does not exist (when n = 2*q + 1) or had already been handled (when
n = 2*q and q ≤ 7).
0 Comments

Your comment will be posted after it is approved.


Leave a Reply.

    RSS Feed

    This website uses marketing and tracking technologies. Opting out of this will opt you out of all cookies, except for those needed to run the website. Note that some products may not work as well without tracking cookies.

    Opt Out of Cookies

    Categories

    All
    Alan Turing
    Aphorisms
    Art
    Asymmetries
    Bacillus Bulgaricus
    Economics
    Environment
    Haiku
    History
    Hr
    InEnglish
    Intelligence
    Language
    Mathematics
    Music
    Paradoxes
    Politics
    Psychology
    Readingwriting
    Seriouslessness
    Ungrammatical

    Archives

    July 2025
    June 2025
    May 2025
    April 2025
    March 2025
    February 2025
    January 2025
    December 2024
    November 2024
    October 2024
    September 2024
    August 2024
    July 2024
    June 2024
    May 2024
    April 2024
    March 2024
    February 2024
    January 2024
    December 2023
    November 2023
    October 2023
    September 2023
    August 2023
    July 2023
    June 2023
    May 2023
    April 2023
    March 2023
    February 2023
    January 2023
    December 2022
    November 2022
    October 2022
    September 2022
    August 2022
    July 2022
    June 2022
    May 2022
    April 2022
    March 2022
    February 2022
    January 2022
    December 2021
    November 2021
    October 2021
    September 2021
    August 2021
    July 2021
    June 2021
    May 2021
    April 2021
    March 2021
    February 2021
    January 2021
    December 2020
    November 2020
    October 2020
    September 2020
    August 2020
    July 2020
    June 2020
    May 2020
    April 2020
    March 2020
    February 2020
    January 2020
    December 2019
    November 2019
    October 2019
    September 2019
    August 2019
    July 2019
    June 2019
    May 2019
    April 2019
    March 2019
    February 2019
    January 2019
    December 2018
    November 2018
    October 2018
    September 2018
    August 2018
    July 2018
    June 2018
    May 2018
    April 2018
    March 2018
    February 2018
    January 2018
    December 2017
    November 2017
    October 2017
    September 2017
    August 2017
    July 2017
    June 2017
    May 2017
    April 2017
    March 2017
    February 2017
    January 2017
    December 2016
    November 2016
    October 2016
    September 2016
    August 2016
    July 2016
    June 2016
    May 2016
    April 2016
    March 2016
    February 2016
    January 2016
    December 2015
    November 2015
    October 2015
    September 2015
    August 2015
    July 2015
    June 2015
    May 2015
    April 2015
    March 2015
    February 2015
    January 2015
    December 2014
    November 2014
    October 2014
    September 2014
    August 2014
    July 2014
    June 2014
    May 2014
    April 2014
    March 2014
    February 2014
    December 2013
    November 2013
    October 2013
    September 2013
    August 2013
    July 2013
    June 2013
    May 2013
    April 2013
    March 2013
    February 2013
    January 2013
    August 2012

Powered by Create your own unique website with customizable templates.