English
Related papers

Related papers: Connected components of meanders: I. Bi-rainbow me…

200 papers

The matching problem for a given Jordan curve in the complex plane asks to find two nonconstant functions, one analytic in the bounded complementary component of the curve and the other analytic in the unbounded complementary component of…

Complex Variables · Mathematics 2025-07-08 Kirill Lazebnik , Pierre-Olivier Parisé , Malik Younsi

An edge-colored graph $G$ is said to be rainbow connected if between each pair of vertices there exists a path which uses each color at most once. The rainbow connection number, denoted by $rc(G)$, is the minimum number of colors needed to…

Discrete Mathematics · Computer Science 2015-10-14 Eduard Eiben , Robert Ganian , Juho Lauri

A path in an edge-colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge-colored graph is (strongly) rainbow connected if there exists a rainbow (geodesic) path between every pair of vertices.…

Computational Complexity · Computer Science 2011-09-28 Shasha Li , Xueliang Li

The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…

Dynamical Systems · Mathematics 2026-05-29 Shuyi Wang , Gaofei Zhang

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

Combinatorics · Mathematics 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

Let $G$ be a nontrivial connected, edge-colored graph. An edge-cut $S$ of $G$ is called a rainbow cut if no two edges in $S$ are colored with a same color. An edge-coloring of $G$ is a rainbow disconnection coloring if for every two…

Combinatorics · Mathematics 2018-12-05 Zhong Huang , Xueliang Li

The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid graphs, under different input settings, in theories of bounded…

Logic in Computer Science · Computer Science 2010-02-17 Phuong Nguyen , Stephen Cook

An arrangement of pseudocircles is a finite set of oriented closed Jordan curves each two of which cross each other in exactly two points. To describe the combinatorial structure of arrangements on closed orientable surfaces, in (Linhart,…

Combinatorics · Mathematics 2007-05-23 Ronald Ortner

A generic immersion of a circle into a $2$-sphere is often studied as a projection of a knot; it is called a knot projection. A chord diagram is a configuration of paired points on a circle; traditionally, the two points of each pair are…

Geometric Topology · Mathematics 2021-08-24 Noboru Ito , Yusuke Takimura

A Jordan region is a subset of the plane that is homeomorphic to a closed disk. Consider a family $\mathcal{F}$ of Jordan regions whose interiors are pairwise disjoint, and such that any two Jordan regions intersect in at most one point. If…

Combinatorics · Mathematics 2017-09-15 Wouter Cames van Batenburg , Louis Esperet , Tobias Müller

Let $\Gamma_n$ be the complete undirected Cayley graph of the odd cyclic group $Z_n$. Connected graphs whose vertices are rainbow tetrahedra in $\Gamma_n$ are studied, with any two such vertices adjacent if and only if they share (as…

Combinatorics · Mathematics 2014-11-06 Italo J. Dejter

Given a matroid together with a coloring of its ground set, a subset of its elements is called rainbow colored if no two of its elements have the same color. We show that if a binary matroid of rank $r$ is colored with exactly $r$ colors,…

Combinatorics · Mathematics 2021-09-02 Kristóf Bérczi , Tamás Schwarcz

Any Jordan curve in the complex plane can be approximated arbitrarily well in the Hausdorff topology by Julia sets of polynomials. Finite collections of disjoint Jordan domains can be approximated by the basins of attraction of rational…

Dynamical Systems · Mathematics 2015-08-05 Kathryn A. Lindsey

Bimonotone subdivisions in two dimensions are subdivisions all of whose sides are either vertical or have nonnegative slope. They correspond to statistical estimates of probability distributions of strongly positively dependent random…

Combinatorics · Mathematics 2021-12-15 Elina Robeva , Melinda Sun

The statistics of meanders is studied in connection with the Temperley-Lieb algebra. Each (multi-component) meander corresponds to a pair of reduced elements of the algebra. The assignment of a weight $q$ per connected component of meander…

High Energy Physics - Theory · Physics 2015-06-26 P. Di Francesco , O. Golinelli , E. Guitter

We develop a new general method for computing the decomposition type of the normal bundle to a projective rational curve. This method is then used to detect and explain an example of a Hilbert scheme that parametrizes all the rational…

Algebraic Geometry · Mathematics 2016-04-21 Alberto Alzati , Riccardo Re

Invariant manifolds are important constructs for the quantitative and qualitative understanding of nonlinear phenomena in dynamical systems. In nonlinear damped mechanical systems, for instance, spectral submanifolds have emerged as useful…

Computational Engineering, Finance, and Science · Computer Science 2021-10-15 Shobhit Jain , George Haller

For applications in computing, Bezier curves are pervasive and are defined by a piecewise linear curve L which is embedded in R^3 and yields a smooth polynomial curve C embedded in R^3. It is of interest to understand when L and C have the…

Geometric Topology · Mathematics 2012-11-15 J. Li , T. J. Peters , D. Marsh , K. E. Jordan

Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…

Computational Geometry · Computer Science 2026-01-01 Henrique Ennes , Clément Maria

One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list of conjectures that can be formulated as special cases.…

Combinatorics · Mathematics 2022-06-27 Kristóf Bérczi , Gergely Csáji , Tamás Király