pith. sign in

arxiv: 2606.12331 · v1 · pith:AWFIVQ4Snew · submitted 2026-06-10 · 🧮 math.CO · math.GT

Resolving the Schwartz Quadratic Meander Number Conjecture

Charles Daly , Diaaeldin Taha This is my paper

Pith reviewed 2026-06-27 08:55 UTC · model grok-4.3

classification 🧮 math.CO math.GT
keywords cyclic meandersmeander numberquadratic boundscyclic permutationsembedded loopstransverse intersectionstopological salesman problemSchwartz conjecture
0
0 comments X

The pith

The maximum meander number over cyclic permutations on n letters is bounded above and below by quadratic functions of n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that realizing an arbitrary cyclic permutation as the visit order of an embedded loop crossing a fixed line requires a number of extra intersection points that is at most quadratic in n and, for some permutations, at least quadratic. This quantity, called the meander number, therefore measures permutation complexity in a topological sense. A reader would care because the result settles a conjecture that connects this complexity measure directly to the topological salesman problem. The work further exhibits infinite families of permutations whose meander numbers achieve every intermediate growth rate between linear and quadratic.

Core claim

The principal result shows that the maximum of the meander number over all cyclic permutations on n letters is bounded above and below quadratically in n. This resolves the Schwartz conjecture. The paper also constructs families of cyclic permutations on n letters whose meander numbers realize a continuum of growth rates between linear and quadratic.

What carries the argument

The meander number of a cyclic permutation, the smallest number of extra transverse intersection points needed to realize the permutation by an embedded oriented loop crossing a fixed line.

Load-bearing premise

The meander number is exactly the smallest number of extra crossings that must be added to embed the given cyclic permutation as the crossing sequence of a single oriented loop.

What would settle it

A cyclic permutation on n letters whose minimal number of extra crossings is either o(n squared) or omega(n squared) for infinitely many n.

Figures

Figures reproduced from arXiv: 2606.12331 by Charles Daly, Diaaeldin Taha.

Figure 1
Figure 1. Figure 1: Three equivalent realizations of the permutation (0, 2, 3, 1) as the first return map of a meanderic permutation: (a) with a semicircular meander diagram, (b) with a PLJordan realization (Section 2), and (c) with a permuta￾tion tile (Section 4). The meandric permutation (0, 3, 4, 5, 2, 1) has first-return (0, 4, 5, 1) on S = {0, 1, 4, 5}, which becomes (0, 2, 3, 1) after relabeling S in its inherited order… view at source ↗
Figure 2
Figure 2. Figure 2: A permutation tile realizing the permutation (1, 2, 0) as a first return map. The crossings are labeled in their order along A, so the or￾der along A is (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11), while the order along B is (0, 7, 8, 9, 6, 1, 2, 5, 10, 11, 4, 3). The distinguished set S = {2, 7, 9} has first-return (7, 9, 2), which becomes (1, 2, 0) after relabeling S in its inherited order. Proof. Choose inte… view at source ↗
Figure 3
Figure 3. Figure 3: The corridor closure. The A-connectors are drawn in the upper corridor and the B-connectors in the lower corridor, so the closure adds no new A-B intersections. Proof. Choose a large rectangle R0 containing all Qj ’s in its interior. The A-connectors are drawn in the region of R0 \ S j Qj above the tiles, and the B-connectors are drawn in the region below the tiles. For j = 1, . . . , q −1, connect A + j t… view at source ↗
Figure 4
Figure 4. Figure 4: A drawing of the multigraphs Hj (σ) for σ = (2, 0, 1, 3, 4, 6, 5, 7, 9, 8), with I1 = {0, 1, 2, 3, 4}, I2 = {5, 6}, and I3 = {7, 8, 9}. Definition 11 (Path-pair graph). Let σ be a cyclic permutation of [n], and let [n] = I1 ⊔ I2 ⊔ · · · ⊔ Iq be a partition into consecutive intervals. Fix 1 ≤ j ≤ q, write L = |Ij |, and label the block as Ij = {a, a + 1, . . . , a + L − 1}. The jth path-pair graph Hj (σ) is… view at source ↗
read the original abstract

