Related papers: Recognizing projections of rational curves
We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
Generalizing a classical lemma of Castelnuovo, we characterize rational normal curves (resp. linearly normal elliptic curves) as curves $C\subset \PP^n$ such that the number of linearly independent hypersurfaces $Z\supset C$ of given…
A criterion for the existence of a plane model of an algebraic curve such that the Galois closures of projections from two points are the same is presented. As an application, it is proved that the Hermitian curve in positive characteristic…
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{\rho_1, \dots, \rho_k\}$ to another such set $\{\hat\rho_1, \dots, \hat\rho_k\}$. In other words, we must…
We show that for any two convex curves $C_1$ and $C_2$ in $\mathbb R^d$ parametrized by $[0,1]$ with opposite orientations, there exists a hyperplane $H$ with the following property: For any $t\in [0,1]$ the points $C_1(t)$ and $C_2(t)$ are…
A rational triangle is a triangle with rational side lengths. We consider three different families of rational triangles having a fixed side and whose vertices are rational points in the plane. We display a one-to-one correspondence between…
Let $C$ be a plane rational curve of degree $d$ and $p:\tilde C \rightarrow C$ its normalization. We are interested in the splitting type $(a,b)$ of $C$, where $\mathcal{O}_{\mathbb{P}^1}(-a-d)\oplus \mathcal{O}_{\mathbb{P}^1}(-b-d)$ gives…
Random projections offer an appealing and flexible approach to a wide range of large-scale statistical problems. They are particularly useful in high-dimensional settings, where we have many covariates recorded for each observation. In…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
Random Projection is a foundational research topic that connects a bunch of machine learning algorithms under a similar mathematical basis. It is used to reduce the dimensionality of the dataset by projecting the data points efficiently to…
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…
In this paper we present an algorithm to compute the (real and complex) straight lines contained in a rational surface, defined by a rational parameterization. The algorithm relies on the well-known theorem of Differential Geometry that…
Nonlinear programming is explicitly analyzed via a novel perspective/method and from a bottom-up manner. The philosophy is based on the recent findings on convex quadratic equation (CQE), which help clarify a geometric interpretation that…
We give necessary and sufficient topological conditions for a simple closed curve on a real rational surface to be approximable by smooth rational curves. We also study approximation by smooth rational curves with given complex…
Two planar graphs G1 and G2 sharing some vertices and edges are `simultaneously planar' if they have planar drawings such that a shared vertex [edge] is represented by the same point [curve] in both drawings. It is an open problem whether…
Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…
We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…