Related papers: Connected components of meanders: I. Bi-rainbow me…
Seaweed algebras are a class of Lie algebras that are naturally characterized by a pair of compositions, which in turn are represented visually as planar graphs called meanders. These meanders provide a straightforward method for computing…
We establish an equivalence between infinitely many asymptotically stable periodic solutions and subsumed homoclinic connections for $N$-dimensional piecewise-linear continuous maps. These features arise as a codimension-three phenomenon.…
New explicit procedures for passing among triplane diagrams, braid movies, and braid charts for knotted surfaces in $\mathbb{R}^4$ are presented. To this end, rainbow diagrams, which lie between braid charts and triplanes, are introduced.…
Chaotic attractors commonly contain periodic solutions with unstable manifolds of different dimensions. This allows for a zoo of dynamical phenomena not possible for hyperbolic attractors. The purpose of this Letter is to demonstrate these…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
A chord diagram is a circle with paired points with each pair of points connected by a chord. Every generic immersed spherical curve provides a chord diagram by associating each chord with two preimages of a double point. Any two spherical…
We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…
We study the structured rainbow Ramsey theory at uncountable cardinals. When compared to the usual rainbow Ramsey theory, the variation focuses on finding a rainbow subset that not only is of a certain cardinality but also satisfies certain…
We introduce modular inequalities for complements of plane curves, based on a Combinatorial Aomoto complex construction associated with the weak combinatorial type of a curve. We use this as a tool to investigate twisted Alexander…
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…
The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…
A four-parametric family of linear connections preserving the almost complex structure is defined on an almost complex manifold with Norden metric. Necessary and sufficient conditions for these connections to be natural are obtained. A…
Given a set of planar curves (Jordan arcs), each pair of which meets -- either crosses or touches -- exactly once, we establish an upper bound on the number of touchings. We show that such a curve family has $O(t^2n)$ touchings, where $t$…
In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their…
The mirror curves enable us to study B-model topological strings on non-compact toric Calabi--Yau threefolds. One of the method to obtain the mirror curves is to calculate the partition function of the topological string with single brane.…
A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that…
Hodge correlators are complex numbers given by certain integrals assigned to a smooth complex curve. We show that they are correlators of a Feynman integral, and describe the real mixed Hodge structure on the pronilpotent completion of the…
We study the minimum number of inflection points among generic immersed closed plane curves with a fixed embedded shadow. The word immersed is essential: a genuinely embedded Jordan curve has inflection minimum zero. For tree-like shadows,…
An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks we introduce the notion of…
If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…