• 제목/요약/키워드: algebraic curve

검색결과 62건 처리시간 0.034초

THE CAYLEY-BACHARACH THEOREM VIA TRUNCATED MOMENT PROBLEMS

  • Yoo, Seonguk
    • Korean Journal of Mathematics
    • /
    • 제29권4호
    • /
    • pp.741-747
    • /
    • 2021
  • The Cayley-Bacharach theorem says that every cubic curve on an algebraically closed field that passes through a given 8 points must contain a fixed ninth point, counting multiplicities. Ren et al. introduced a concrete formula for the ninth point in terms of the 8 points [4]. We would like to consider a different approach to find the ninth point via the theory of truncated moment problems. Various connections between algebraic geometry and truncated moment problems have been discussed recently; thus, the main result of this note aims to observe an interplay between linear algebra, operator theory, and real algebraic geometry.

MARTENS' DIMENSION THEOREM FOR CURVES OF EVEN GONALITY

  • Kato, Takao
    • 대한수학회지
    • /
    • 제39권5호
    • /
    • pp.665-680
    • /
    • 2002
  • For a smooth projective irreducible algebraic curve C of odd gonality, the maximal possible dimension of the variety of special linear systems ${W^r}_d$(C) is d-3r by a result of M. Coppens et at. [4]. This bound also holds if C does not admit an involution. Furthermore it is known that if dim ${W^r}_d(C)qeq$ d-3r-1 for a curve C of odd gonality, then C is of very special type of curves by a recent progress made by G. Martens [11] and Kato-Keem [9]. The purpose of this paper is to pursue similar results for curves of even gonality which does not admit an involution.

Application of Quadratic Algebraic Curve for 2D Collision-Free Path Planning and Path Space Construction

  • Namgung, Ihn
    • International Journal of Control, Automation, and Systems
    • /
    • 제2권1호
    • /
    • pp.107-117
    • /
    • 2004
  • A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

Performance Study of genus 3 Hyperelliptic Curve Cryptosystem

  • Gupta, Daya;De, Asok;Chatterjee, Kakali
    • Journal of Information Processing Systems
    • /
    • 제8권1호
    • /
    • pp.145-158
    • /
    • 2012
  • Hyperelliptic Curve Cryptosystem (HECC) is well suited for all kinds of embedded processor architectures, where resources such as storage, time, or power are constrained due to short operand sizes. We can construct genus 3 HECC on 54-bit finite fields in order to achieve the same security level as 160-bit ECC or 1024-bit RSA due to the algebraic structure of Hyperelliptic Curve. This paper explores various possible attacks to the discrete logarithm in the Jacobian of a Hyperelliptic Curve (HEC) and addition and doubling of the divisor using explicit formula to speed up the scalar multiplication. Our aim is to develop a cryptosystem that can sign and authenticate documents and encrypt / decrypt messages efficiently for constrained devices in wireless networks. The performance of our proposed cryptosystem is comparable with that of ECC and the security analysis shows that it can resist the major attacks in wireless networks.

평면대수곡선을 기반으로 한 스테레오 비젼 (Stereo Vision based on Planar Algebraic Curves)

  • 안민호;이정림
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제27권1호
    • /
    • pp.50-61
    • /
    • 2000
  • 최근 원추곡선에 기반한 스테레오 비젼에 대한 연구가 주목을 받고 있는데, 이는 원추곡선이 행렬표현, 대응관계설정의 용이성, 그리고 실세계에서 쉽게 찾을 수 있다는 좋은 성질을 갖는다는 점에서 당연한 현상이라 여겨진다. 하지만, 일반적인 고차의 대수곡선에 대한 확장은 아직 성공적으로 이루어지지 못하고 있는 실정이다. 기약인 대수곡선 (irreducible algebraic curve)은 실세계에서 많지 않지만, 직선과 원추곡선은 무수히 많고, 따라서 이들의 곱으로 주어지는 높은 차수의 대수곡선도 무수히 많다. 본고에서는 2이상의 임의의 차수를 가지는 대수곡선을 calibration된 두 대의 카메라를 가지고 스테레오 문제를 푼다. 대응관계설정과 복원, 두 가지 문제 모두에 대한 closed form solution을 제시한다. $f_1,\;f_2,\;{\pi}$를 각각 두 이미지 곡선, 공간상의 평면이라 하고, $VC_P(g)$를 평면곡선 g와 점 P로 만들어지는 원추곡선이라 하면, $VC_{O1}(f_1)\;=\;VC_{O1}(VC_{O2}(f_2)\;∩\;{\pi})$ 의 관계를 이용하여 미지수인 평면 ${\pi}$의 계수들, $d_1,\;d_2,\;d_3$에 대한 다항 방정식들을 얻을 수 있다. 약간의 변형을 통하여 $d_1$에 대한 다항 방정식을 얻을 수 있고, 이 방정식의 유일한 양수해는 나머지 과정에서 매우 중요한 역할을 한다. 그 이후에는 $O(n^2)$개의 일변수 다항식에 대한 계산만으로 모든 스테레오 문제를 해결한다. 이는 과거의 여러 개의 다변수 다항식의 공통근을 구해야 했던 방법에 비교된다. synthetic 데이터와 실제 이미지에 대한 실험은 우리의 알고리듬이 옳음을 보여준다.

  • PDF

Semigroups which are not weierstrass semigroups

  • Kim, Seon-Jeong
    • 대한수학회보
    • /
    • 제33권2호
    • /
    • pp.187-191
    • /
    • 1996
  • Let C be a nonsingular complex projective algebraic curve (or a compact Riemann surface) of genus g. Let $M(C)$ denote the field of meromorphic functions on C and N the set of all non-negative integers.

  • PDF

RELATING GALOIS POINTS TO WEAK GALOIS WEIERSTRASS POINTS THROUGH DOUBLE COVERINGS OF CURVES

  • Komeda, Jiryo;Takahashi, Takeshi
    • 대한수학회지
    • /
    • 제54권1호
    • /
    • pp.69-86
    • /
    • 2017
  • The point $P{\in}{\mathbb{P}}^2$ is referred to as a Galois point for a nonsingular plane algebraic curve C if the projection ${\pi}_P:C{\rightarrow}{\mathbb{P}}^1$ from P is a Galois covering. In contrast, the point $P^{\prime}{\in}C^{\prime}$ is referred to as a weak Galois Weierstrass point of a nonsingular algebraic curve C' if P' is a Weierstrass point of C' and a total ramification point of some Galois covering $f:C^{\prime}{\rightarrow}{\mathbb{P}}^1$. In this paper, we discuss the following phenomena. For a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$, if there exists a common ramification point of ${\pi}_P$ and ${\varphi}$, then there exists a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with its Weierstrass semigroup such that H(P') = or , which is a semigroup generated by two positive integers r and 2r + 1 or 2r - 1, such that P' is a branch point of ${\varphi}$. Conversely, for a weak Galois Weierstrass point $P^{\prime}{\in}C^{\prime}$ with H(P') = or , there exists a nonsingular plane curve C with a Galois point P and a double covering ${\varphi}:C{\rightarrow}C^{\prime}$ such that P' is a branch point of ${\varphi}$.