A cyclic meander is an embedded oriented loop in the plane intersecting a fixed infinite line, or circle, transversely in a linearly ordered set of $2n$ points. By keeping track of the order in which the loop visits these points, the cyclic meander induces a cyclic permutation on these marked points. Correspondingly, given a permutation on $n$ letters, one can ask whether or not a cyclic meander induces the permutation in this manner, and if not, what is the most efficient way of doing so if we allow more points of intersection? This process gives a way of associating to a permutation on $n$ letters a measurement of complexity of the permutation in question. The principal result of this work shows that the maximum of this quantity, the \emph{meander number}, over all cyclic permutations on $n$ letters, is bounded above and below quadratically in $n$. This result resolves a conjecture of Schwartz~\cite{richtpss} in relation to his work on the topological salesman problem. We conclude this work by constructing families of cyclic permutations on $n$ letters whose meander numbers realize a continuum of growth rates between linear and quadratic.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript defines the meander number of a cyclic permutation on n letters as the minimal number of extra transverse intersection points needed for an embedded oriented loop to realize the permutation when intersecting a fixed line or circle. It proves that the maximum of this quantity over all cyclic permutations on n letters is bounded above and below by quadratic functions of n, thereby resolving Schwartz's conjecture on the topological salesman problem. The paper also constructs explicit families of permutations whose meander numbers realize every growth rate between linear and quadratic.

Significance. If the central bounds hold, the result supplies the first quadratic resolution of the meander-number conjecture and supplies a continuum of intermediate growth rates via explicit constructions. These features directly advance the topological combinatorics of permutations and the salesman problem; the constructive component is a particular strength.

major comments (1)
  1. [Abstract, paragraph 2] Abstract, paragraph 2: the shift from a cyclic meander on 2n marked points (inducing a permutation on those 2n points) to the meander number of an arbitrary permutation on n letters is stated without an explicit bijection, reduction, or pairing rule. Because the quadratic upper and lower bounds are claimed for the maximum over all cyclic permutations on [n], any many-to-one, incomplete, or auxiliary-pairing mapping would change the extremal scaling; this definitional step is therefore load-bearing for the principal theorem.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for identifying a point of potential ambiguity in the abstract. We address the major comment below.

read point-by-point responses

  1. Referee: [Abstract, paragraph 2] Abstract, paragraph 2: the shift from a cyclic meander on 2n marked points (inducing a permutation on those 2n points) to the meander number of an arbitrary permutation on n letters is stated without an explicit bijection, reduction, or pairing rule. Because the quadratic upper and lower bounds are claimed for the maximum over all cyclic permutations on [n], any many-to-one, incomplete, or auxiliary-pairing mapping would change the extremal scaling; this definitional step is therefore load-bearing for the principal theorem.

    Authors: We agree that the abstract's brevity leaves the precise reduction implicit. The full manuscript (Section 2) defines the meander number of a cyclic permutation σ on [n] via the canonical doubling map that sends each letter i to the ordered pair of consecutive intersection points (2i-1, 2i) while preserving the cyclic order induced by σ; this yields a bijection between the set of cyclic permutations on [n] and the subset of cyclic permutations on [2n] that respect the fixed pairing of consecutive points. The meander number is then the minimal number of additional transverse intersections needed to realize this doubled permutation. Because the map is bijective on the relevant class and the extra intersections are counted uniformly, the quadratic upper and lower bounds transfer directly without altering the extremal scaling. To eliminate any ambiguity we will insert a single clarifying sentence in the abstract describing this doubling construction. revision: yes

Circularity Check

0 steps flagged

No circularity: independent proof of quadratic bounds on meander number

full rationale

