相关论文: Algorithms for Determining Birationality of Parame…
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain…
For a field $k$ of characteristic $0$, we present an algorithm for deciding if a morphism $\phi:k[X_1,...,X_m]\to k[X_1,...,X_m]$ has an inverse. The algorithm also shows how to find the inverse when it exists.
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a…
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. A straightforward approach to this problem consists of…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
Given a unirational parameterization of a surface, we present a general algorithm to determine a birational parameterization without using parameterization algorithms. Additionally, if the surface is assumed to have a birational…
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…
Classification of curves up to affine transformation in a finite dimensional space was studied by some different methods. In this paper, we achieve the exact formulas of affine invariants via the equivalence problem and in the view of…
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…
A commonly studied means of parameterizing graph problems is the deletion distance from triviality (Guo et al. 2004), which counts vertices that need to be deleted from a graph to place it in some class for which efficient algorithms are…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
This paper addresses the problem of determining the symmetries of a plane or space curve defined by a rational parametrization. We provide effective methods to compute the involution and rotation symmetries for the planar case. As for space…
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
We parametrize the affine space of Artinian affine ideals of K[x,y] which have a given initial ideal with respect to the degree reverse lexicographic term order. The fact that the term order is degree compatible allows us to extend the…
Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…
Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
Let $K=k(C)$ be the function field of a complete nonsingular curve $C$ over an arbitrary field $k$. The main result of this paper states that a morphism $\phi:{\mathbb P}^N_K\to{\mathbb P}^N_K$ is isotrivial if and only if it has potential…