[Paper Review] Connected components of meanders: I. Bi-rainbow meanders

Anna Karnauhova, Stefan Liebscher|arXiv (Cornell University)|Apr 13, 2015

Mathematics and Applications7 references3 citations

TL;DR

This paper investigates the number of connected components (Jordan curves) in bi-rainbow meanders—planar configurations of nested arcs above and below a line. It proves that the number cannot be expressed as the greatest common divisor (gcd) of polynomials in the arc sizes for more than four families, but instead introduces a nose-retraction algorithm with logarithmic complexity that mirrors the Euclidean algorithm, providing an optimal computational method for determining the number of curves.

ABSTRACT

Closed meanders are planar configurations of one or several disjoint closed Jordan curves intersecting a given line or curve transversely. They arise as shooting curves of parabolic PDEs in one space dimension, as trajectories of Cartesian billiards, and as representations of elements of Temperley-Lieb algebras. Given the configuration of intersections, for example as a permutation or an arc collection, the number of Jordan curves is unknown and needs to be determined. We address this question in the special case of bi-rainbow meanders, which are given as non-branched families (rainbows) of nested arcs. Easily obtainable results for small bi-rainbow meanders containing up to four families suggest an expression of the number of curves by the greatest common divisor (gcd) of polynomials in the sizes of the rainbow families. We prove however, that this is not the case. In fact, the number of connected components of bi-rainbow meanders with more than four families cannot be expressed as the gcd of polynomials in the sizes of the rainbows. On the other hand, we provide a complexity analysis of nose-retraction algorithms. They determine the number of connected components of arbitrary bi-rainbow meanders in logarithmic time. In fact, the nose-retraction algorithms resemble the Euclidean algorithm, which is used to determine the gcd, in structure and complexity. Looking for a closed formula of the number of connected components, the nose-retraction algorithm is as good as a gcd-formula and therefore as good as we can possibly expect.

Motivation & Objective

• To determine whether the number of connected components in bi-rainbow meanders can be expressed as a gcd of polynomials in the sizes of the rainbow families.
• To resolve the conjecture that such a gcd formula might generalize from small cases (up to four families) to arbitrary bi-rainbow meanders.
• To develop an efficient computational method for determining the number of connected components when a closed-form gcd expression is not possible.
• To establish that the nose-retraction algorithm provides a complexity-optimal alternative to any potential gcd formula.

Proposed method

• Introduces the concept of bi-rainbow meanders as non-branched families of nested arcs above and below a horizontal axis, with arc counts given by parameters α₁,…,αₙ.
• Proposes a nose-retraction algorithm that recursively simplifies the meander by reducing the middle family’s size using remainder operations, similar to the Euclidean algorithm.
• Defines three recursive cases in the algorithm: (a) when left and right arc counts are equal, (b) when their difference divides the middle family size, and (c) otherwise, using a remainder-based transformation.
• Analyzes the algorithm’s complexity as O(b) × O(n), where b is the number of bits in the input, showing it runs in logarithmic time relative to input size.
• Demonstrates structural and complexity equivalence between the nose-retraction algorithm and the Euclidean algorithm, especially in their use of integer division remainders.
• Uses the pigeonhole principle and scaling arguments to prove that no homogeneous polynomial gcd formula can exist for bi-rainbow meanders with more than four families.

Experimental results

Research questions

• RQ1 Can the number of connected components in a bi-rainbow meander be expressed as the gcd of homogeneous polynomials in the sizes of the rainbow families?
• RQ2 Does the observed gcd pattern for small bi-rainbow meanders (up to four families) generalize to larger configurations?
• RQ3 Is there a computationally efficient alternative to a closed-form gcd expression for determining the number of connected components?
• RQ4 How does the complexity of computing the number of components compare to that of the Euclidean algorithm?

Key findings

• The number of connected components in bi-rainbow meanders with more than four families cannot be expressed as the gcd of any pair of homogeneous polynomials with integer coefficients.
• The nose-retraction algorithm computes the number of connected components in O(b) × O(n) time, achieving logarithmic complexity similar to the Euclidean algorithm.
• The algorithm’s recursive structure closely mirrors the Euclidean algorithm, with the core operation being the computation of integer division remainders.
• For typical bi-rainbow meanders with arc sizes of similar magnitude, the algorithm’s complexity is expected to be close to O(b), the theoretical lower bound for such number-theoretic computations.
• The result confirms that any alternative formula for the number of components would have at least the same complexity as the gcd, making the nose-retraction algorithm optimal in this sense.
• The condensed bracket representation of meanders is a prerequisite for achieving logarithmic complexity, as direct inspection of transpositions would require O(α) time.