Related papers: Braid Monodromy Computation of Real Singular Curve…
The preservation of ambient isotopic equivalence under piecewise linear (PL) approximation for smooth knots are prominent in molecular modeling and simulation. Sufficient conditions are given regarding: (1) Hausdorff distance, and (2) a sum…
Inspired by the work of Ellenberg, Elsholtz, Hall, and Kowalski, we investigate how the property of the generic fiber of a one-parameter family of abelian varieties being geometrically simple extends to other fibers. In \cite{EEHK09}, the…
This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…
We continue the development of methods for enumerating nodal curves on smooth complex surfaces, stressing the range of validity. We illustrate the new methods in three important examples. First, for up to eight nodes, we confirm…
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…
In this survey paper we give a proof of hyperbolicity of the complex of curves for a non-exceptional surface S of finite type combining ideas of Masur/Minsky and Bowditch. We also shortly discuss the relation between the geometry of the…
While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of…
We introduce the concept of pseudo-trisections of smooth oriented compact 4-manifolds with boundary. The main feature of pseudo-trisections is that they have lower complexity than relative trisections for given 4-manifolds. We prove…
In this paper we discuss algebraic, combinatorial and topological properties of singular virtual braids. On the algebraic side we state the relations between classical and virtual singular objects, in addition we discuss a Birman-like…
Given a singular surface X, one can extract information on it by investigating the fundamental group $\pi_1(X - Sing_X)$. However, calculation of this group is non-trivial, but it can be simplified if a certain invariant of the branch curve…
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the transitive closure matrix of a graph from its adjacency matrix.…
Kodaira's classification of singular fibers in elliptic fibrations and its translation into the language of monodromies and Lefschetz fibrations has been a boon to the study of 4-manifolds. In this article, we begin the work of translating…
We solve Poisson's equation using new multigrid algorithms that converge rapidly. The novel feature of the 2D and 3D algorithms are the use of extra diagonal grids in the multigrid hierarchy for a much richer and effective communication…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
A linear system on a smooth complex algebraic surface gives rise to a family of smooth curves in the surface. Such a family has a topological monodromy representation valued in the mapping class group of a fiber. Extending arguments of…
We provide explicit and unified formulae for the normalized 3-cocycles on arbitrary finite abelian groups. As an application, we compute all the braided monoidal structures on linear Gr-categories.
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate…
A new approach to analyze the properties of the energy-momentum tensor $T(z)$ of conformal field theories on generic Riemann surfaces (RS) is proposed. $T(z)$ is decomposed into $N$ components with different monodromy properties, where $N$…