The Chord Construction

نویسنده

  • DAVID LEHAVI
چکیده

Let F be a smooth plane curve of degree 3. Let β be an element in Pic(F )[2]− {0}. Let us define F ′ := {p(p+ β)|p ∈ F} ⊂ (P2)∗. In this note we show that F ′ is a smooth embedding of F/β. Moreover, let β′ be the generator of Pic(F )/β, and let p ∈ F be a flex, then p(p+ β) + β′ is a flex on F ′. We present two proofs. 1. Notation. Let F be a smooth curve of genus 1, β ∈ Pic(F )[2]. Let us denote F ′ := F/β. Let π be the quotient map F → F ′ and let β be the image of the non-zero element in Pic(F )[2]/β in Pic(F ). Let H be an element in Pic(F ), and i : F → P2 the map associated to H. This notation will hold in the next definition and couple of lemmas. 2. Definition (The chord construction (c.c.)). Let us define i : F/β → P∗ {p, p + β} 7→ i(p)i(p + β) 3. Theorem. The c.c is an embedding. Proof. Let us identify F with its image i(F ). The c.c. is 1-1: Let H be the line corresponding to a point {p, β+p} ∈ F/β. Then F ∩H consists of three points: {p, p + β,H − (2p+ β)}. If (H − (2p + β)) − β 6= p, p + β, then i(H) consist of the unique point {p, p+β}, so it is 1-1. If (H − (2p+β))− β = p then H − (2p+β) = p+ β, so i is 1-1 here too. The remaining case is similar. (in the last two cases p (respectively p+ β) is a flex). For p ∈ P2, let p be the line it defines in P2∗ If F does not have a CM then for a generic p ∈ F , p is transversal to F : Suppose it is not. By upper-semicontinuity, it is never transversal, so F is the dual curve of i(F ). Since i(F ) is not a line (it is an immersion of F ), this induces a degree 1 map i(F ) → F , and therefor a degree 1 map F ′ → F . This means that F has a CM. Date: February 1, 2008. 1991 Mathematics Subject Classification. 14N15,14H52.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

A new weight system on chord diagrams via hyperkähler geometry

A weight system on graph homology was constructed by Rozansky and Witten using a compact hyperkähler manifold. A variation of this construction utilizing holomorphic vector bundles over the manifold gives a weight system on chord diagrams. We investigate these weights from the hyperkähler geometry point of view.

متن کامل

A new weight system on chord diagrams

A weight system on graph homology was constructed by Rozansky and Witten using a compact hyperkk ahler manifold. A variation of this construction utilizing holomorphic vector bundles over the manifold gives a weight system on chord diagrams. We investigate these weights from the hyperkk ahler geometry point of view.

متن کامل

Analysis of Chord Progression Data

Harmony is an important component in music. Chord progressions, which represent harmonic changes of music with understandable notations, have been used in popular music and Jazz. This article explores the question of whether a chord progression can be summarized for music retrieval. Various possibilities for chord progression simplification schemes, N-gram construction schemes, and distance fun...

متن کامل

Bertrand’s Paradox Revisited: More Lessons about that Ambiguous Word, Random

The Bertrand paradox question is: “Consider a unit-radius circle for which the length of a side of an inscribed equilateral triangle equals 3 . Determine the probability that the length of a ‘random’ chord of a unit-radius circle has length greater than 3 .” Bertrand derived three different ‘correct’ answers, the correctness depending on interpretation of the word, random. Here we employ geomet...

متن کامل

Understanding Chord Performance and Topology - aware Overlay Construction for Chord

We studied performance of the Chord scalable lookup system with several performance enhancements. For the denser finger technique, we gave analytical result that shows the average lookup path length decreases slower than the maximum length and converges to it as finger density grows higher. Location cache, as implemented in MIT Chord, is shown to be able to reduce the lookup path length by 1/2 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008