Related papers: Braid Monodromy Computation of Real Singular Curve…
We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
We extend the branching process based numerical algorithm of Bouchard et al. [3], that is dedicated to semilinear PDEs (or BSDEs) with Lipschitz nonlinearity, to the case where the nonlinearity involves the gradient of the solution. As in…
Let f: Y -> CP^2 be a birational morphism of non-singular (rational) surfaces. We give an effective (necessary and sufficient) criterion for algebraicity of the surfaces resulting from contraction of the union of the strict transform of a…
We establish a combinatorial connection between the real geometry and the $K$-theory of complex Schubert curves $S(\lambda_\bullet)$, which are one-dimensional Schubert problems defined with respect to flags osculating the rational normal…
We establish a combinatorial connection between the real geometry and the $K$-theory of complex Schubert curves $S(\lambda_\bullet)$, which are one-dimensional Schubert problems defined with respect to flags osculating the rational normal…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility,…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
Let X be a plane in a torus over an algebraically closed field K, with tropicalization the matroidal fan Sigma. In this paper we present an algorithm which completely solves the question whether a given one-dimensional balanced polyhedral…
We introduce a new algorithm for computing the periods of a smooth complex projective hypersurface. The algorithm intertwine with a new method for computing an explicit basis of the singular homology of the hypersurface. It is based on…
We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…
We consider the universal family $E_n^d$ of superelliptic curves: each curve $\Sigma_n^d$ in the family is a $d$-fold covering of the unit disk, totally ramified over a set $P$ of $n$ distinct points; $\Sigma_n^d\hookrightarrow E_n^d\to…
We define a monoid structure on the set of $k$-equal arrangements and use this structure to define limits of braid arrangements. We compute the cohomology of the associated limits of rational models of the arrangements complex complements.…
We study a family of algebras defined using a locally-finite endomorphism called a braiding map. When the braiding map is semi-simple, the algebra is a generalized vertex algebra, while when the braiding map is locally-nilpotent we have a…
We give an explicit algorithm to Legendrian realize a homologically nontrivial simple closed curve on a ribbon surface of a Legendrian graph in the standard contact structure $(\mathbb{R}^3,\xi_{\rm st})$. As an application, we obtain an…
Simplifying polygonal curves at different levels of detail is an important problem with many applications. Existing geometric optimization algorithms are only capable of minimizing the complexity of a simplified curve for a single level of…
In this paper we present simplifying techniques which allow one to compute the quiver diagrams for various D-branes at (non-Abelian) orbifold singularities with and without discrete torsion. The main idea behind the construction is to take…