[____] [____] [_____] [____] [__] [Index] [Root]
Subindex: h .. Has
Overview (OVERVIEW)
H
h
H
h
H2_G_A(A) : FldAb -> ModTupRng
H2_G_QmodZ(G) : GrpAb -> GrpAb, Map
Combinatorial and Geometrical Structures (OVERVIEW)
HadamardAutomorphismGroup(H : parameters) : AlgMatElt -> AlgMatElt
HadamardCanonicalForm(H) : AlgMatElt -> AlgMatElt, AlgMatElt, AlgMatElt
HadamardColumnDesign(H, i) : AlgMatElt, RngIntElt -> Dsgn
HadamardDatabase() : -> DB
HadamardDatabaseInformation(D : parameters) : DB -> Rec
HadamardDatabaseInformationEmpty(: parameters) : -> Rec
HadamardGraph(H : parameters) : Mtrx -> GrphUnd
HadamardInvariant(H) : AlgMatElt -> [ RngIntElt ]
HadamardMatrixFromInteger(x, n) : RngIntElt, RngIntElt -> AlgMatElt
HadamardMatrixToInteger(H) : AlgMatElt -> RngIntElt
HadamardNormalize(H) : AlgMatElt -> AlgMatElt
HadamardRowDesign(H, i) : AlgMatElt, RngIntElt -> Dsgn
HadamardTrasformation(e) : HilbSpcElt -> HilbSpcElt
IsHadamard(H) : AlgMatElt -> BoolElt
IsHadamardEquivalent(H, J : parameters) : AlgMatElt, AlgMatElt -> BoolElt, AlgMatElt, AlgMatElt
SkewHadamardDatabase() : -> DB
UpdateHadamardDatabase(~R, S : parameters) : Rec, SeqEnum ->
WriteHadamardDatabase(S, ~R) : MonStgElt, Rec ->
WriteRawHadamardData(S, R) : MonStgElt, Rec ->
Automorphism Group (HADAMARD MATRICES)
Databases (HADAMARD MATRICES)
Equivalence Testing (HADAMARD MATRICES)
HADAMARD MATRICES
Updating the Databases (HADAMARD MATRICES)
Databases (HADAMARD MATRICES)
Updating the Databases (HADAMARD MATRICES)
Hadamard_hadamard-designs (Example H121E2)
Hadamard_hadamard-equiv (Example H121E1)
Automorphism Group (HADAMARD MATRICES)
Hadamard_hadamard_db_eg (Example H121E3)
Hadamard_hadamard_db_update (Example H121E4)
HadamardAutomorphismGroup(H : parameters) : AlgMatElt -> AlgMatElt
HadamardCanonicalForm(H) : AlgMatElt -> AlgMatElt, AlgMatElt, AlgMatElt
HadamardColumnDesign(H, i) : AlgMatElt, RngIntElt -> Dsgn
HadamardDatabase() : -> DB
HadamardDatabaseInformation(D : parameters) : DB -> Rec
HadamardDatabaseInformationEmpty(: parameters) : -> Rec
HadamardGraph(H : parameters) : Mtrx -> GrphUnd
HadamardInvariant(H) : AlgMatElt -> [ RngIntElt ]
HadamardMatrixFromInteger(x, n) : RngIntElt, RngIntElt -> AlgMatElt
HadamardMatrixToInteger(H) : AlgMatElt -> RngIntElt
HadamardNormalize(H) : AlgMatElt -> AlgMatElt
HadamardRowDesign(H, i) : AlgMatElt, RngIntElt -> Dsgn
HadamardTrasformation(e) : HilbSpcElt -> HilbSpcElt
To2DUpperHalfSpaceFundamentalDomian(z) : Mtrx -> Mtrx, Mtrx
UpperHalfPlaneWithCusps() : -> SpcHyp
Hall pi-Subgroups and Sylow Systems (FINITE SOLUBLE GROUPS)
HallSubgroup(G, S) : GrpPC, { RngIntElt } -> GrpPC
GrpPC_Hall (Example H22E17)
Hall pi-Subgroups and Sylow Systems (FINITE SOLUBLE GROUPS)
HallSubgroup(G, S) : GrpPC, { RngIntElt } -> GrpPC
AlgLie_hamilton-alg-ex (Example H90E5)
ConformalHamiltonianLieAlgebra(F, m, n) : Fld, RngIntElt, SeqEnum[RngIntElt] -> AlgLie, AlgLie, AlgLie
HamiltonianLieAlgebra(F, m, n) : Fld, RngIntElt, SeqEnum[RngIntElt] -> AlgLie, AlgLie
ConformalHamiltonianLieAlgebra(F, m, n) : Fld, RngIntElt, SeqEnum[RngIntElt] -> AlgLie, AlgLie, AlgLie
HamiltonianLieAlgebra(F, m, n) : Fld, RngIntElt, SeqEnum[RngIntElt] -> AlgLie, AlgLie
HammingAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
HammingCode(K, r) : FldFin, RngIntElt -> Code
WeightEnumerator(C): Code -> RngMPolElt
Hamming Weight (LINEAR CODES OVER FINITE RINGS)
Hamming Weight (LINEAR CODES OVER FINITE RINGS)
HammingAsymptoticBound(K, delta) : FldFin, FldPrElt -> FldPrElt
HammingCode(K, r) : FldFin, RngIntElt -> Code
CodeFld_HammingCode (Example H124E6)
HammingWeightEnumerator(C): Code -> RngMPolElt
WeightEnumerator(C): Code -> RngMPolElt
Creation by Hand (RESOLUTION GRAPHS AND SPLICE DIAGRAMS)
Error Handling Statements (STATEMENTS AND EXPRESSIONS)
HarmonicNumber(n) : RngIntElt -> FldRatElt
HarmonicNumber(n) : RngIntElt -> FldRatElt
HasAdditionAlgorithm(J) : JacHyp -> Bool
HasAllPQuotientsMetacyclic (G): GrpFP -> BoolElt, SeqEnum
HasAttribute(GrpMat, "FirstBasicOrbitBound") : Cat, MonStgElt -> BoolElt, RngIntElt
HasAttribute(FldFin, "PowerPrinting", l) : Cat, MonStgElt, BoolElt ->
HasAttribute(ModMPol, "MatrixPrinting", l) : Cat, MonStgElt, BoolElt ->
HasAttribute(F, "PowerPrinting") : FldFin, MonStgElt -> BoolElt, BoolElt
HasAttribute(A, s) : GrpAuto, MonStgElt -> BoolElt, .
HasAttribute(A, "GenWeights") : GrpAuto, MonStgElt -> BoolElt, [ RngIntElt ]
HasAttribute(A, "WeightSubgroupOrders") : GrpAuto, MonStgElt -> BoolElt, [ RngIntElt ]
HasAttribute(G, "IsVerified") : GrpMat, MonStgElt -> BoolElt
HasAttribute(G, "Base") : GrpMat, MonStgElt -> BoolElt, Tup
HasAttribute(G, "Order") : GrpMat, MonStgElt -> RngIntElt
HasAttribute(M, "MatrixPrinting") : ModMPol, MonStgElt -> BoolElt, BoolElt
HasAttribute(S, "Precision") : RngSer, MonStgElt -> BoolElt, RngIntElt
HasCM(M : parameters) : ModSym -> BoolElt, RngIntElt
HasClique(G, k) : GrphUnd, RngIntElt -> BoolElt, { GrphVert }
HasClique(G, k, m : parameters) : GrphUnd, RngIntElt, BoolElt -> BoolElt, { GrphVert }
HasClique(G, k, m, f : parameters) : GrphUnd, RngIntElt, BoolElt, RngIntElt -> BoolElt, { GrphVert }
HasClosedCosetTable(P) : GrpFPCosetEnumProc -> BoolElt
HasComplement(G, M) : GrpPerm, GrpPerm -> BoolElt, GrpPerm
HasComplement(M, S) : ModGrp, ModGrp -> BoolElt, ModGrp
HasComplexConjugate(K) : FldAlg -> BoolElt, Map
HasComplexMultiplication(E) : CrvEll -> BoolElt, RngIntElt
HasComplexMultiplication(E) : CrvEll -> BoolElt, RngIntElt
HasComputableAbelianQuotient(G) : GrpFP -> BoolElt, GrpAb, Map
HasComputableLCS(G) : GrpGPC -> BoolElt
HasDefinedModuleMap(C,n) : ModCpx, RngIntElt -> BoolElt
HasDefiningMap(L) : RngPad -> BoolElt, Map
HasFiniteDimension(Q) : RngMPolRes -> BoolElt
HasFiniteKernel(phi) : MapModAbVar -> BoolElt
HasFiniteOrder(g) : GrpMatElt -> BoolElt, RngIntElt
HasFiniteOrder(A) : Mtrx -> BoolElt
HasGCD(R) : Rng -> BoolElt
HasGNB(R, n, t) : RngPad, RngIntElt, RngIntElt -> BoolElt
HasGroebnerBasis(I) : RngMPol -> BoolElt
HasHomogeneousBasis(A): AlgSym -> BoolElt
HasInfiniteComputableAbelianQuotient(G) : GrpFP -> BoolElt, GrpAb, Map
HasIntersectionProperty(C) : CosetGeom -> BoolElt
HasIntersectionPropertyN(C) : CosetGeom -> BoolElt, BoolElt
HasInverse(f) : Map -> MonStgElt, Map
HasIrregularFibres(s) : GrphSpl -> BoolElt
HasKnownInverse(f) : MapSch -> Bool
HasLeviSubalgebra(L) : AlgLie -> BoolElt
HasLinearGrayMapImage(C) : Code -> BoolElt, Code
HasMultiplicityOne(A) : ModAbVar -> BoolElt
HasNegativeWeightCycle(G) : Grph -> BoolElt
HasNegativeWeightCycle(u : parameters) : GrphVert -> BoolElt
HasNonsingularPoint(X) : Sch -> BoolElt,Pt
HasOddDegreeModel(C) : CrvHyp -> BoolElt, CrvHyp, MapIsoSch
HasOnlyOrdinarySingularities(C) : CrvPln -> BoolElt, RngIntElt, RngMPol
HasOnlyOrdinarySingularitiesMonteCarlo(C) : CrvPln -> BoolElt, RngIntElt
HasOrder(P, n) : JacHypPt, RngIntElt -> BoolElt
HasOutputFile() : -> BoolElt
HasPRoot(R) : RngPad -> BoolElt
HasParallelClass(D) : Inc -> BoolElt, { IncBlk }
HasParallelism(D: parameters) : Inc, RngIntElt -> BoolElt, { SetEnum }
HasPlace(C, m) : Crv[FldFin], RngIntElt -> BoolElt,PlcCrvElt
HasPlace(F, m) : FldFun, RngIntElt -> BoolElt, PlcFunElt
HasPlace(F, m) : FldFun, RngIntElt -> PlcFunElt
HasPointsOverExtension(X) : Sch -> BoolElt
HasPolynomial(N) : NwtnPgon -> BoolElt
HasPolynomialFactorization(R) : Rng -> BoolElt
HasPreimage(x, f) : Any, Map -> BoolElt, Any
HasRationalPoint(C) : CrvCon -> BoolElt, Pt
HasRationalSolutions(L, g) : RngDiffOpElt, RngElt -> BoolElt, RngElt, SeqEnum
HasResolution(D) : Inc -> BoolElt, { SetEnum }, RngIntElt
HasResolution(D, lambda) : Inc, RngIntElt -> BoolElt, { SetEnum }
HasRoot(p) : RngUPolElt -> BoolElt, RngElt
HasRoot(f) : RngUPolElt -> BoolElt, RngPadElt
HasRoot(f) : RngUPolElt -> BoolElt, RngSerElt
HasRoot(p, S) : RngUPolElt, Rng -> BoolElt, RngElt
HasRootOfUnity(L, n) : RngPad, RngIntElt -> BoolElt
HasSchurBasis(A): AlgSym -> BoolElt
HasSingularPointsOverExtension(C) : Sch -> BoolElt
HasSparseRep(G) : Grph -> BoolElt
HasSquareSha(J) : JacHyp -> BoolElt
HasSupplement(G, M) : GrpPerm, GrpPerm -> BoolElt, GrpPerm
HasTwistedHopfStructure(U) : AlgQUE -> BoolElt, List
HasValidCosetTable(P) : GrpFPCosetEnumProc -> BoolElt
HasValidIndex(P) : GrpFPCosetEnumProc -> BoolElt
HasWeakIntersectionProperty(C) : CosetGeom -> BoolElt
IsSplittingField(K, A) : FldAlg, AlgQuat -> BoolElt, .
SetExtraspecialSigns( R, s) : RootDtm, SeqEnum[RngIntElt] ->
[____] [____] [_____] [____] [__] [Index] [Root]