scholarly journals The integer points in a plane curve

2007 ◽  
Vol 37 (1) ◽  
pp. 213-231 ◽  
Author(s):  
Martin N. Huxley
Keyword(s):  
Plane Curve ◽  
Integer Points

scholarly journals Higher rank Clifford indices of curves on a K3 surface

2021 ◽  
Vol 27 (3) ◽  
Author(s):  
Soheyla Feyzbakhsh ◽  
Chunyi Li
Keyword(s):  
Vector Bundles ◽  
Plane Curve ◽  
Smooth Curve ◽  
Line Bundles ◽  
K3 Surface ◽  
Clifford Index ◽  
Smooth Plane ◽  
Higher Rank ◽  
Rank Vector ◽  
Semistable Vector Bundle

AbstractLet (X, H) be a polarized K3 surface with $$\mathrm {Pic}(X) = \mathbb {Z}H$$ Pic ( X ) = Z H , and let $$C\in |H|$$ C ∈ | H | be a smooth curve of genus g. We give an upper bound on the dimension of global sections of a semistable vector bundle on C. This allows us to compute the higher rank Clifford indices of C with high genus. In particular, when $$g\ge r^2\ge 4$$ g ≥ r 2 ≥ 4 , the rank r Clifford index of C can be computed by the restriction of Lazarsfeld–Mukai bundles on X corresponding to line bundles on the curve C. This is a generalization of the result by Green and Lazarsfeld for curves on K3 surfaces to higher rank vector bundles. We also apply the same method to the projective plane and show that the rank r Clifford index of a degree $$d(\ge 5)$$ d ( ≥ 5 ) smooth plane curve is $$d-4$$ d - 4 , which is the same as the Clifford index of the curve.

scholarly journals Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective

4OR ◽  
2020 ◽  
Author(s):  
Michele Conforti ◽  
Marianna De Santis ◽  
Marco Di Summa ◽  
Francesco Rinaldi
Keyword(s):  
Integer Point ◽  
Cutting Plane ◽  
Integer Program ◽  
Compact Set ◽  
Cutting Plane Method ◽  
Integer Points ◽  
Gomory Cuts ◽  
The Family ◽  
Split Cuts ◽  
Number Of Iterations

AbstractWe consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a lattice basis. To each integer point x in K we associate a family of inequalities (lex-inequalities) that define the convex hull of the integer points in K that are not lexicographically smaller than x. The family of lex-inequalities contains the Chvátal–Gomory cuts, but does not contain and is not contained in the family of split cuts. This provides a finite cutting plane method to solve the integer program $$\min \{cx: x\in S\cap \mathbb {Z}^n\}$$ min { c x : x ∈ S ∩ Z n } , where $$S\subset \mathbb {R}^n$$ S ⊂ R n is a compact set and $$c\in \mathbb {Z}^n$$ c ∈ Z n . We analyze the number of iterations of our algorithm.

On an algorithm for finding integer points on perfect ellipsoids

2021 ◽  
Author(s):  
Otabek Gulomov ◽  
Sadulla Shodiev
Keyword(s):  
Integer Points

scholarly journals Connected Numbers and the Embedded Topology of Plane Curves

2018 ◽  
Vol 61 (3) ◽  
pp. 650-658 ◽  
Author(s):  
Taketo Shirane
Keyword(s):  
Plane Curve ◽  
Smooth Curve ◽  
Plane Curves ◽  
Irreducible Curve ◽  
Galois Cover ◽  
Splitting Number

AbstractThe splitting number of a plane irreducible curve for a Galois cover is effective in distinguishing the embedded topology of plane curves. In this paper, we define the connected number of a plane curve (possibly reducible) for a Galois cover, which is similar to the splitting number. By using the connected number, we distinguish the embedded topology of Artal arrangements of degree b ≥ 4, where an Artal arrangement of degree b is a plane curve consisting of one smooth curve of degree b and three of its total inflectional tangents.

scholarly journals On the approximate Jacobian Newton diagrams of an irreducible plane curve

2013 ◽  
Vol 65 (1) ◽  
pp. 169-182
Author(s):  
Evelia Rosa GARCÍA BARROSO ◽  
Janusz GWOŹDZIEWICZ
Keyword(s):  
Plane Curve ◽  
Approximate Jacobian
Sign in / Sign up

Export Citation Format

Share Document