Related papers: Connected components of meanders: I. Bi-rainbow me…
We consider families of polynomial lemniscates in the complex plane and determine if they bound a Jordan domain. This allows us to find examples of regions for which we can calculate the projection of $\bar{z}$ to the Bergman space of the…
Inspired by the paper on quantum knots and knot mosaics [23] and grid diagrams (or arc presentations), used extensively in the computations of Heegaard-Floer knot homology [2,3,7,24], we construct the more concise representation of knot…
Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…
A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…
A combination $\mathbf{a}+\mathrm{i}\mathbf{b}$ where ${\mathrm i}^2=-1$ and $\mathbf{a}, \, \mathbf{b}$ are real vectors is called a bivector. Gibbs developed a theory of bivectors, in which he associated an ellipse with each bivector. He…
Three-dimensional conformal theories with six supersymmetries and SU(4) R-symmetry describing stacks of M2-branes are here proposed to be related to generalized Jordan triple systems. Writing the four-index structure constants in an…
A rigidity circuit (in 2D) is a minimal dependent set in the rigidity matroid, i.e. a minimal graph supporting a non-trivial stress in any generic placement of its vertices in $\mathbb R^2$. Any rigidity circuit on $n\geq 5$ vertices can be…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
We present a braided circuit topology framework for investigating topology and structural phase transitions in aggregates of semiflexible polymers. In the conventional approach to circuit topology, which specifically applies to single…
Trigonal curves provide an example of Brill-Noether special curves. Theorem 1.3 of [9] characterizes the Brill-Noether theory of general trigonal curves and the refined stratification by Brill-Noether splitting loci, which parametrize line…
We develop recursive formulas for the horizontal and vertical monodromies of a quasi-ordinary surface. These are monodromies associated to the Milnor fiber of a slice transverse to a component of the singular locus. In the course of working…
We develop a multiresolution approach to the problem of polygonal curve approximation. We show theoretically and experimentally that, if the simplification algorithm A used between any two successive levels of resolution satisfies some…
Let C be a smooth complex projective curve of genus at least 2 and let M be the moduli space of rank 2, stable vector bundles on C, with fixed determinant of degree 1. For any k>1, we find two irreducible components of the space of rational…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
A new computational technique based on the symbolic description utilizing kneading invariants is proposed and verified for explorations of dynamical and parametric chaos in a few exemplary systems with the Lorenz attractor. The technique…
In this paper we develop the formalism of rational complex Bezier curves. This framework is a simple extension of the CAD paradigm, since it describes arc of curves in terms of control polygons and weights, which are extended to complex…
Let $C$ be a nodal curve, and let $E$ be a union of semistable subcurves of $C$. We consider the problem of contracting the connected components of $E$ to singularities in a way that preserves the genus of $C$ and makes sense in families,…
A constant-rate encoder--decoder pair is presented for a fairly large family of two-dimensional (2-D) constraints. Encoding and decoding is done in a row-by-row manner, and is sliding-block decodable. Essentially, the 2-D constraint is…
In this paper we consider a family of dynamical systems that we call "arabesques", defined as closed chains of 2-element negative circuits. An $n$-dimensional arabesque system has $n$ 2-element circuits, but in addition, it displays by…
Pre-geodesics of an affine connection are the curves that are geodesics after a reparametrization (the analogous concept in K\"ahler geometry is known as J-planar curves). Similarly, dual-geodesics on a Riemannian manifold are curves along…