Related papers: Implicitization of rational hypersurfaces via line…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
This paper deals with a family of spatial rational curves that were introduced by Andradas, Recio and Sendra, under the name of hypercircles, as an algorithmic cornerstone tool in the context of improving the rational parametrization…
A new approach is established to computing the image of a rational map, whereby the use of approximation complexes is complemented with a detailed analysis of the torsion of the symmetric algebra in certain degrees. In the case the map is…
Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}^2 --\to…
We extend the notion of regularized integrals introduced by Li-Zhou that aims to assign finite values to divergent integrals on configuration spaces of Riemann surfaces. We then give cohomological formulations for the extended notion using…
In this paper we develop an optimisation based approach to multivariate Chebyshev approximation on a finite grid. We consider two models: multivariate polynomial approximation and multivariate generalised rational approximation. In the…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…
Neural implicit functions have emerged as a powerful representation for surfaces in 3D. Such a function can encode a high quality surface with intricate details into the parameters of a deep neural network. However, optimizing for the…
We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…
Motivated by applications in point counting algorithms using p-adic cohomology, we give an explicit description of integral lattices in rigid cohomology spaces that p-adically approximate logarithmic crystalline cohomology modules. These…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…
One introduces a class of projective parameterizations that resemble generalized de Jonqui\`eres maps. Any such parametrization defines a birational map $\mathfrak{F}$ of $\pp^n$ onto a hypersurface $V(F)\subset \pp^{n+1}$ with a strong…
We propose a calculus for modeling implicit programming that supports first-class, overlapping, locally scoped, and higher-order instances with higher-kinded types. We propose a straightforward generalization of the well-established System…
For a Del Pezzo surface of degree 8 given over the rationals we decide whether there is a rational parametrization of the surface and construct one in the affirmative case. We define and use the Lie algebra of the surface to reach the aim.…
Implicit 3D surface reconstruction of an object from its partial and noisy 3D point cloud scan is the classical geometry processing and 3D computer vision problem. In the literature, various 3D shape representations have been developed,…
We build two embedded resolution procedures of a quasi-ordinary singularity of complex analytic hypersurface, by using toric morphisms which depend only on the characteristic monomials associated to a quasi-ordinary projection of the…
We present a matrix-based algorithm for deciding if the parametrization of a curve or a surface is invertible or not, and for computing the inverse of the parametrization if it exists.
A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…