Related papers: Computing the Singularities of Rational Surfaces
We solve the problem of computing characteristic numbers of rational space curves with a cusp, where there may or may not be a condition on the node. The solution is given in the form of effective recursions. We give explicit formulas when…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
Let $k$ be a field with char $k \not= 2$, $X$ be an affine surface defined by the equation $z^2=P(x)y^2+Q(x)$ where $P(x), Q(x) \in k[x]$ are separable polynomials. We will investigate the rationality problem of $X$ in terms of the…
Comessatti proved that the set of real points of a rational real algebraic surface is either a nonorientable surface, or the two-sphere, or the torus. Conversely, it is easy to see that all of these surfaces admit a rational real algebraic…
A complex compact surface which carries an automorphism of positive topological entropy has been proved by Cantat to be either a torus, a K3 surface, an Enriques surface or a rational surface. Automorphisms of rational surfaces are quite…
We classify all complex surfaces with quotient singularities that do not contain any smooth rational curves, under the assumption that the canonical divisor of the surface is not pseudo-effective. As a corollary we show that if $X$ is a log…
We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.
In this article we intend to develop a simple and implementable algorithm for minimizing a convex function over the solution set of another convex optimization problem. Such a problem is often referred to as a simple bilevel programming…
Spatial information is often expressed using qualitative terms such as natural language expressions instead of coordinates; reasoning over such terms has several practical applications, such as bus routes planning. Representing and…
Self-rational maps of generic algebraic K3 surfaces are conjectured to be trivial. We relate this conjecture to a conjecture concerning the irreducibility of the universal Severi varieties parametrizing nodal curves of given genus and…
We show that projective K3 surfaces with odd Picard rank contain infinitely many rational curves. Our proof extends the Bogomolov-Hassett-Tschinkel approach, i.e., uses moduli spaces of stable maps and reduction to positive characteristic.
In the open problem of classification of rational cuspidal plane curves it is essential to find good necessary conditions on the type of singularities of a curve C in order C to exit. Motivated by the study of the Seiberg-Witten invariant…
We show that even dimensional Fermat cubic hypersurfaces are rational over any field of characteristic different from three by producing explicit rational parametrizations given by polynomials of low degree. As a byproduct of our…
The ruled surfaces, i.e., surfaces generated by one parametric set of lines, are widely used in the~field of applied geometry. An~isophote on a surface is a curve consisting of surface points whose normals form a constant angle with some…
The Somos-4 equation defines the sequences with this name. Looking at these sequences with an additional property we get a quartic polynomial in 4 variables. This polynomial defines a rational, projective surface in $\mathbb{RP}^{3}$. Here…
Let $S$ be a smooth projective surface over a field. We introduce the notion of integral decomposability and, respectively, the opposite notion of integral indecomposability, of the transcendental motive $M^2_{\rm tr}(S)$. If the…
We introduce the class of rational plane curves parameterizable by conics as an extension of the family of curves parameterizable by lines (also known as monoid curves). We show that they are the image of monoid curves via suitable…
This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…
We give a complete factorization of the invariant factors of resultant matrices built from birational parameterizations of rational plane curves in terms of the singular points of the curve and their multiplicity graph. This allows us to…
Polyhedral projection is a main operation of the polyhedron abstract domain.It can be computed via parametric linear programming (PLP), which is more efficient than the classic Fourier-Motzkin elimination method.In prior work, PLP was done…