Related papers: Computing Puiseux Series for Algebraic Surfaces
We study a class of algebraic surfaces of degree 3n in the complex projective space with only ordinary double points. They are obtained by using bivariate polynomials with complex coefficients related to the generalized cosine associated to…
We embark in a program of studying the problem of better approximating surfaces by triangulations(triangular meshes) by considering the approximating triangulations as finite metric spaces and the target smooth surface as their…
Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective $n$-space that are set theoretic complete…
We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
The mixed volume counts the roots of generic sparse polynomial systems. Mixed cells are used to provide starting systems for homotopy algorithms that can find all those roots, and track no unnecessary path. Up to now, algorithms for that…
Given an algebraic variety we get Puiseux type parametrizations on suitable Reinhardt domains. These domains are defined using the amoeba of hypersurfaces containing the discriminant locus of a finite projection of the variety.
A method for finding Puiseux series goes back to Isaac Newton, which gives the terms of Puiseux series through an infinite recursive process; an additional argument is then used to show that the resulting Puiseux series are convergent. This…
Optical surfaces represented by second-degree polynomials (quadratic or conics) are ubiquitous in optics. We revisit the equations of the conic shapes in the context of grazing incidence optics, gathering together the curves commonly used…
We give a new practical method for computing subvarieties of projective hypersurfaces. By computing the periods of a given hypersurface X, we find algebraic cohomology cycles on X. On well picked algebraic cycles, we can then recover the…
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
We present a computational scheme that derives a global polynomial level set parametrisation for smooth closed surfaces from a regular surface-point set and prove its uniqueness. This enables us to approximate a broad class of smooth…
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…
Results of number of geometric operations (often used in technical practise, as e.g. the operation of blending) are in many cases surfaces described implicitly. Then it is a challenging task to recognize the type of the obtained surface,…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation…
The present lecture notes give an introduction to works of Garc\'{i}a Barroso, Gonz\'alez P\'erez, Ruggiero and the author. The starting point of those works is a theorem of P\l oski, stating that one defines an ultrametric on the set of…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
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…