Papers
Topics
Authors
Recent
Search
2000 character limit reached

Singular Meanders

Published 28 Dec 2025 in math.CO and math.GT | (2512.23091v1)

Abstract: The problem of enumerating meanders -- pairs of simple plane curves with transverse intersections -- was formulated about forty years ago and is still far from solved. Recently, it was discovered that meanders admit a factorization into prime components. This factorization naturally leads to a broader class of objects, which we call singular meanders, in which tangential intersections between the curves are also allowed. In the present paper we initiate a systematic study of singular meanders: we develop a basic combinatorial framework, point out connections with other combinatorial objects and known integer sequences, and completely enumerate several natural families of singular meanders.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.