相关论文: An algorithm for computing the Arf closure of an a…
Two algebroid branches are said to be equivalent if they have the same multiplicity sequence. It is known that two algebroid branches $R$ and $T$ are equivalent if and only if their Arf closures, $R'$ and $T'$ have the same value semigroup,…
Algebraic curve branches can be classified according to their multiplicity sequences. Arf's solution to this problem using Arf closures and possible implementations of Henselization are discussed.
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
In this paper we present a method for extraction of arcs of the algebraic curves of the higher order. Method is applied on conics, Cartesian ovals, trifocal curves and generalized Weber's curve.
A new robust algorithm for the numerical computation of biarcs, i.e. $G^1$ curves composed of two arcs of circle, is presented. Many algorithms exist but are based on geometric constructions, which must consider many geometrical…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
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…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
Inspired by previous work of Shoup, Lenstra-De Smit and Couveignes-Lercier, we give fast algorithms to compute in (the first levels of) the ell-adic closure of a finite field. In many cases, our algorithms have quasi-linear complexity.
In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of…
In this article, we construct algebraic equations for a curve C and a map f to an elliptic curve E, with pre-specified branching data. We do this by determining certain relations that the periods of C and E must satisfy and use these…
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
Kok et.al. [3] introduced Jaco Graphs \emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1]…
The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…
An algorithm is given to compute a normal form for hyperelliptic curves. The elliptic case has been treated in a previous paper. In this paper the hyperelliptic case is treated.