相关论文: Computing Instanton Numbers of Curve Singularities
Macaulay dual spaces provide a local description of an affine scheme and give rise to computational machinery that is compatible with the methods of numerical algebraic geometry. We introduce eliminating dual spaces, use them for computing…
In this paper, we explore how numerical calculations can be accelerated by implementing several numerical methods of fractional-order systems using parallel computing techniques. We investigate the feasibility of parallel computing…
Instanton-dyons, also known as instanton-monopoles or instanton-quarks, are topological constituents of the instantons at nonzero temperature and nonzero expectation value of $A_4$. While the interaction between instanton-dyons has been…
We construct instanton solutions on noncommutative Euclidean 4-space which are deformations of instanton solutions on commutative Euclidean 4-space. We show that the instanton numbers of these noncommutative instanton solutions coincide…
We calculate the singular instanton homology with local coefficients for the simplest n-strand braids in $S^1 \times S^2$ for all odd n, describing these homology groups and their module structures in terms of the coordinate rings of…
Atiyah and Manton have outlined a scheme to obtain approximations to the SU(2) skyrmions from instantons in $\R^4$. In this paper we apply this scheme to construct, in an explicit form, approximations to static spherically symmetric SU(N)…
We prove some combinatorial results required for the proof of the following conjecture of Nekrasov: The generating function of closed string invariants in local Calabi-Yau geometries obtained by appropriate fibrations of $A_N$ singularities…
In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…
We present algorithms for computing weakly singular and near-singular integrals arising when solving the 3D Helmholtz equation with curved boundary elements. These are based on the computation of the preimage of the singularity in the…
The explicit multi-instanton solutions by 'tHooft and Jackiw, Nohl & Rebbi are generalized to curvilinear coordinates. The idea is that a gauge transformation can notably simplify the expressions obtained after the change of variables. The…
In this paper a special type of difference equations is investigated. The impulses start abruptly at some points and their action continue on given finite intervals. This type of equations is used to model a real process. An algorithm,…
We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
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 study some generalized instanton algebras which are required to describe `instantonic complex rank 2 bundles'. The spaces on which the bundles are defined are not prescribed from the beginning but rather are obtained from some natural…
Instanton calculations are performed in the context of stationary Burgers turbulence to estimate the tails of the probability density function (PDF) of velocity gradients. These results are then compared to those obtained from massive…
We illustrate the use of the computer algebra system Macaulay2 for simplifications of classical unirationality proofs. We explicitly treat the moduli spaces of curves of genus g=10, 12 and 14.
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…