Related papers: Connected components of meanders: I. Bi-rainbow me…
We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…
Given a knot complement X and its p-fold cyclic cover X_p, we identify twisted polynomials associated to 1-dimensional linear representations of the fundamental group of X_p with twisted polynomials associated to related p-dimensional…
According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…
Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…
All parabolic geometries, i.e. Cartan geometries with homogeneous model a real generalized flag manifold, admit highly interesting classes of distinguished curves. The geodesics of a projective class of connections on a manifold, conformal…
An edge-colored graph $G$, where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\it $k$-rainbow connected} if one can…
A low-dimensional model of large Prandtl-number ($P$) Rayleigh B\'{e}nard convection is constructed using some of the important modes of pseudospectral direct numerical simulations. A detailed bifurcation analysis of the low-dimensional…
We consider the family of cubic polynomials with a simple parabolic fixed point. We prove that the boundary of the immediate basin of attraction of the parabolic point is a Jordan curve and give a description of the dynamics.
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
We present a framework for the reduction of various geometric structures extending the classical coisotropic Poisson reduction. For this we introduce constraint manifolds and constraint vector bundles. A constraint Serre-Swan theorem is…
In this manuscript we introduce a method to measure entanglement of curves in 3-space that extends the notion of knot and link polynomials to open curves. We define the bracket polynomial of curves in 3-space and show that it has real…
We describe symmetries of the braid monodromy decomposition for a class of plane curves defined over reals including the real curves with no real points and proving new divisibility relations for Alexander invariants of such curves.
Methods in Riemann-Finsler geometry are applied to investigate bi-Hamiltonian structures and related mKdV hierarchies of soliton equations derived geometrically from regular Lagrangians and flows of non-stretching curves in tangent bundles.…
A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is…
For any truncated path algebra $\Lambda$ of a quiver, we classify, by way of representation-theoretic invariants, the irreducible components of the parametrizing varieties $\mathbf{Rep}_{\mathbf{d}}(\Lambda)$ of the $\Lambda$-modules with…
We elucidate the geometry of matrix models based on simple formally real Jordan algebras. Such Jordan algebras give rise to a nonassociative geometry that is a generalization of Lorentzian geometry. We emphasize constructions for the…
In a planar confluent orthogonal drawing (PCOD) of a directed graph (digraph) vertices are drawn as points in the plane and edges as orthogonal polylines starting with a vertical segment and ending with a horizontal segment. Edges may…
The problem of which Gauss diagram can be realized by plane curves is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that needed conditions for realizability of a Gauss…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid…