Results 1  10
of
48,198
HUNTING FOR CURVES WITH MANY POINTS
, 2009
"... We construct curves with many points over finite fields by using the class group. ..."
Abstract
 Add to MetaCart
We construct curves with many points over finite fields by using the class group.
Kummer Covers with Many Points
, 1999
"... Let p be a prime and Fq be a finite field with q = p m elements and let ¯ Fq be an algebraic closure of Fq. In this paper we present a method for constructing curves over finite fields with many points which are Kummer covers of P 1, or of other suitable base curves. For this we look at rational fun ..."
Abstract
 Add to MetaCart
Let p be a prime and Fq be a finite field with q = p m elements and let ¯ Fq be an algebraic closure of Fq. In this paper we present a method for constructing curves over finite fields with many points which are Kummer covers of P 1, or of other suitable base curves. For this we look at rational
Constructions of Plane Curves with Many Points
 Acta Arithmetica
, 2001
"... this paper we investigate some plane curves with many points over Q, finite fields and cyclotomic fields ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
this paper we investigate some plane curves with many points over Q, finite fields and cyclotomic fields
Computing equations of curves with many points
"... dx.doi.org/10.2140/obs.2013.1.317 msp Computing equations of curves with many points ..."
Abstract
 Add to MetaCart
dx.doi.org/10.2140/obs.2013.1.317 msp Computing equations of curves with many points
Compressing to VC Dimension Many Points
"... Any set of labeled examples consistent with some hidden orthogonal rectangle can be “compressed ” to at most four examples: An upmost, a leftmost, a rightmost and a bottommost positive example. These four examples represent an orthogonal rectangle (the smallest such rectangle that contains them) th ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Any set of labeled examples consistent with some hidden orthogonal rectangle can be “compressed ” to at most four examples: An upmost, a leftmost, a rightmost and a bottommost positive example. These four examples represent an orthogonal rectangle (the smallest such rectangle that contains them) that is consistent with all examples. Note that the VC dimension of orthogonal rectangles is four and this is exactly the number of examples needed to represent the consistent orthogonal rectangle. A compression scheme of size k for a concept class C picks from any set of examples consistent with some concept in C a subset of up to k examples and this subset represents (via a mapping that that is specific to the class C) a hypothesis consistent with the whole original set of examples. Conjecture: Any concept class of VC dimension d has a compression scheme of size d. What evidence do we have that this conjecture might be true? Call a concept class of VC dimension d maximum if for every subset of m instances, the concept class induces exactly ∑d i=1
Computing equations of curves with many points
, 2012
"... Abstract. We explain how to compute the equations of the abelian coverings of any curve defined over a finite field. Then we describe an algorithm which computes curves with many rational points with respect to their genus. The implementation of the algorithm provides 7 new records over F2. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We explain how to compute the equations of the abelian coverings of any curve defined over a finite field. Then we describe an algorithm which computes curves with many rational points with respect to their genus. The implementation of the algorithm provides 7 new records over F2.
The Steiner problem for infinitely many points
, 2009
"... Let A be a given compact subset of the euclidean space. We consider the problem of finding a compact connected set S of minimal 1dimensional Hausdorff measure, among all compact connected sets containing A. We prove that when A is a finite set any minimizer is a finite tree with straight edges, thu ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Let A be a given compact subset of the euclidean space. We consider the problem of finding a compact connected set S of minimal 1dimensional Hausdorff measure, among all compact connected sets containing A. We prove that when A is a finite set any minimizer is a finite tree with straight edges, thus recovery the classical Steiner Problem. Analogously, in the case when A is countable, we prove that every minimizer is a (possibly) countable union of straight segments.
Triangulations with many points of even degree
, 2010
"... Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangulation of S containing at least ⌊ 2n 3 ⌋−3 points with even degree; this improves slightly the bound of ⌈ 2(n−1) 3 ⌉ − 6 ..."
Abstract
 Add to MetaCart
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangulation of S containing at least ⌊ 2n 3 ⌋−3 points with even degree; this improves slightly the bound of ⌈ 2(n−1) 3 ⌉ − 6
Lines With Many Points On Both Sides
, 2002
"... Let G be a finite set of points in the plane. A line M is a (k, k)line, if M is determined by G, and there are at least k points of G in each of the two open halfplanes bounded by M. Let f(k, k) denote the maximum size of a set G in the plane, which is not contained in a line and does not determin ..."
Abstract
 Add to MetaCart
Let G be a finite set of points in the plane. A line M is a (k, k)line, if M is determined by G, and there are at least k points of G in each of the two open halfplanes bounded by M. Let f(k, k) denote the maximum size of a set G in the plane, which is not contained in a line and does
Results 1  10
of
48,198