Related papers: Nash modification on toric curves
We approach the Torelli problem of recostructing a curve from its Jacobian from a computational point of view. Following Dubrovin, we design a machinery to solve this problem effectively, which builds on methods in numerical algebraic…
Counts of curves in $\mathbb{P}^1\times\mathbb{P}^1$ with fixed contact order with the toric boundary and satisfying point conditions can be determined with tropical methods by Mikhalkin. If we require that our curves intersect the zero-…
In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
In this short note we explain how to construct resolutions or regular alterations admitting an ample exceptional divisor, assuming the existence of projective resolutions or regular alterations. In particular, this implies the existence of…
We introduce a \textit{quantum index} for oriented real curves inside toric varieties. This quantum index is related to the computation of the area of the amoeba of the curve for some chosen 2-form. We then make a refined signed count of…
In this paper we apply a scaling invariance analysis to reduce a class of parabolic moving boundary problems to free boundary problems governed by ordinary differential equations. As well known free boundary problems are always non-linear…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
The paper establishes a formula for enumeration of curves of arbitrary genus in toric surfaces. It turns out that such curves can be counted by means of certain lattice paths in the Newton polygon. The formula was announced earlier in…
Nash proved that every irreducible component of the space of arcs through a singularity corresponds to an exceptional divisor that occurs on every resolution. He asked if the converse also holds: does every such exceptional divisor…
Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…
Configuration polynomials generalize the Kirchhoff polynomial of a graph, as well as the Symanzik polynomials that appear in the denominators of Feynman integrands. The configuration hypersurfaces cut out by such polynomials are typically…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
Solution of the Navier-Stokes equations with initial conditions (Cauchy problem) for 2D and 3D cases was obtained in the convergence series form by iterative method using Fourier and Laplace transforms in paper $\cite{TT02}$. For several…
Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…
We propose an asynchronous block-iterative decomposition algorithm to solve Nash equilibrium problems involving a mix of nonsmooth and smooth functions acting on linear mixtures of strategies. The methodology relies heavily on monotone…
We will use toric degenerations of the projective plane ${{\mathbb{P}}^ 2}$ to give a new proof of the triple points interpolation problems in the projective plane. We also give a complete list of toric surfaces that are useful as…
Composite minimization involves a collection of smooth functions which are aggregated in a nonsmooth manner. In the convex setting, we design an algorithm by linearizing each smooth component in accordance with its main curvature. The…
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…