weierstrass semigroups at several points total inflection
play

Weierstrass semigroups at several points, total inflection points on - PowerPoint PPT Presentation

Mar 25, 2024 •355 likes •1.56k views

Weierstrass semigroups at several points, total inflection points on curves and coding theory C cero Carvalho Faculdade de Matem atica Universidade Federal de Uberl andia Algebraic curves over finite fields RICAM - November 1115,

  1. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  2. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  3. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  4. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  5. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  6. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  7. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  8. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  9. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  10. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  11. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  12. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  13. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  14. Weierstrass semigroup at several points We will write n := ( n 1 , . . . , n m ) ∈ N m 0 , e i ∈ N m 0 for the m -tuple that has 1 in the i -th position and 0 in the others, L ( n ) := L ( n 1 P 1 + · · · + n m P m ) and ℓ ( n ) := dim L ( n ). Lemma. The following are equivalent: (i) n ∈ H ; (ii) ℓ ( n ) = ℓ ( n − e i ) + 1 for all i = 1 , . . . , m ; (iii) The linear system | n 1 P 1 + · · · + n m P m | is base-point free. We call N m 0 \ H the set of gaps of H , it is a finite set whose cardinality may vary with P 1 , . . . , P m . For example, if X is a hyperelliptic curve of genus 4, and m = 2 we get: P 2 ✻ P 2 ✻ q q q q q q ❛ q ❛ q ❛ q 26 gaps if P 1 and P 2 are both W. points of X ❛ ❛ ❛ ❛ ❛ q ✲ P 1 ❛ ❛ ❛ q ❛ q ❛ q q ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q 9 gaps if P 1 and P 2 are not W. points of X ✲ P 1 ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q ❛ q ❛ q ❛ q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 3 / 12

  15. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , j � = i , then: (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); (ii) n is a minimal element of the set { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  16. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , j � = i , then: (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); (ii) n is a minimal element of the set { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  17. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , j � = i , then: (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); (ii) n is a minimal element of the set { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  18. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , j � = i , then: (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); (ii) n is a minimal element of the set { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  19. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  20. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  21. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  22. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  23. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  24. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  25. Weierstrass semigroup at several points From now on we assume that #( F ) ≥ m . Properties of H : • For all i = 1 , . . . , m we get that a ∈ H ( P i ) if and only if a . e i ∈ H . • Let ( n 1 , . . . , n m ), ( p 1 , . . . , p m ) ∈ H and set q i := max { n i , p i } , i = 1 , . . . , m . Then ( q 1 , . . . , q m ) ∈ H . Define ( n 1 , . . . , n m ) � ( p 1 , . . . , p m ) if n i ≤ p i ∀ i = 1 , . . . , m . Then � is a partial order in N m 0 . Let i ∈ { 1 , . . . , m } , let n i ∈ N 0 and let n = ( n 1 , . . . , n m ) be a minimal element (w.r.t. � ) P 2 ✻ of the set { ( p 1 , , . . . , p m ) ∈ H | p i = n i } . If q q q n i > 0 and n j > 0 for some j ∈ { 1 , . . . , m } , q ❛ q j � = i , then: q ❛ q ❛ ❛ ❛ q (i) n i e i / ∈ H (hence n i / ∈ H ( P i )); q ❛ q ❛ q ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q (ii) n is a minimal element of the set ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q { ( p 1 , . . . , p m ) ∈ H | p j = n j } , so n j / ∈ H ( P j ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 4 / 12

  26. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / 1 , . . . , m . i n i ≤ γ , where γ is the gonality of (ii) If 1 + � X , then n ∈ G 0 . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  27. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / 1 , . . . , m . i n i ≤ γ , where γ is the gonality of (ii) If 1 + � X , then n ∈ G 0 . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  28. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  29. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  30. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q ∇ 2 ( n ) q q ❛ q q ❛ ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  31. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  32. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q ∇ 2 ( n ) q q ❛ q q ❛ q q ❛ q q q ✲ ∇ 1 ( n ) ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  33. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  34. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  35. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  36. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m P 2 ✻ 0 . q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q 1 , . . . , m . q ❛ q q ❛ q i n i ≤ γ , where γ is the gonality of (ii) If 1 + � ❛ ❛ ❛ q q ❛ q ❛ q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ q q ❛ q ❛ q ❛ q q ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 q ❛ q ❛ q ❛ q ❛ q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  37. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  38. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  39. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  40. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  41. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  42. Weierstrass semigroup and AG codes Given n = ( n 1 , . . . , n m ) ∈ N m 0 , define ∇ i ( n ) := { ( p 1 , . . . , p m ) ∈ H | p i = n i and p j ≤ n j ∀ j � = i } Lemma. Let n ∈ N m 0 . The following are equivalent: ∈ H ; (i) n / (ii) ∇ i ( n ) = ∅ for some i ∈ { 1 , . . . , m } . We say that n ∈ N m 0 is a pure gap if ∇ i ( n ) = ∅ for all i ∈ { 1 , . . . , m } . Denote the set of pure gaps by G 0 . P 2 P 2 ✻ ✻ Lemma: Let n = ( n 1 , . . . , n m ) ∈ N m 0 . q q (i) If n ∈ G 0 then n i ∈ H ( P i ) for all i = / q q q q q q 1 , . . . , m . ❛ ❛ q q q q ❛ ❛ q q (ii) If 1 + � i n i ≤ γ , where γ is the gonality of ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q X , then n ∈ G 0 . ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ q ❛ q q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q ✲ ✲ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ ❛ P 1 P 1 q ❛ q ❛ q q ❛ ❛ q q ❛ ❛ q q ❛ ❛ q q q q q q q q C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 5 / 12

  43. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  44. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  45. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  46. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  47. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  48. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  49. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  50. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  51. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  52. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  53. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  54. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  55. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  56. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  57. Weierstrass semigroup and AG codes Assume that F is a finite field, let D := Q 1 + · · · + Q n , where Q 1 , . . . , Q n are distinct rational points of X , all distinct from P 1 , . . . , P m , and let G be a divisor with support on P 1 , . . . , P m . Let C Ω ( D , G ) be the algebraic geometry code which is the image of the map ϕ : Ω( G − D ) → F n defined by ϕ ( η ) = ( res Q 1 ( η ) , . . . , res Q n ( η )). Weierstrass semigroup of two rational points in Y 8 + Y = X 9 over F 64 . We know that C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2). Building on previous work by Homma, Kim and Matthews, F. Torres and myself proved the following results. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , and let G = � m i =1 ( n i + p i − 1) P i . Then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m . Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G = � m i =1 ( n i + p i − 1) P i , then C Ω ( D , G ) is an [ n , k , d ]-code, with d ≥ deg( G ) − (2 g − 2) + m + � n i =1 ( p i − n i ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 6 / 12

  58. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  59. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  60. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  61. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  62. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  63. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  64. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  65. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  66. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  67. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  68. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  69. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  70. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  71. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  72. Weierstrass semigroup and AG codes A similar improvement can be made to bounds for the generalized Hamming distance of AG codes. Let r be a positive integer, and C ⊂ F m a linear code. Let U be a subcode of C , the support of U is defined as supp ( U ) := { i | c i � = 0 for some ( c 1 , . . . , c m ) ∈ U } . The r -th generalized Hamming distance of C is defined as d r ( C ) = min { #( supp ( U )) | U is a subcode of C , dim( U ) = r } . Let s be a positive integer and set γ s := { min(deg( A )) | A a divisor with dim L ( A ) = s } . The sequence γ 1 , γ 2 , ... is the gonality sequence of X ; γ 1 = 0 and γ 2 is the gonality of X . This concept was introduced by Yang, Kummar and Stichtenoth in a paper where they proved the following result. Theorem. The r -th generalized Hamming distance of an AG code of length n defined over X satisfies i) d r ( C L ( D , G ) ≥ n − deg( G ) + γ r ; ii) d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2) + γ r . C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 7 / 12

  73. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  74. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  75. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  76. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  77. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  78. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  79. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  80. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  81. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  82. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  83. Weierstrass semigroup and AG codes Using the concept of pure gaps we were able to prove the following result. Theorem. Assume that ( n 1 , . . . , n m ) and ( p 1 , . . . , p m ) are pure gaps of H , with n i ≤ p i for all i = 1 , . . . , m , and that ( q 1 , . . . , q m ) is also a pure gap whenever n i ≤ q i ≤ p i , for all i = 1 , . . . , m . Let G := � m i =1 p i P i . Then: i) d r ( C L ( D , G ) ≥ n − deg( G ) + � m i =1 ( p i − n i ) + m + γ r ; ii) i =1 ( p i − n i )+ m − ( � m d r ( C Ω ( D , G ) ≥ deg( G ) − (2 g − 2)+ γ r + � m i =1 ( p i − n i )+ m ). The last item can lead to an improvement because γ r < γ r +1 for all positive integers r . Thus the existence of pure gaps in H may lead to an improvement of the bounds for the generalized Hamming distances of AG codes. Now we will show that the existence of total inflection points in plane curves determine the existence of pure gaps in certain Weierstrass semigroups. C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 8 / 12

  84. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  85. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  86. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  87. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  88. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  89. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  90. Total inflection points and pure gaps Assume that X is a smooth plane, projective curve, of degree r > 4. We say that P ∈ X is a total inflection point if the tangent line at P intersects X only at P . In a work with T. Kato, we proved the following. Theorem. Let P 1 , P 2 and P 3 be rational, total inflection points of X which do not lie in a line. Then (( r − 4) r , 1 , 1), (1 , ( r − 4) r , 1) and (1 , 1 , ( r − 4) r ) are pure gaps of H ( P 1 , P 2 , P 3 ). Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m j =1 s j , for all i = 1 , . . . , m , and � m j =1 s j ≤ r − 2 − m . Theorem. Let P , P 1 , . . . , P m ∈ X be rational points, with P a total inflection point. Let 0 ≤ i < r − 3 and α 1 , . . . , α m be positive integers such that � m j =1 α j ≤ r − i − 3. Then ( ir + 1 , α 1 , . . . , α m ) is a pure gap of H ( P , P 1 , . . . , P m ). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 9 / 12

  91. Total inflection points and pure gaps Theorem. Let P 1 , . . . , P m be total inflection points on X . Then ( s 1 r + α 1 , . . . , s m r + α m ) is a pure gap of H ( P 1 , . . . , P m ), whenever s i , α i are integers such that s i ≥ 0, 1 ≤ α i ≤ r − 1 − i − � m i =1 s i , for all i = 1 , . . . , m , and � m i =1 s i ≤ r − 2 − m . Application. Take X ⊂ P 2 ( K ) the Hermitian curve of degree q + 1 defined over F = GF ( q 2 ). Let s and m be positive integers such that s + m ≤ q − 1; let P 1 , . . . , P m be distinct rational points of X . Take s 1 = s , s 2 = · · · = s m = 0, from the above theorem we get that ( sr + α 1 , α 2 , . . . , α m ) is a pure gap at H ( P 1 , . . . , P m ) whenever 1 ≤ α i ≤ q − i − s ( i = 1 , . . . , m ) (i.e. only have pure gaps “between” ( sr + 1 , 1 , . . . , 1) and ( sr + q − 1 − s , q − 2 − s , . . . , q − m − s )). Let G = (2 sr + q − 1 − s ) P 1 + � m i =2 ( q − i − s ) P i and let D be the sum of the other q 3 + 1 − m rational points of X . From the work together with F. Torres we know that C Ω ( D , G ) is an [ q 3 + 1 − m , k , d ] code with d ≥ 2 s ( q + 1) + m (2 q − 2 s − 1) − m 2 − ( q + 1)( q − 2). C´ ıcero Carvalho (UFU) Inflection points on curves and coding theory 10 / 12

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

RIT n. a point on a curve at which the curvature which the curvature Inflection Inflection

RIT n. a point on a curve at which the curvature which the curvature Inflection Inflection

RIT n. a point on a curve at which the curvature which the curvature Inflection Inflection (second derivative) Points: changes signs changes signs The year in Review Review Jeremy Haefner n. A moment of dramatic Provost Provost

779 views • 30 slides
2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The

2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The

2D Computer Graphics Diego Nehab Summer 2020 IMPA 1 Inflection points and double points The coordinates P G of P in G are T P F F P F G P G F T P G P G T P F (In RP 2 the adjugate T is as good as the inverse) A line in L has coordinates L F a

986 views • 77 slides
Karl Theodor Wilhelm Weierstrass 31 October 1815 19 February 1897 Karl Theodor Wilhelm

Karl Theodor Wilhelm Weierstrass 31 October 1815 19 February 1897 Karl Theodor Wilhelm

Happy Hallo WEIERSTRASS Did you know that Weierestrass was born on Halloween? Neither did we Dmitriy Bilyk will be speaking on Lacunary Fourier series: from Weierstrass to our days Monday, Oct 31 at 12:15pm in Vin 313 followed by Mesa

1.83k views • 95 slides
Some nilpotent and commutative finite semigroups Manuel Delgado WORKSHOP ON SEMIGROUPS (To

Some nilpotent and commutative finite semigroups Manuel Delgado WORKSHOP ON SEMIGROUPS (To

Some nilpotent and commutative finite semigroups Manuel Delgado WORKSHOP ON SEMIGROUPS (To remember John M. Howie on the occasion of his 76th birthday) Lisbon, 23-25 May, 2012 Numerical Semigroups Quotients Computations Nilpotent semigroups

269 views • 14 slides
Concavity MCV4U: Calculus &amp; Vectors Consider the graph of y = x 3 below. Concavity and Points

Concavity MCV4U: Calculus &amp; Vectors Consider the graph of y = x 3 below. Concavity and Points

c u r v e s k e t c h i n g c u r v e s k e t c h i n g Concavity MCV4U: Calculus &amp; Vectors Consider the graph of y = x 3 below. Concavity and Points of Inflection J. Garvin J. Garvin Concavity and Points of Inflection Slide 1/21

332 views • 4 slides
On evolution semigroups and Trotter product operator-norm estimates Artur Stephan joint work

On evolution semigroups and Trotter product operator-norm estimates Artur Stephan joint work

Weierstrass Institute for Applied Analysis and Stochastics On evolution semigroups and Trotter product operator-norm estimates Artur Stephan joint work with Hagen Neidhardt and Valentin Zagrebnov Workshop on Operator Theory and Krein Spaces

448 views • 25 slides
MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points Professor Donald L. White

MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points Professor Donald L. White

MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 5 Concavity Definition A function f is concave up on

71 views • 5 slides
MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points - Example Professor Donald L.

MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points - Example Professor Donald L.

MATH 12002 - CALCULUS I 3.3: Concavity &amp; Inflection Points - Example Professor Donald L. White Department of Mathematical Sciences Kent State University D.L. White (Kent State University) 1 / 11 Example Example Let f ( x ) = 3 x 4

359 views • 11 slides
Fractal attractors in skew products systems III: Hausdorff dimension of Weierstrass graphs Tobias

Fractal attractors in skew products systems III: Hausdorff dimension of Weierstrass graphs Tobias

Fractal attractors in skew products systems III: Hausdorff dimension of Weierstrass graphs Tobias J ager 4th Bremen Winter School Dynamics, Chaos and Applications 14-18 March 2016 The Weierstrass graph Graph of the Weierstrass function.

295 views • 10 slides
Feng-Rao distances in Arf and inductive semigroups Jos e I. Farr an Pedro A. Garc

Feng-Rao distances in Arf and inductive semigroups Jos e I. Farr an Pedro A. Garc

AG codes Numerical semigroups Arf semigroups Inductive semigroups Feng-Rao distances in Arf and inductive semigroups Jos e I. Farr an Pedro A. Garc a-S anchez International Meeting on Numerical Semigroups Levico Terme July

393 views • 20 slides
NUMERICAL SEMIGROUPS FengRao distances in numerical semigroups and application to AG

NUMERICAL SEMIGROUPS FengRao distances in numerical semigroups and application to AG

I BERIAN MEETING ON NUMERICAL SEMIGROUPS FengRao distances in numerical semigroups and application to AG codes Porto 2008 Jos e Ignacio Farr an Mart n ignfar@eis.uva.es Departamento de Matem atica Aplicada Universidad

1.61k views • 94 slides
Counting numerical semigroups of a given genus by using -hyperelliptic semigroups Matheus

Counting numerical semigroups of a given genus by using -hyperelliptic semigroups Matheus

Counting numerical semigroups of a given genus by using -hyperelliptic semigroups Matheus Bernardini 1 University of Campinas / Federal Institute of S ao Paulo (Joint work in progress with Fernando Torres 1 ) International Meeting on

779 views • 51 slides
Lecture 1/Chapter 1 a maximum of 4 points, and total maximum is 50 points. For problems

Lecture 1/Chapter 1 a maximum of 4 points, and total maximum is 50 points. For problems

Extra Credit Problems must be handed in by the following lecture. They must be your own individual work. Each is worth Lecture 1/Chapter 1 a maximum of 4 points, and total maximum is 50 points. For problems involving survey variables,

352 views • 7 slides
Semigroups of Left I-quotients Nassraddin Ghroda May 11, 2010 Semigroups of Left I-quotients

Semigroups of Left I-quotients Nassraddin Ghroda May 11, 2010 Semigroups of Left I-quotients

Semigroups of Left I-quotients Semigroups of Left I-quotients Nassraddin Ghroda May 11, 2010 Semigroups of Left I-quotients Outline Background 1 Inverse hull of left I-quotients of left ample semigroups 2 Extension of homomorphisms 3

794 views • 44 slides
In search of meaning: Semantic effects on past-tense inflection Rebecca Butler, Karalyn Patterson

In search of meaning: Semantic effects on past-tense inflection Rebecca Butler, Karalyn Patterson

In search of meaning: Semantic effects on past-tense inflection Rebecca Butler, Karalyn Patterson and Anna M. Woollams -- Nehchal Jindal (Y9366) Basics Past-tense inflection (or simply inflection) Given present-tense verb, convert it to

400 views • 9 slides
Profinite semigroups Dominique Perrin 4 d ecembre 2015 Dominique Perrin Profinite semigroups

Profinite semigroups Dominique Perrin 4 d ecembre 2015 Dominique Perrin Profinite semigroups

Profinite semigroups Dominique Perrin 4 d ecembre 2015 Dominique Perrin Profinite semigroups Outline Motivating examples Profinite semigroups Profinite codes Uniform recurrence Dominique Perrin Profinite semigroups p -adic numbers Let

831 views • 38 slides
Agenda 1 cs848 Models and Applications of Distributed Data Processing Systems The Problem

Agenda 1 cs848 Models and Applications of Distributed Data Processing Systems The Problem

n Background n Model n Hamming Distance 1 n Triangle Finding n Matrix Multiplication Agenda 1 cs848 Models and Applications of Distributed Data Processing Systems The Problem Tradeoff between parallelism and communication cost in a

411 views • 22 slides
Chapter 10 Rate Distortion Theory Peng-Hua Wang Graduate Inst. of Comm. Engineering National

Chapter 10 Rate Distortion Theory Peng-Hua Wang Graduate Inst. of Comm. Engineering National

Chapter 10 Rate Distortion Theory Peng-Hua Wang Graduate Inst. of Comm. Engineering National Taipei University Chapter Outline Chap. 10 Rate Distortion Theory 10.1 Quantization 10.2 Definitions 10.3 Calculation of the Rate Distortion Function

757 views • 22 slides
outline Background JPL MER example Reliable State Machines JPL FPGA/ASIC Process

outline Background JPL MER example Reliable State Machines JPL FPGA/ASIC Process

outline Background JPL MER example Reliable State Machines JPL FPGA/ASIC Process Procedure Guidelines Dr. Gary R Burke State machines Traditional California Institute of Technology Highly Reliable Jet

468 views • 8 slides
Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations 2020 IEEE

Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations 2020 IEEE

Structured Quasi-Gray labelling for Reed-Muller Grassmannian Constellations 2020 IEEE International Symposium on Information Theory 21-26 June 2020 Qin Yi and Renaud-Alexandre Pitaval Huawei Technologies Sweden AB, Stockholm, Sweden

319 views • 12 slides
Ultrasound Ultrasound Ultrasound imaging uses high frequency sound waves beyond the range of

Ultrasound Ultrasound Ultrasound imaging uses high frequency sound waves beyond the range of

Ultrasound Ultrasound Ultrasound imaging uses high frequency sound waves beyond the range of human hearing to generate images within objects of interest Ultrasound Among the most popular imaging modalities Safe Real-time

106 views • 10 slides
Lecture 2 Signal Processing and Dynamic Time Warping Michael Picheny, Bhuvana Ramabhadran,

Lecture 2 Signal Processing and Dynamic Time Warping Michael Picheny, Bhuvana Ramabhadran,

Lecture 2 Signal Processing and Dynamic Time Warping Michael Picheny, Bhuvana Ramabhadran, Stanley F . Chen IBM T.J. Watson Research Center Yorktown Heights, New York, USA {picheny,bhuvana,stanchen}@us.ibm.com 17 September 2012 Administrivia

1.34k views • 120 slides
Short Time Fourier Transform. Spectrograms. Mathematical Tools for ITS (11MAI) Mathematical

Short Time Fourier Transform. Spectrograms. Mathematical Tools for ITS (11MAI) Mathematical

Short Time Fourier Transform. Spectrograms. Mathematical Tools for ITS (11MAI) Mathematical tools, 2020 Jan Pikryl 11MAI, lecture 4 Monday, October 26, 2020 version: 2020-10-27 14:12 Department of Applied Mathematics, CTU FTS 1 Lectue

730 views • 70 slides
The complementarity of automatic, semi-automatic and phonetic measures of vocal tract output

The complementarity of automatic, semi-automatic and phonetic measures of vocal tract output

The complementarity of automatic, semi-automatic and phonetic measures of vocal tract output Vincent Hughes, Philip Harrison, Paul Foulkes, Peter French, Colleen Kavanagh &amp; Eugenia San Segundo IAFPA 9-12 July 2017 1. Forensic voice

481 views • 20 slides

More recommend