The paper defines the meander number for a cyclic permutation on n letters as the minimal additional transverse intersections needed to realize it via an embedded loop on a line/circle. It then proves that the maximum of this quantity over all such permutations is bounded above and below by quadratic functions of n, resolving an external conjecture. No equations, fitted parameters, or self-citations are shown reducing the claimed bounds to the inputs by construction. The constructions for intermediate growth rates are presented as explicit families, and the central result is framed as a proof rather than a renaming or self-referential fit. The derivation chain is self-contained against the stated definitions and external conjecture.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work operates entirely inside the established framework of cyclic meanders and permutations; no new free parameters, ad-hoc axioms, or postulated entities are introduced in the abstract.

axioms (1)
  • standard math Standard definitions and basic properties of cyclic meanders, transverse intersections, and induced cyclic permutations on 2n points
    The abstract invokes these notions without proof, treating them as background from prior literature on meanders.

pith-pipeline@v0.9.1-grok · 5732 in / 1166 out tokens · 18824 ms · 2026-06-27T08:55:45.157635+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

17 extracted references · 2 canonical work pages · 1 internal anchor

  1. [1]

    2025 , month=

    The Topological Traveling Salesman Problem , author=. 2025 , month=

    2025

  2. [2]

    Siberian Mathematical Journal , volume=

    A branched covering of CP2→ S 4, hyperbolicity and projectivity topology , author=. Siberian Mathematical Journal , volume=. 1988 , publisher=

    1988

  3. [3]

    Theoretical Computer Science , volume=

    Plane and projective meanders , author=. Theoretical Computer Science , volume=. 1993 , publisher=

    1993

  4. [4]

    2004 , publisher=

    Graphs on surfaces and their applications , author=. 2004 , publisher=

    2004

  5. [5]

    Mathematical and Computer Modelling , volume=

    Meander, folding, and arch statistics , author=. Mathematical and Computer Modelling , volume=. 1997 , publisher=

    1997

  6. [6]

    Forum of Mathematics, Pi , volume=

    Enumeration of meanders and Masur--Veech volumes , author=. Forum of Mathematics, Pi , volume=. 2020 , organization=

    2020

  7. [7]

    arXiv preprint arXiv:2506.13131 , year=

    Alphaevolve: A coding agent for scientific and algorithmic discovery , author=. arXiv preprint arXiv:2506.13131 , year=

    Pith/arXiv arXiv

  8. [8]

    arXiv preprint arXiv:2511.02864 , year=

    Mathematical exploration and discovery at scale , author=. arXiv preprint arXiv:2511.02864 , year=

    Pith/arXiv arXiv

  9. [9]

    SIAM Journal on Applied Mathematics , volume=

    A separator theorem for planar graphs , author=. SIAM Journal on Applied Mathematics , volume=. 1979 , publisher=

    1979

  10. [10]

    1983 , publisher=

    Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks , author=. 1983 , publisher=

    1983

  11. [11]

    International Symposium on Graph Drawing , pages=

    An improved lower bound for crossing numbers , author=. International Symposium on Graph Drawing , pages=. 2001 , organization=

    2001

  12. [12]

    Proceedings of the tenth annual symposium on Computational geometry , pages=

    Applications of the crossing number , author=. Proceedings of the tenth annual symposium on Computational geometry , pages=

  13. [13]

    Journal of Graph Algorithms and Applications , volume=

    Crossing numbers and cutwidths , author=. Journal of Graph Algorithms and Applications , volume=

  14. [14]

    AlphaEvolve: A coding agent for scientific and algorithmic discovery

    Alexander Novikov and Ng. AlphaEvolve:. CoRR , volume =. 2025 , url =. doi:10.48550/ARXIV.2506.13131 , eprinttype =. 2506.13131 , timestamp =

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2506.13131 2025

  15. [15]

    Sur un th

    Poincar. Sur un th. Rendiconti del Circolo Matematico di Palermo , number =. 1912 , month =

    1912

  16. [16]

    Meander, folding, and arch statistics , journal =

    P. Meander, folding, and arch statistics , journal =. 1997 , issn =. doi:https://doi.org/10.1016/S0895-7177(97)00202-1 , url =

    work page doi:10.1016/s0895-7177(97)00202-1 1997

  17. [17]

    2025 , howpublished =

    Schwartz, Richard , title =. 2025 , howpublished =

    2025