[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: Point .. point-predicates
PointSet(E, m) : CrvEll, Map -> SetPtEll
E(m) : CrvEll, Map -> SetPtEll
E(L) : CrvEll, Rng -> SetPtEll
ApproximateByTorsionPoint(x : parameters) : ModAbVarElt -> ModAbVarElt
BasePoint(G, i) : GrpMat, RngIntElt -> Elt
BasePoint(G, i) : GrpPerm, RngIntElt -> Elt
CollineationGroup(P) : Plane -> GrpPerm, GSet, GSet, PowMap, Map
CubicFromPoint(E, P) : CrvEll, PtEll -> RngMPolElt, MapSch, Pt
EquivalentPoint(x) : SpcHypElt -> SpcHypElt, GrpPSL2Elt
FormalPoint(P) : Pt -> Pt
GenericPoint(X) : Sch -> Pt
HasNonsingularPoint(X) : Sch -> BoolElt,Pt
HasRationalPoint(C) : CrvCon -> BoolElt, Pt
HeegnerPoint(E : parameters) : CrvEll -> BoolElt, PtEll
HeegnerPoint(C : parameters) : CrvHyp -> BoolElt, PtHyp
IsBasePointFree(L) : LinearSys -> BoolElt
IsDoublePoint(p) : CrvPln,Pt -> BoolElt
IsInflectionPoint(p) : Sch,Pt -> BoolElt,RngIntElt
IsPoint(C, S) : CrvHyp, SeqEnum -> BoolElt, PtHyp
IsPoint(N,p) : NwtnPgon,Tup -> BoolElt
IsPoint(H, x) : SetPtEll, RngElt -> BoolElt, PtEll
IsPoint(H, S) : SetPtEll, [ RngElt ] -> BoolElt, PtEll
IsPoint(K, S) : SrfKum, [RngElt] -> BoolElt, SrfKumPt
IsPointRegular(D) : IncNsp -> BoolElt, RngIntElt
IsPointTransitive(D) : Inc -> BoolElt
IsPointTransitive(P) : Plane -> BoolElt
LiftPoint(P, n) : Pt, RngIntElt -> Pt
Point(D, i) : Inc, RngIntElt -> IncPt
Point(r,n,Q) : RngIntElt, RngIntElt, SeqEnum -> GRPtS
PointDegree(D, p) : Inc, IncPt -> RngIntElt
PointDegrees(D) : Inc -> [ RngIntElt ]
PointGraph(D) : Inc -> Grph
PointGraph(D) : Inc -> GrphUnd
PointGraph(P) : Plane -> GrphUnd;
PointGroup(D) : Inc -> GrpPerm, GSet
PointSearch(S,H : parameters) : Sch[FldRat], RngIntElt -> SeqEnum
PointSet(D) : Inc -> IncPtSet
PointSet(P) : Plane -> PlanePtSet
ProjectionFromNonsingularPoint(X,p) : Sch,Pt -> Sch,MapSch,Sch
RationalPoint(C) : CrvCon -> Pt
RepresentativePoint(P) : PlcCrv -> Pt
X(L) : Sch,Rng -> SetPt
Eltseq(P): PtEll -> [ RngElt ]
Access Operations (ELLIPTIC CURVES)
Arithmetic (ELLIPTIC CURVES)
Associated Structures (ELLIPTIC CURVES)
Combinatorial and Geometrical Structures (OVERVIEW)
Creating Points and Blocks (INCIDENCE STRUCTURES AND DESIGNS)
Creation of Points (ELLIPTIC CURVES)
Creation of Points (MODULAR CURVES)
Creation Predicates (ELLIPTIC CURVES)
Finding Points (RATIONAL CURVES AND CONICS)
Operations on Points (ELLIPTIC CURVES)
Operations on Points and Blocks (INCIDENCE STRUCTURES AND DESIGNS)
Point Order (ELLIPTIC CURVES)
Points (ALGEBRAIC CURVES)
Predicates on Points (ELLIPTIC CURVES)
Searching for Points (SCHEMES)
The Point-Set and Block-Set of an Incidence Structure (INCIDENCE STRUCTURES AND DESIGNS)
The Point-Set and Line-Set of a Plane (FINITE PLANES)
The Set of Points and Set of Lines (FINITE PLANES)
Using the Point-Set and Line-Set to Create Points and Lines (FINITE PLANES)
Eltseq(P): PtEll -> [ RngElt ]
Access Operations (ELLIPTIC CURVES)
Arithmetic (ELLIPTIC CURVES)
Creating Points and Blocks (INCIDENCE STRUCTURES AND DESIGNS)
The Point-Set and Block-Set of an Incidence Structure (INCIDENCE STRUCTURES AND DESIGNS)
Curve(P) : SetPtEll -> CrvEll
Associated Structures (ELLIPTIC CURVES)
Scheme_point-count (Example H97E18)
Creation of Points (ELLIPTIC CURVES)
Creation of Points (MODULAR CURVES)
Creation Predicates (ELLIPTIC CURVES)
Finding Points (RATIONAL CURVES AND CONICS)
The Set of Points and Set of Lines (FINITE PLANES)
Using the Point-Set and Line-Set to Create Points and Lines (FINITE PLANES)
The Point-Set and Line-Set of a Plane (FINITE PLANES)
Point Order (ELLIPTIC CURVES)
Predicates on Points (ELLIPTIC CURVES)
[____] [____] [_____] [____] [__] [Index] [Root]