English
Related papers

Related papers: Recognizing projections of rational curves

200 papers

We extend Jordan's notion of principal angles to work for two subspaces of quaternionic space, and so have a method to analyze two orthogonal projections in M_n(A) for A the real, complex or quaternionic field (or skew field). From this we…

Operator Algebras · Mathematics 2014-06-13 Terry A. Loring

We classify graphs and, more generally, finite relational structures that are identified by C2, that is, two-variable first-order logic with counting. Using this classification, we show that it can be decided in almost linear time whether a…

Logic in Computer Science · Computer Science 2015-03-31 Sandra Kiefer , Pascal Schweitzer , Erkal Selman

We develop in this article an algorithm that, given a projective curve $C$, computes a \textit{gonal map}, that is, a finite morphism from $C$ to the projective line of minimal degree. Our method is based on the computation of scrollar…

Algebraic Geometry · Mathematics 2013-04-10 Josef Schicho , Frank-Olaf Schreyer , Martin Weimann

We study the relationship between rational points and Galois points for a plane curve over a finite field. It is known that the set of Galois points coincides with that of rational points of the projective plane if the curve is the…

Algebraic Geometry · Mathematics 2016-03-04 Satoru Fukasawa

Artificial Intelligence systems cannot yet match human abilities to apply knowledge to situations that vary from what they have been programmed for, or trained for. In visual object recognition methods of inference exploiting top-down…

Artificial Intelligence · Computer Science 2022-05-18 Frank Guerin

We consider the algebraic curve defined by $y^m = f(x)$ where $m \geq 2$ and $f(x)$ is a rational function over $\mathbb{F}_q$. We extend the concept of pure gap to {\bf c}-gap and obtain a criterion to decide when an $s$-tuple is a {\bf…

Combinatorics · Mathematics 2020-11-10 Daniele Bartoli , Ariane M. Masuda , Maria Montanucci , Luciane Quoos

We consider the popular and classical method of alternating projections for finding a point in the intersection of two closed sets. By situating the algorithm in a metric space, equipped only with well-behaved geodesics and angles (in the…

Optimization and Control · Mathematics 2022-06-10 Adrian S. Lewis , Genaro López-Acedo , Adriana Nicolae

We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected.

Geometric Topology · Mathematics 2009-11-30 James Cruickshank , Jonathan McLaughlin

IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs. Given an embedded IC-planar graph $G$ with $n$…

Computational Geometry · Computer Science 2016-07-19 Franz J. Brandenburg , Walter Didimo , William S. Evans , Philipp Kindermann , Giuseppe Liotta , Fabrizio Montecchiani

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

Computational Geometry · Computer Science 2015-07-01 Xizhong Zheng , Robert Rettinger

This article continues the investigation started in [9] on subdivision schemes refining 2D point-normal pairs, obtained by modifying linear subdivision schemes using the circle average. While in [9] the convergence of the Modified…

Graphics · Computer Science 2018-05-21 Evgeny Lipovetsky , Nira Dyn

In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…

Algebraic Geometry · Mathematics 2012-03-13 Lucio Guerra , Gian Pietro Pirola

This thesis derives, tests and applies two linear projection algorithms for machine learning under non-stationarity. The first finds a direction in a linear space upon which a data set is maximally non-stationary. The second aims to…

Machine Learning · Computer Science 2011-10-05 Duncan A. J. Blythe

Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson's outer…

Optimization and Control · Mathematics 2019-05-28 Andreas Löhne , Birgit Rudloff , Firdevs Ulus

Finding a point in the intersection of a collection of closed convex sets, that is the convex feasibility problem, represents the main modeling strategy for many computational problems. In this paper we analyze new stochastic reformulations…

Optimization and Control · Mathematics 2018-01-16 Ion Necoara , Peter Richtarik , Andrei Patrascu

We give several constructions of bicuspidal rational complex projective plane curves, and list the Newton pairs and the multiplicity sequences of the singularities on the resulting curves. Although the existence of some of the listed cusp…

Algebraic Geometry · Mathematics 2016-08-10 József Bodnár

We study the matrix factorizations defined by the generic plane projections of a curve singularity of $\mathbb{C}^3$. On the other hand, given a plane curve singularity $Y\subset \mathbb{C}^2$ we study the family of matrix factorizations…

Algebraic Geometry · Mathematics 2025-02-03 Joan Elias

This paper studies the problem of identifying directions of axial symmetry in multivariate distributions. Theoretical results are derived on how the measure or cardinality of the set of symmetry directions relates to spherical symmetry. The…

Statistics Theory · Mathematics 2025-12-29 Alejandro Cholaquidis , Ricardo Fraiman , Manuel Hernández-Banadik , Stanislav Nagy

We determine the splitting (isomorphism) type of the normal bundle of a generic genus-0 curve with 1 or 2 components in any projective space, as well as the (sometimes nontrivial) way the bundle deforms locally with a general deformation of…

Algebraic Geometry · Mathematics 2007-05-23 Ziv Ran

The problem of the minimization of least squares functionals with $\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are…

Numerical Analysis · Mathematics 2010-10-26 Dirk A. Lorenz