相关论文: Equations of Parametric Surfaces via Syzygies
Let $S$ be a parametric surface in $\proj{3}$ given as the image of $\phi: \proj{1} \times \proj{1} \to \proj{3}$. This paper will show that the use of syzygies in the form of a combination of moving planes and moving quadrics provides a…
In this revised version, we add some expository material and references and make some minor corrections.
We show that the implicit equation of a surface in 3-dimensional projective space parametrized by bi-homogeneous polynomials of bi-degree (d,d), for a given positive integer d, can be represented and computed from the linear syzygies of its…
A parameterized surface can be represented as a projection from a certain toric surface. This generalizes the classical homogeneous and bihomogeneous parameterizations. We extend to the toric case two methods for computing the implicit…
We show that the method of moving quadrics for implicitizing surfaces in P^3 applies in certain cases where base points are present. However, if the ideal defined by the parametrization is saturated, then this method rarely applies.…
We give sharp lower bounds for the degree of the syzygies involving the partial derivatives of a homogeneous polynomial defining an even dimensional nodal hypersurface. This implies the validity of formulas due to M. Saito, L. Wotzlaw and…
We introduce the notion of radical parametrization of a surface, and we provide algorithms to compute such type of parametrizations for families of surfaces, like: Fermat surfaces, surfaces with a high multiplicity (at least the degree…
In this paper we show that a surface in P^3 parametrized over a 2-dimensional toric variety T can be represented by a matrix of linear syzygies if the base points are finite in number and form locally a complete intersection. This…
In this note, we give a slight improvement of a result of A. K\"uronya and V. Lozovanu about higher syzygies on abelian surfaces.
We unveil in concrete terms the general machinery of the syzygy-based algorithms for the implicitization of rational surfaces in terms of the monomials in the polynomials defining the parametrization, following and expanding our joint…
We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…
We derive the implicit equations for certain parametric surfaces in three-dimensional projective space termed tensor product surfaces. Our method computes the implicit equation for such a surface based on the knowledge of the syzygies of…
The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…
This paper shows that the multiplicity of the base points locus of a projective rational surface parametrization can be expressed as the degree of the content of a univariate resultant. As a consequence, we get a new proof of the degree…
Symmetries and reductions of some algebraic equations are considered. Transformations that preserve the form of several algebraic equations, as well as transformations that reduce the degree of these equations, are described. Illustrative…
We present a method for computing projective isomorphisms between rational surfaces that are given in terms of their parametrizations. The main idea is to reduce the computation of such projective isomorphisms to five base cases by…
It is well known that every Del Pezzo surface of degree 5 defined over k is parametrizable over k. In this paper we give an efficient construction for parametrizing, as well as algorithms for constructing examples in every isomorphism class…
We provide a resultant-based formula for the total degree w.r.t. the spatial variables of the generic offset to a parametric surface. The parametrization of the surface is not assumed to be proper.
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…