相关论文: Computing Instanton Numbers of Curve Singularities
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
We introduce the notion of an instanton bundle on a Fano threefold of index 2. For such bundles we give an analogue of a monadic description and discuss the curve of jumping lines. The cases of threefolds of degree 5 and 4 are considered in…
We use the gauged linear sigma model introduced by Witten to calculate instanton expansions for correlation functions in topological sigma models with target space a toric variety $V$ or a Calabi--Yau hypersurface $M \subset V$. In the…
One of the general problems in algebraic geometry is to determine algorithmically whether or not a given geometric object, defined by explicit polynomial equations (e.g. a curve or a surface), satisfies a given property (e.g. has…
We study polygonal analogues of several moving boundary problems and their time discretization which preserves the constant area speed property. We establish various polygonal analogues of geometric formulas for moving boundaries and make…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
We present closed-form expressions of unrefined instanton partition functions for gauge groups of type $BCD$ as sums over Young diagrams. For $\mathrm{SO}(n)$ gauge groups, we provide a fivebrane web picture of our formula based on the…
We study U(1) and U(2) noncommutative instantons on R^2_{NC} x R^2_C based on the ADHM construction. It is shown that a mild singularity in the instanton solutions for both self-dual and anti-self-dual gauge fields always disappears in…
Microscopic tests of the exact results are performed in N=2 SU(2) supersymmetric QCD. We construct the multi-instanton solution in N=2 supersymmetric QCD and calculate the two-instanton contribution ${\cal F}_2$ to the prepotential ${\cal…
We address the question whether one can identify instantons in direct numerical simulations of the stochastically driven Burgers equation. For this purpose, we first solve the instanton equations using the Chernykh-Stepanov method [Phys.…
We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.
A T-curve of degree $d$ is given by a regular unimodular triangulation of $d \cdot \Delta_2$ together with a sign distribution on its lattice points. By Viro's Patchworking Theorem, this determines the ambient isotopy type (a.k.a. real…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
This is the third article in the collection of reviews "Exact results on N=2 supersymmetric gauge theories", ed. J. Teschner. It is explained how to compute the instanton partition functions. The results can be written as sums over bases…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
Instanton theory is an established method to calculate rate constants of chemical reactions including atom tunneling. Technical and methodological improvements increased its applicability. Still, a large number of energy and gradient…
In this work we describe a fast and stable algorithm for the computation of the orthogonal moments of an image. Indeed, orthogonal moments are characterized by a high discriminative power, but some of their possible formulations are…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
Instanton calculations in semiclassical quantum mechanics rely on integration along trajectories which solve classical equations of motion. However in systems with higher dimensionality or complexified phase space these are rarely…