Related papers: Computing local intersection multiplicity of plane…
Blow-up solutions to a heat equation with spatial periodicity and a quadratic nonlinearity are studied through asymptotic analyses and a variety of numerical methods. The focus is on the dynamics of the singularities in the complexified…
We show how a type of multi-Frobenius nonclassicality of a curve defined over a finite field $\mathbb{F}_q$ of characteristic $p$ reflects on the geometry of its strict dual curve. In particular, in such cases we may describe all the…
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…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
We study the problem of counting pointed curves of fixed complex structure in blow-ups of projective space at general points. The geometric and virtual (Gromov-Witten) counts are found to agree asymptotically in the Fano (and some…
Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…
The purposes of this article are threefold. First, to determine numerically when an arbitrary blowup of a smooth surface is smooth. We show the surface is smooth if and only if certain rational parameters involving log discrepancy and…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.
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…
In this paper, we study existence of boundary blow-up solutions for elliptic equations involving regional fractional Laplacian. We also discuss the optimality of our results.
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…
When considering a real log canonical threshold (RLCT) that gives a Bayesian generalization error, in general, papers replace a mean error function with a relatively simple polynomial whose RLCT corresponds to that of the mean error…
We provide sharp lower bounds for the multiplicity of a local holomorphic foliation defined in a complex surface in terms of data associated to a germ of invariant curve. Then we apply our methods to invariant curves whose branches are…
Fulton and MacPherson famously constructed a configuration space that encodes infinitesimal collision data by blowing up the diagonals. We observe that when generalizing their approach to configuration spaces of filtered manifolds (e.g. jet…
We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…
Let $\mathcal{F}$ be a plane singular curve defined over a finite field $\mathbb{F}_q$. The linear system of plane curves of a given degree passing through the singularities of $\cF$ provides potentially good bounds for the number of points…
We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
We refine the iterated blow-up techniques. This technique, combined with a rigidity result and a specific choice of the kernel projection in the Poincar\'e inequality, might be employed to completely linearize blow-ups along at least one…