Integer Points Close to a Smooth Curve

∗ This research is partially supported by the Bulgarian National Science Fund under contract MM-403/9

Structural Analysis of Contours as the Sequences of the Digital Straight Segments and of the Digital Curve Arcs

Recognition of the object contours in the image as sequences of digital straight segments and/or digital curve arcs is considered in this article. The definitions of digital straight segments and of digital curve arcs are proposed. The methods and programs to recognize the object contours are represented. The algorithm to recognize the digital straight segments is formulated in terms of the growing pyramidal networks taking into account the conceptual model of memory and identification (Rabinovich [4]).

Key Agreement Protocol Using Elliptic Curve Matrix Power Function

* Work is partially supported by the Lithuanian State Science and Studies Foundation.

Weierstrass Points with First Non-Gap Four on a Double Covering of a Hyperelliptic Curve

2000 Mathematics Subject Classification: Primary 14H55; Secondary 14H30, 14H40, 20M14.

Corrigendum for "Weierstrass Points with first Non-Gap four on a Double Covering of a Hyperelliptic Curve"

In the proof of Lemma 3.1 in [1] we need to show that we may take the two points p and q with p ≠ q such that p+q+(b-2)g21(C′)∼2(q1+… +qb-1) where q1,…,qb-1 are points of C′, but in the paper [1] we did not show that p ≠ q. Moreover, we hadn't been able to prove this using the method of our paper [1]. So we must add some more assumption to Lemma 3.1 and rewrite the statements of our paper after Lemma 3.1. The following is the correct version of Lemma 3.1 in [1] with its proof.

Generalized Backscattering and the Lax-Phillips Transform

2000 Mathematics Subject Classification: 35P25, 35R30, 58J50.

Weierstrass Points with First Non-Gap Four on a Double Covering of a Hyperelliptic Curve II

2000 Mathematics Subject Classification: Primary 14H55; Secondary 14H30, 14J26.