اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimilarity detection of rational space curves
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra setting. Helical curves, where curvature and torsion are proportional, need to be distinguished as a special case. The algorithm is easy to implement, as it involves only standard computer algebra techniques, such as greatest common divisors and resultants, and Grobner basis for the special case of helical curves. Details on the implementation and experimentation carried out using the computer algebra system Maple 18 are provided.
قيم البحث
اقرأ أيضاً
This is a follow-up paper of arXiv:1805.00115, where rational curves in surfaces that satisfy general positioned point and cross-ratio conditions were enumerated. A suitable correspondence theorem provided in arXiv:1509.07453 allowed us to use tropic
al geometry, and, in particular, a degeneration technique called floor diagrams. This correspondence theorem also holds in higher dimension. In the current paper, we introduce so-called cross-ratio floor diagrams and show that they allow us to determine the number of rational space curves that satisfy general positioned point and cross-ratio conditions. Moreover, graphical contributions are introduced which provide a novel and structured way of understanding multiplicities of floor decomposed curves in $mathbb{R}^3$. Additionally, so-called condition flows on a tropical curve are used to reflect how conditions imposed on a tropical curve yield different types of edges. This concept is applicable in arbitrary dimension.
In a joint work with N. Mok in 1997, we proved that for an irreducible representation $G subset {bf GL}(V),$ if a holomorphic $G$-structure exists on a uniruled projective manifold, then the Lie algebra of $G$ has nonzero prolongation. We tried to ge
neralize this to an arbitrary connected algebraic subgroup $G subset {bf GL}(V)$ and a complex manifold containing an immersed rational curve, but the proposed proof had a flaw.
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve. The algori
thm is designed to provide the exact result for all inputs. Its a symbolic-numeric algorithm based on subresultant computation. Simple algebraic criteria are given to certify the output of the algorithm. The algorithm uses only one projection of the non-reduced space curve augmented with adjacency information around some particular points of the space curve. The algorithm is implemented with the Mathemagix Computer Algebra System (CAS) using the SYNAPS library as a backend.
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 curves. Then we
show that the implicitization problem of proper linear differential rational parametric equations can be solved by means of differential resultants. Furthermore, for linear differential curves, we give an algorithm to determine whether an implicitly given linear differential curve is unirational and, in the affirmative case, to compute a proper differential rational parametrization for the differential curve.
Consider a simple algebraic group G of adjoint type, and its wonderful compactification X. We show that X admits a unique family of minimal rational curves, and we explicitly describe the subfamily consisting of curves through a general point. As an
application, we show that X has the target rigidity property when G is not of type A_1 or C.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
