{"id":966,"date":"2025-08-14T18:07:23","date_gmt":"2025-08-14T18:07:23","guid":{"rendered":"https:\/\/summergeometry.org\/sgi2025\/?p=966"},"modified":"2025-08-14T18:07:25","modified_gmt":"2025-08-14T18:07:25","slug":"hex-marks-the-spot","status":"publish","type":"post","link":"https:\/\/summergeometry.org\/sgi2025\/hex-marks-the-spot\/","title":{"rendered":"Hex Marks the Spot"},"content":{"rendered":"\n

How can we extend the 2-close interaction to a general n<\/em>-close interaction?<\/strong><\/p>\n\n\n\n

That was the question at the end of the triangle’s hex <\/a>blog post. This post goes through the thought process and tools used to solve for the sequence that extends the 2-close interaction to a general \\(n\\)-close interaction.<\/p>\n\n\n\n

The approach here focused on analyzing the rotation of the dual structure and determining the precise amount of rotation required to arrive at the desired \\(n\\)-case configuration. This result was obtained by solving a relatively simple Euclidean geometry subproblem, which sometimes is encountered as a canonical geometry problem at the secondary or high-school level. Through this perspective, a closed-form starting <\/strong>step<\/em> for the general sequence was successfully derived. <\/p>\n\n\n\n

OPEN FOR SPOILER FOR ANSWER<\/summary>\n

The rotation angle, \\(\\theta\\), required to obtain a part of the<\/strong><\/em> the \\(n\\)-close interaction term in the dual is given by: <\/p>\n\n\n\n

$$
\\theta = 60 \\ – \\ \\sin^{-1} \\left( \\frac{3 n}{2 \\sqrt{3 (n^2 + n + 1)}} \\right)
$$<\/p>\n<\/details>\n\n\n\n

As with many mathematical problems, there are multiple approaches to reach the same result. I really encourage you to explore doing it yourself but without further ado, here is the presentation of the thought process that led to this solution.<\/p>\n\n\n\n

By the way, the working name for this article was
Hex and the City: Finding Your N-Closest Neighbors<\/em> ,
if you read all this way, I think you at least deserve to know this. <\/p>\n\n\n\n

\n\n\n\n

Constructing the Solution <\/h2>\n\n\n\n

We start off where we left off in the Auxiliary Insights section of the last blog post.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

Recall that a rotation by \\(60^\\circ\\) returns us to the original dual line due to the underlying sixfold symmetry. For the \\(2\\)-close interaction, we introduced a new dual by halving this angle to $30^\\circ$. Naturally, to explore the \\(3\\)-close case, one might attempt the naive approach of halving again to $15^\\circ$. However, as seen below, this approah does not yield the desired result, indicating that the simple halving approach cannot be extended straightforwardly.<\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

By manually guessing and checking the rotation values, we end up with a somewhat unexpected sequence, something that, for me at least, is nothing immediately obvious. <\/p>\n\n\n\n

\"\"<\/figure>\n\n\n\n

This hints at the need to uncover a more subtle structure that lets us analytically determine the values we seek. <\/p>\n\n\n\n

Some prerequisite background is provided in the next section, but if you\u2019re already familiar, feel free to skip ahead to the solution process that builds on these ideas.<\/p>\n\n\n\n

\n\n\n\n

Some useful underlying mathematics prerequisites that could help<\/h3>\n\n\n\n
Modular Arithmetic<\/summary>\n

A Quick Introduction to Modular Arithmetic<\/h3>\n\n\n\n

Modular arithmetic is a system of arithmetic for integers where numbers “wrap around” after reaching a certain value called the modulus<\/em>. Rather than focusing on the full quotient of a division, modular arithmetic concerns itself with the remainder<\/strong>. It is a foundational concept in number theory and has wide applications in cryptography, computer science, and abstract algebra.<\/p>\n\n\n\n

Motivation<\/h4>\n\n\n\n

Suppose you are working with a standard 12-hour clock. If the current time is 9 and 5 hours pass, the clock shows 2, not 14. This is because clocks operate “modulo 12”, meaning we consider two numbers equivalent if they differ by a multiple of 12. So:<\/p>\n\n\n\n

$$
9 + 5 = 14 \\equiv 2 \\pmod{12}
$$<\/p>\n\n\n\n

This is a basic example of modular arithmetic: rather than computing the full sum, we reduce it to its residue modulo 12<\/em>.<\/p>\n\n\n\n

Definition<\/h4>\n\n\n\n

Let \\(n \\) be a fixed positive integer, called the modulus<\/strong>. For any integers \\(a \\) and \\(b \\), we say:<\/p>\n\n\n\n

$$
a \\equiv b \\pmod{n}
$$<\/p>\n\n\n\n

(read as “a is congruent to b modulo n”) if and only if \\(n \\) divides \\(a – b \\); that is, there exists an integer \\(k \\) such that:<\/p>\n\n\n\n

$$
a – b = kn
$$<\/p>\n\n\n\n

This defines an equivalence relation on the set of integers \\(\\mathbb{Z} \\), which partitions \\(\\mathbb{Z} \\) into \\(n \\) distinct congruence classes<\/em> modulo \\(n \\). Each class contains all integers with the same remainder upon division by \\(n \\).<\/p>\n\n\n\n

For example, with \\(n = 5 \\), the integers are grouped into the following classes:<\/p>\n\n\n\n

$$
[0] = { \\dots, -10, -5, 0, 5, 10, \\dots }
$$<\/p>\n\n\n\n

$$
[1] = { \\dots, -9, -4, 1, 6, 11, \\dots }
$$<\/p>\n\n\n\n

$$
[2] = { \\dots, -8, -3, 2, 7, 12, \\dots }
$$<\/p>\n\n\n\n

$$
[3] = { \\dots, -7, -2, 3, 8, 13, \\dots }
$$<\/p>\n\n\n\n

$$
[4] = { \\dots, -6, -1, 4, 9, 14, \\dots }
$$<\/p>\n\n\n\n

Each integer belongs to exactly one of these classes. For computational purposes, we usually represent each class by its smallest non-negative element, i.e., by the residue<\/em> \\(r \\in {0, 1, \\dots, n-1} \\).<\/p>\n\n\n\n

Arithmetic in \\(\\mathbb{Z}\/n\\mathbb{Z} \\)<\/h4>\n\n\n\n

The set of congruence classes modulo \\(n \\), denoted \\(\\mathbb{Z}\/n\\mathbb{Z} \\), forms a ring under addition and multiplication defined by:<\/p>\n\n\n\n

    \n
  • \\([a] + [b] := [a + b] \\)<\/li>\n\n\n\n
  • \\([a] \\cdot [b] := [ab] \\)<\/li>\n<\/ul>\n\n\n\n

    These operations are well-defined: if \\(a \\equiv a’ \\pmod{n} \\) and \\(b \\equiv b’ \\pmod{n} \\), then \\(a + b \\equiv a’ + b’ \\pmod{n} \\) and \\(ab \\equiv a’b’ \\pmod{n} \\).<\/p>\n\n\n\n

    If \\(n \\) is prime, \\(\\mathbb{Z}\/n\\mathbb{Z} \\) is a finite field, meaning every nonzero element has a multiplicative inverse.<\/p>\n\n\n\n

    Formal Summary<\/h4>\n\n\n\n

    Modular arithmetic generalizes the idea of remainders after division. Formally, for a fixed modulus \\(n \\in \\mathbb{Z}_{>0} \\), we say:<\/p>\n\n\n\n

    $$
    a \\equiv b \\pmod{n} \\iff n \\mid (a – b)
    $$<\/p>\n\n\n\n

    This defines a congruence relation on \\(\\mathbb{Z} \\), leading to a system where calculations “wrap around” modulo \\(n \\). It is a central structure in elementary number theory, forming the foundation for deeper topics such as finite fields, Diophantine equations, and cryptographic algorithms.<\/p>\n<\/details>\n\n\n\n

    Law Of Sines<\/summary>\n

    Derivation of the Law of Sines<\/h3>\n\n\n\n

    The Law of Sines<\/em><\/strong> is a fundamental result in trigonometry that relates the sides of a triangle to the sines of their opposite angles. This elegant identity allows us to find unknown angles or sides in oblique triangles using simple trigonometric ratios.<\/p>\n\n\n\n

    Setup and Construction<\/h4>\n\n\n\n

    Consider an arbitrary triangle \\(\\triangle ABC \\) with:<\/p>\n\n\n\n

      \n
    • \\(a = BC \\)<\/li>\n\n\n\n
    • \\(b = AC \\)<\/li>\n\n\n\n
    • \\(c = AB \\)<\/li>\n<\/ul>\n\n\n\n

      To derive the Law of Sines, we draw an altitude<\/em><\/strong> from vertex \\(A \\) perpendicular to side \\(BC \\), and denote this height as \\(h \\).<\/p>\n\n\n\n

      Now consider the two right triangles formed by this altitude:<\/p>\n\n\n\n

        \n
      • In \\(\\triangle ABC \\), using angle \\(B \\): $$
        \\sin B = \\frac{h}{a} \\quad \\Rightarrow \\quad h = a \\sin B
        $$<\/li>\n\n\n\n
      • Using angle \\(C \\): $$
        \\sin C = \\frac{h}{b} \\quad \\Rightarrow \\quad h = b \\sin C
        $$<\/li>\n<\/ul>\n\n\n\n

        Since both expressions equal \\(h \\), we equate them:<\/p>\n\n\n\n

        $$
        a \\sin B = b \\sin C
        $$<\/p>\n\n\n\n

        Rewriting this gives:<\/p>\n\n\n\n

        $$
        \\frac{a}{\\sin C} = \\frac{b}{\\sin B}
        $$<\/p>\n\n\n\n

        We can repeat this construction by drawing altitudes from the other vertices to derive similar relationships:<\/p>\n\n\n\n

        $$
        \\frac{b}{\\sin A} = \\frac{c}{\\sin B}, \\quad \\frac{c}{\\sin A} = \\frac{a}{\\sin C}
        $$<\/p>\n\n\n\n

        Combining all, we obtain the complete Law of Sines<\/em><\/strong>:<\/p>\n\n\n\n

        $$
        \\frac{a}{\\sin A} = \\frac{b}{\\sin B} = \\frac{c}{\\sin C}
        $$<\/p>\n\n\n\n

        Geometric Interpretation<\/h4>\n\n\n\n

        The Law of Sines implies that in any triangle<\/em><\/strong>, the ratio of a side to the sine of its opposite angle is constant<\/em><\/strong>. In fact, this constant equals \\(2R \\), where \\(R \\) is the radius of the circumcircle<\/em><\/strong> of the triangle:<\/p>\n\n\n\n

        $$
        \\frac{a}{\\sin A} = \\frac{b}{\\sin B} = \\frac{c}{\\sin C} = 2R
        $$<\/p>\n\n\n\n

        This shows a deep geometric connection between triangles, circles, reflecting the underlying<\/em> <\/em><\/strong>symmetry<\/em> of some parts of Euclidean<\/strong> geometry.<\/p>\n<\/details>\n\n\n\n

        Law Of Cosines (generalisation of Pythagorean theorem)<\/summary>\n

        Derivation of the Cosine Angle Formula<\/h3>\n\n\n\n

        The cosine angle formula<\/em><\/strong>, also known as the Law of Cosines<\/em><\/strong>, relates the lengths of the sides of a triangle to the cosine of one of its angles. <\/p>\n\n\n\n

        Motivation<\/h4>\n\n\n\n

        Consider a triangle with sides of lengths \\(a \\), \\(b \\), and \\(c \\), and let \\(\\theta \\) be the angle opposite side \\(c \\). When \\(\\theta \\) is a right angle, the Pythagorean theorem<\/em><\/strong> applies:<\/p>\n\n\n\n

        $$
        c^2 = a^2 + b^2
        $$<\/p>\n\n\n\n

        For any angle \\(\\theta \\), the Law of Cosines<\/em><\/strong> generalizes this relationship:<\/p>\n\n\n\n

        $$
        c^2 = a^2 + b^2 – 2ab \\cos \\theta
        $$<\/p>\n\n\n\n

        This formula allows us to find a missing side or angle in any triangle, not just right triangles.<\/p>\n\n\n\n

        Setup and Coordinate Placement<\/h4>\n\n\n\n

        To derive the formula, place the triangle in the coordinate plane:<\/p>\n\n\n\n

          \n
        • Place vertex \\(A \\) at the origin \\((0, 0) \\).<\/li>\n\n\n\n
        • Place vertex \\(B \\) on the positive x-axis at \\((b, 0) \\).<\/li>\n\n\n\n
        • Place vertex \\(C \\) at \\((x, y) \\), such that the angle at \\(A \\) is \\(\\theta \\).<\/li>\n<\/ul>\n\n\n\n

          By definition, the length \\(a \\) is the distance from \\(B \\) to \\(C \\), and \\(c \\) is the length from \\(A \\) to \\(C \\).<\/p>\n\n\n\n

          Since \\(\\theta \\) is the angle at \\(A \\), the coordinates of \\(C \\) can be expressed using polar coordinates<\/em> relative to \\(A \\):<\/p>\n\n\n\n

          $$
          C = (a \\cos \\theta, a \\sin \\theta)
          $$<\/p>\n\n\n\n

          Distance Calculation<\/h4>\n\n\n\n

          The length \\(c \\) is the distance between points \\(A(0,0) \\) and \\(C(a \\cos \\theta, a \\sin \\theta) \\):<\/p>\n\n\n\n

          $$
          c = \\sqrt{(a \\cos \\theta – 0)^2 + (a \\sin \\theta – 0)^2} = a
          $$<\/p>\n\n\n\n

          Actually, to keep consistent with the notation, let’s redefine:<\/p>\n\n\n\n

            \n
          • \\(AB = c \\)<\/li>\n\n\n\n
          • \\(AC = b \\)<\/li>\n\n\n\n
          • \\(BC = a \\)<\/li>\n<\/ul>\n\n\n\n

            So placing:<\/p>\n\n\n\n

              \n
            • \\(A = (0, 0) \\)<\/li>\n\n\n\n
            • \\(B = (c, 0) \\)<\/li>\n\n\n\n
            • \\(C = (x, y) \\)<\/li>\n<\/ul>\n\n\n\n

              with angle \\(\\theta = \\angle A \\) at point \\(A \\).<\/p>\n\n\n\n

              Point \\(C \\) has coordinates:<\/p>\n\n\n\n

              $$
              C = (b \\cos \\theta, b \\sin \\theta)
              $$<\/p>\n\n\n\n

              The length \\(a = BC = \\) distance between \\(B(c, 0) \\) and \\(C(b \\cos \\theta, b \\sin \\theta) \\):<\/p>\n\n\n\n

              $$
              a^2 = (b \\cos \\theta – c)^2 + (b \\sin \\theta – 0)^2
              $$<\/p>\n\n\n\n

              Expanding:<\/p>\n\n\n\n

              $$
              a^2 = (b \\cos \\theta – c)^2 + (b \\sin \\theta)^2
              = (b \\cos \\theta)^2 – 2bc \\cos \\theta + c^2 + b^2 \\sin^2 \\theta
              $$<\/p>\n\n\n\n

              Simplify using the fundamental trigonometric identity<\/em><\/strong> \\(\\cos^2 \\theta + \\sin^2 \\theta = 1 \\):<\/p>\n\n\n\n

              $$
              a^2 = b^2 \\cos^2 \\theta – 2bc \\cos \\theta + c^2 + b^2 \\sin^2 \\theta = b^2(\\cos^2 \\theta + \\sin^2 \\theta) – 2bc \\cos \\theta + c^2
              $$<\/p>\n\n\n\n

              $$
              a^2 = b^2 – 2bc \\cos \\theta + c^2
              $$<\/p>\n\n\n\n

              This is the Law of Cosines<\/em><\/strong>, it states that for any triangle with sides \\(a, b, c \\) and angle \\(\\theta \\) opposite side \\(a \\):<\/p>\n\n\n\n

              $$
              a^2 = b^2 + c^2 – 2bc \\cos \\theta
              $$<\/p>\n\n\n\n

              This formula generalizes<\/strong> the Pythagorean theorem<\/em><\/strong> and allows computation of unknown sides or angles in any triangle, making it fundamental in trigonometry and geometry.<\/p>\n<\/details>\n\n\n\n

              Height of a Regular Hexagon of Side Length, \\(a\\)<\/summary>\n

              Find the height of a regular hexagon with side length \\(a\\)<\/h3>\n\n\n\n

              Understand the structure of a regular hexagon<\/h4>\n\n\n\n
                \n
              • A regular hexagon can be divided into 6 equilateral triangles<\/strong>.<\/li>\n\n\n\n
              • Each triangle has side length \\(a\\).<\/li>\n\n\n\n
              • The height<\/strong> of the hexagon is the distance between two parallel sides<\/strong>, i.e., it’s twice the height of one equilateral triangle<\/strong> formed inside.<\/li>\n<\/ul>\n\n\n\n

                So:<\/p>\n\n\n\n

                $$
                \\text{height of hexagon} = 2 \\times \\text{height of equilateral triangle with side } a
                $$<\/p>\n\n\n\n

                Use formula for height of an equilateral triangle<\/h4>\n\n\n\n

                The height \\(h\\) of an equilateral triangle with side length \\(a\\) is:<\/p>\n\n\n\n

                $$
                h = a \\cdot \\sin(60^\\circ)
                $$<\/p>\n\n\n\n

                We use this since the height splits the triangle into two right triangles with angles \\(30^\\circ, 60^\\circ, 90^\\circ\\).<\/p>\n\n\n\n

                Substitute:<\/p>\n\n\n\n

                $$
                \\sin(60^\\circ) = \\frac{\\sqrt{3}}{2}
                $$<\/p>\n\n\n\n

                So:<\/p>\n\n\n\n

                $$
                h = a \\cdot \\frac{\\sqrt{3}}{2}
                $$<\/p>\n\n\n\n

                Multiply by 2 to get full hexagon height<\/h4>\n\n\n\n

                $$
                \\text{Height of hexagon} = 2 \\cdot \\left( a \\cdot \\frac{\\sqrt{3}}{2} \\right)
                $$<\/p>\n\n\n\n

                Yielding Result:<\/h6>\n\n\n\n

                $$
                \\text{Height of a regular hexagon with side length } a = a \\sqrt{3}
                $$<\/p>\n<\/details>\n\n\n\n

                Limits at infinity<\/summary>\n

                Limits at Infinity: A Conceptual Overview<\/h3>\n\n\n\n

                In mathematical analysis, the notion of a limit at infinity<\/em> provides a rigorous framework for understanding the behavior of functions as their input grows arbitrarily large in magnitude. Specifically, we are interested in the asymptotic behavior of a function \\(f(x) \\) as \\(x \\to \\infty \\) (or \\(x \\to -\\infty \\)), that is, how \\(f(x) \\) behaves for sufficiently large values of \\(x \\).<\/p>\n\n\n\n

                Formally, we say that
                $$
                \\lim_{x \\to \\infty} f(x) = L
                $$
                if for every \\(\\varepsilon > 0 \\), there exists a real number \\(N \\) such that
                $$
                x > N \\Rightarrow |f(x) – L| < \\varepsilon.
                $$
                This definition captures the idea that the values of \\(f(x) \\) can be made arbitrarily close to \\(L \\) by taking \\(x \\) sufficiently large.<\/p>\n\n\n\n

                Limits at infinity play a crucial role in the study of convergence, asymptotics, and the global behavior of functions.<\/p>\n<\/details>\n\n\n\n

                \n\n\n\n

                Continuing to derive the solution<\/h2>\n\n\n\n

                Simplifying the focus<\/h3>\n\n\n\n

                We begin by exploiting the inherent sixfold rotational symmetry, we reduce the problem “modulo 6”-style, effectively restricting our attention to a single fundamental sector (i.e one \\(60\\) degree sector). By doing so we simplify the analysis to just one representative section within this equivalence class.<\/p>\n\n\n\n

                \"\"<\/figure>\n\n\n\n

                If we restrict our view to along the direction of the blue arrow, we observe that the rotation lines align to form a straight “line” sequence. This linear arrangement reveals an underlying order that we can potentially use.<\/p>\n\n\n\n

                \"\"<\/figure>\n\n\n\n

                To proceed, we now seek an invariant<\/em>, a quantity or structure that remains stable under the transformations, under consideration. The natural approach here is to introduce an auxiliary red<\/strong> arrow, aligned with the reference direction. By connecting this to each rotation line, we form triangles with a common “base”. <\/p>\n\n\n\n

                \"\"<\/figure>\n\n\n\n

                Let us now regard each line as encoding an angular offset, specifically, a rotation relative to a fixed reference direction given by the dark blue line<\/em> (dual<\/em>). , We can think of the red arrow as some sort of basis vector corresponding to the blue line . Our aim is to compute the rotational offset of each line with respect to this reference frame, treating the red arrow as a canonical representative of the direction encoded by the dark blue line.<\/p>\n\n\n\n

                Finding the general formula for the offset angle between the red arrow (a representation of the original dual) AND the \\(n\\)-case triangle<\/h3>\n\n\n\n
                \"\"
                Dotted lines here are the lines we saw in the image earlier<\/figcaption><\/figure>\n\n\n\n

                Given:<\/h4>\n\n\n\n
                  \n
                • Triangle with two sides:<\/li>\n\n\n\n
                • Side 1: \\(a \\sqrt{3}\\)<\/li>\n\n\n\n
                • Side 2: \\(a n \\sqrt{3}\\)<\/li>\n\n\n\n
                • Included angle between them: \\(120^\\circ\\)<\/li>\n\n\n\n
                • Goal: Find the angle \\(A\\), opposite to the side \\(a n \\sqrt{3}\\)<\/li>\n<\/ul>\n\n\n\n

                  Step 1: Use Law of Cosines to find the third side<\/h4>\n\n\n\n

                  $$
                  c^2 = \\alpha^2 + \\beta^2 – 2 \\alpha \\beta \\cos(C)
                  $$<\/p>\n\n\n\n

                  Assign:<\/p>\n\n\n\n

                    \n
                  • \\( \\alpha = a \\sqrt{3}\\)<\/li>\n\n\n\n
                  • \\(\\beta = a n \\sqrt{3}\\)<\/li>\n\n\n\n
                  • \\(C = 120^\\circ\\)<\/li>\n<\/ul>\n\n\n\n

                    $$
                    c^2 = (a \\sqrt{3})^2 + (a n \\sqrt{3})^2 – 2 (a \\sqrt{3})(a n \\sqrt{3}) \\cos(120^\\circ)
                    $$<\/p>\n\n\n\n

                    Evaluate:<\/p>\n\n\n\n

                      \n
                    • \\((a \\sqrt{3})^2 = 3 a^2\\)<\/li>\n\n\n\n
                    • \\((a n \\sqrt{3})^2 = 3 a^2 n^2\\)<\/li>\n\n\n\n
                    • \\(2ab = 6 a^2 n\\)<\/li>\n\n\n\n
                    • \\(\\cos(120^\\circ) = -\\frac{1}{2}\\)<\/li>\n<\/ul>\n\n\n\n

                      $$
                      c^2 = 3 a^2 + 3 a^2 n^2 + 3 a^2 n
                      $$<\/p>\n\n\n\n

                      $$
                      c^2 = 3 a^2 (n^2 + n + 1)
                      $$<\/p>\n\n\n\n

                      $$
                      c = a \\sqrt{3 (n^2 + n + 1)}
                      $$<\/p>\n\n\n\n

                      Step 2: Use Law of Sines to find the angle opposite to \\(a n \\sqrt{3}\\)<\/h4>\n\n\n\n

                      $$
                      \\frac{\\sin A}{a n \\sqrt{3}} = \\frac{\\sin(120^\\circ)}{c}
                      $$<\/p>\n\n\n\n

                      Substitute:<\/p>\n\n\n\n

                        \n
                      • \\(\\sin(120^\\circ) = \\frac{\\sqrt{3}}{2}\\)<\/li>\n\n\n\n
                      • \\(c = a \\sqrt{3 (n^2 + n + 1)}\\)<\/li>\n<\/ul>\n\n\n\n

                        $$
                        \\sin A = \\frac{a n \\sqrt{3}}{a \\sqrt{3 (n^2 + n + 1)}} \\times \\frac{\\sqrt{3}}{2}
                        $$<\/p>\n\n\n\n

                        Cancel \\(a\\):<\/p>\n\n\n\n

                        $$
                        \\sin A = \\frac{n \\sqrt{3}}{\\sqrt{3 (n^2 + n + 1)}} \\times \\frac{\\sqrt{3}}{2}
                        $$<\/p>\n\n\n\n

                        $$
                        \\sin A = \\frac{3 n}{2 \\sqrt{3 (n^2 + n + 1)}}
                        $$<\/p>\n\n\n\n

                        Final Result for the ? angle:<\/h4>\n\n\n\n

                        $$
                        A = \\sin^{-1} \\left( \\frac{3 n}{2 \\sqrt{3 (n^2 + n + 1)}} \\right)
                        $$<\/p>\n\n\n\n

                        Adjusting the Sequence for clearer understanding of the Asymptotics <\/h2>\n\n\n\n

                        We can now utilize the function defined above to generate the desired terms in the sequence. This brings us close to our objective. Upon closer inspection, we observe that the sequence aligns particularly well when interpreted as an angular offset. Specifically, as illustrated in the image below, we begin with the blue line corresponding to the case \\(n = 0\\), and for each subsequent value of \\(n\\), we proceed in a clockwise direction. (These lines correspond to the dotted rays shown in the previous image.)<\/p>\n\n\n\n

                        \"\"<\/figure>\n\n\n\n


                        <\/p>\n\n\n\n

                        Drawing a link between the symmetry and this <\/h4>\n\n\n\n

                        Originally, by leveraging the underlying symmetry of the problem, we simplified the analysis by focusing in a single direction, meaning in other words, we can intuitively infer that the sequence \u201cresets\u201d every 60 degrees. <\/p>\n\n\n\n

                        Now instead, we can analyze the limiting behavior of the relevant angle in the \\(n\\)-th triangle considered earlier. As \\(n\\) grows large, the angle opposite the red line (the \\(a \\sqrt{3}\\) side), which we denote by \\(\\omega\\), decreases towards zero. Formally, this can be expressed as<\/p>\n\n\n\n

                        $$
                        \\lim_{n \\to \\infty} \\omega = 0.
                        $$<\/p>\n\n\n\n

                        Using the triangle angle sum formula, the angle of interest (the ?, but lets call it \\(\\phi\\)), satisfies<\/p>\n\n\n\n

                        $$
                        \\phi = 180^\\circ – 120^\\circ – \\omega.
                        $$<\/p>\n\n\n\n

                        Therefore,<\/p>\n\n\n\n

                        $$
                        \\lim_{n \\to \\infty} \\phi = 60^\\circ,
                        $$<\/p>\n\n\n\n

                        showing that the sequence converges to \\(60^\\circ\\).<\/p>\n\n\n\n

                        Final Adjustment of the formula to reflect the rotation of the original dual and the intuition above<\/h4>\n\n\n\n

                        Thus, from both a mathematical (okay maybe more so an aesthetic) standpoint, it is preferable to redefine the sequence so that it converges to zero. This aligns with the conceptual goal of determining ‘how much to rotate’ the original dual structure to obtain the \\(n\\)-th dual. In its current form, the sequence converges to a fixed offset (specifically, \\(60^\\circ\\)), which, at first glance, is not immediately apparent from the formula.<\/p>\n\n\n\n

                        To clarify what is meant by ‘converging to zero’: when we rotate the original dual by any multiple of \\(60^\\circ\\) (i.e., an element of \\(60\\mathbb{Z}\\)), we return to the original dual; similarly, a rotation by \\(30\\mathbb{Z}\\) yields the 2-close interaction. In this context, we seek a rotation angle \\(\\theta\\) such that \\(\\theta \\cdot \\mathbb{Z}\\) captures the \\(n\\)-close interaction, and thus, it is natural to define \\(\\theta\\) as a function of \\(n\\) that tends to zero as \\(n \\to \\infty\\). This reframing reveals the underlying structure more clearly and places the emphasis on the relative rotation required to reach the \\(n\\)-th configuration from the base case.<\/p>\n\n\n\n

                        This sequence tending to zero carries a natural interpretation: it suggests diminishing deviation or adjustment over time. This aligns well with the intuition that as \\(n\\) increases, the system or pattern is \u201csettling down\u201d or tending to the reset point. In contrast, convergence to a nonzero constant may obscure this interpretation (unless you know a-priory about the symmetries of this system) , since the presence of a persistent offset implies a kind of residual asymmetry or imbalance. By ensuring that the sequence vanishes asymptotically, we emphasize convergence toward a limiting behavior centered at zero.<\/p>\n\n\n\n

                        This was the justification to introducing a subtraction of 60 in front of the A earlier to consider the sequence in the original notion of rotation of the dual instead. Yielding us <\/p>\n\n\n\n

                        $$
                        \\theta = 60 \\ – \\ A
                        $$<\/p>\n\n\n\n

                        $$
                        \\theta = 60 \\ – \\ \\sin^{-1} \\left( \\frac{3 n}{2 \\sqrt{3 (n^2 + n + 1)}} \\right).
                        $$<\/p>\n\n\n\n

                        After this adjustment, hopefully it becomes apparent, even from a quick inspection of the formula, that the constant \\(60\\) plays a fundamental role in limiting structure of the problem.<\/p>\n\n\n\n

                        Thus we have <\/p>\n\n\n\n

                        \"\"<\/figure>\n\n\n\n

                        The Problem is not finished<\/h2>\n\n\n\n

                        Now, reintroducing the 6-fold symmetry and examining the superposition of plots corresponding to the 1-close through \\(n\\)-close interactions (for increasingly large values of \\(n\\)), we observe:<\/p>\n\n\n\n

                        \"\"<\/figure>\n\n\n\n

                        But wait … this does not cover the full grid. It\u2019s clearly missing parts! You scammed me! Well yes but not quite as I did mention at the start <\/p>\n\n\n\n

                        “…closed-form starting <\/strong>step<\/em>” <\/p>Srivathsan Amruth,
                        You really didn’t think I was going to give you the full answer right…<\/cite><\/blockquote><\/figure>\n\n\n\n

                        I intentionally stopped here, as I want you to explore the problem further and realize that there are, in fact, additional symmetries you can exploit to fully cover the hexagonal grid. I’ll leave you with a the following hint to start:<\/p>\n\n\n\n

                        \n

                        Consider the 1-ray case and its associated \\(60^\\circ\\) cone.<\/p>\n\n\n\n

                        Now look at the 3-close case (green) and the 2-close case (purple). Ask yourself: can I flip<\/em> something to fill in the missing part of the 3-close structure?<\/p>\n\n\n\n

                        Then, move on to the 4-close case. Since (spoiler) there will be two<\/em> distinct 3-close components involved, can I once again use flipping to complete the picture? And if so, how many times, and where, should these flips occur?<\/p>\n\n\n\n

                        It’s getting quite recursive from here\u2026 but I’ll let you figure out the rest.<\/p>\n<\/blockquote>\n\n\n\n

                        Also, I’ll leave you with one final thought, i.e is there a way to avoid this recursive construction altogether or simplify the approach, and instead generate the full structure more efficiently using some iterative or closed-form approach?
                        <\/p>\n\n\n\n

                        Wishing you a hex-tra special day ahead with every piece falling neatly into place.<\/p>Srivathsan Amruth,
                        i.e The person guiding<\/del> offering you through<\/s> this symmetry-induced spiral<\/em>.<\/cite><\/blockquote><\/figure>\n","protected":false},"excerpt":{"rendered":"

                        How can we extend the 2-close interaction to a general n-close interaction? That was the question at the end of the triangle’s hex blog post. This post goes through the thought process and tools used to solve for the sequence that extends the 2-close interaction to a general \\(n\\)-close interaction. The approach here focused on […]<\/p>\n","protected":false},"author":3,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":"","_ppma_block_editor_authors":""},"categories":[31],"tags":[],"ppma_author":[3],"class_list":["post-966","post","type-post","status-publish","format-standard","hentry","category-research"],"authors":[{"term_id":3,"user_id":0,"is_guest":1,"slug":"cap-amruth","display_name":"amruth","avatar_url":"https:\/\/secure.gravatar.com\/avatar\/?s=96&d=mm&r=g","author_category":"","first_name":"","last_name":"","user_url":"","job_title":"","description":""}],"_links":{"self":[{"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/posts\/966","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/comments?post=966"}],"version-history":[{"count":10,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/posts\/966\/revisions"}],"predecessor-version":[{"id":1063,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/posts\/966\/revisions\/1063"}],"wp:attachment":[{"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/media?parent=966"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/categories?post=966"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/tags?post=966"},{"taxonomy":"author","embeddable":true,"href":"https:\/\/summergeometry.org\/sgi2025\/wp-json\/wp\/v2\/ppma_author?post=966"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}