相关论文: Fields of Parametrization and Optimal Affine Repar…
Let K be a field of characteristic zero, alpha algebraic of degree n over K. Given a proper parametrization psi of a rational curve C, we present a new algorithm to compute the hypercircle associated to the parametrization psi. As a…
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance $\epsilon>0$ and an $\epsilon$-irreducible algebraic affine plane curve $\mathcal C$ of…
Rational algebraic curves have been intensively studied in the last decades, both from the theoretical and applied point of view. In applications (e.g. level curves, linear homotopy deformation, geometric constructions in computer aided…
The square root velocity framework is a method in shape analysis to define a distance between curves and functional data. Identifying two curves if they differ by a reparametrisation leads to the quotient space of unparametrised curves. In…
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…
Let $k$ be an arbitrary field, and C be a curve in A^n defined parametrically by x_1=f_1(t),...,x_n=f_n(t), where f_1,...,f_n\in k[t]. A necessary and sufficient condition for the two function fields k(t) and k(f_1,...,f_n) to be same is…
Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…
We study arithmetical and geometrical properties of {\it maximal curves}, that is, curves defined over the finite field $\mathbb F_{q^2}$ whose number of $\mathbb F_{q^2}$-rational points reachs the Hasse-Weil upper bound. Under a…
In this paper we introduce the notion of rational Hausdorff divisor, we analyze the dimension and irreducibility of its associated linear system of curves, and we prove that all irreducible real curves belonging to the linear system are…
This paper puts forth a new formulation and algorithm for the elastic matching problem on unparametrized curves and surfaces. Our approach combines the frameworks of square root normal fields and varifold fidelity metrics into a novel…
In this paper, we study unirational differential curves and the corresponding differential rational parametrizations. We first investigate basic properties of proper differential rational parametrizations for unirational differential…
Let $\mathbb{F}_q$ denote the finite field with $q$ elements. In this work, we use characters to give the number of rational points on suitable curves of low degree over $\mathbb{F}_q$ in terms of the number of rational points on elliptic…
We present the technique of parametrization of plane algebraic curves from a number theorist's point of view and present Kapferer's simple and beautiful (but little known) proof that nonsingular curves of degree > 2 cannot be parametrized…
Using Weil descent, we give bounds for the number of rational points on two families of curves over finite fields with a large abelian group of automorphisms: Artin-Schreier curves of the form $y^q-y=f(x)$ with $f\in\Fqr[x]$, on which the…
In this paper, we present an algorithm for reparametrizing algebraic plane curves from a numerical point of view. That is, we deal with mathematical objects that are assumed to be given approximately. More precisely, given a tolerance…
Optimization problems over discrete or quantized variables are very challenging in general due to the combinatorial nature of their search space. Piecewise-affine regularization (PAR) provides a flexible modeling and computational framework…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
The advancements in neural rendering have increased the need for techniques that enable intuitive editing of 3D objects represented as neural implicit surfaces. This paper introduces a novel neural algorithm for parameterizing neural…
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…
We introduce a numerical framework to verify the finite step convergence of first-order methods for parametric convex quadratic optimization. We formulate the verification problem as a mathematical optimization problem where we maximize a…