Related papers: Computing Puiseux Series for Algebraic Surfaces
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
Motivated by applications in CNC machining, we provide a characterization of surfaces which are enveloped by a one-parametric family of congruent rotational cones. As limit cases, we also address developable surfaces and ruled surfaces. The…
Computer algebra algorithms are developed for evaluating the coefficients in Airy-type asymptotic expansions that are obtained from integrals with a large parameter. The coefficients are defined from recursive schemes obtained from…
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…
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We give an explicit formula for the $27$ lines of a smooth cubic surface near the Fermat surface. Our formula involves convergent power series with coefficients in the extension of rational numbers with the sixth root of unity. Our main…
Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…
There are many numerical methods for solving partial different equations (PDEs) on manifolds such as classical implicit, finite difference, finite element, and isogeometric analysis methods which aim at improving the interoperability…
In this paper we compute the first vertex of a generic Newton polygon in some special cases, and the corresponding Hasse polynomial. This allows us to show the nonexistence of $p$-cyclic coverings of the projective line in characteristic…
This paper is a survey of computational issues in algebraic geometry, with particular attention to the theory of Grobner bases and the regularity of an algebraic variety. 1. A geometric introduction to Grobner bases. 2. An algebraic…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
3D printing of surfaces has become an established method for prototyping and visualisation. However, surfaces often contain certain degenerations, such as self-intersecting faces or non-manifold parts, which pose problems in obtaining a 3D…
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure…
In this paper we present an error analysis of an Eulerian finite element method for solving parabolic partial differential equations posed on evolving hypersurfaces in $\mathbb{R}^d$, $d=2,3$. The method employs discontinuous piecewise…
We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the…
Motivated by problems involving triangle-decompositions of graphs, we examine the facet structure of the cone $\tau_n$ of weighted graphs on $n$ vertices generated by triangles. Our results include enumeration of facets for small $n$, a…