Related papers: Computing Hypercircles by Moving Hyperplanes

In this paper we present three related results on the subject of fields of parametrization. Let C be a rational curve over a field of characteristic zero. Let K be a field finitely generated over Q, such that it is a field of definition of…

This paper deals with a family of spatial rational curves that were introduced by Andradas, Recio and Sendra, under the name of hypercircles, as an algorithmic cornerstone tool in the context of improving the rational parametrization…

We study real hyperfields, focusing in particular on those that are finite with cyclic positive cones. All real hyperfields have characteristic zero, although they can still be classified using the C-characteristic, an invariant that…

We consider the parameterization ${\mathbf{f}}=(f_0,f_1,f_2)$ of a plane rational curve $C$ of degree $n$, and we want to study the singularities of $C$ via such parameterization. We do this by using the projection from the rational normal…

In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

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…

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…

Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…

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…

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…

The PC algorithm infers causal relations using conditional independence tests that require a pre-specified Type I $\alpha$ level. PC is however unsupervised, so we cannot tune $\alpha$ using traditional cross-validation. We therefore…

Let $K$ be a local field of residue characteristic $p$. Let $C$ be a curve over $K$ whose minimal proper regular model has totally degenerate semi-stable reduction. Under certain hypotheses, we compute the prime-to-$p$ rational torsion…

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…

An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…

We demonstrate some lower bounds for parameterized problems via parameterized classes corresponding to the classical ${\rm AC}^0$. Among others, we derive such a lower bound for all fpt-approximations of the parameterized clique problem and…