identity | |
1 (Function) | Math.Combinat.Permutations, Math.Combinat |
2 (Function) | Math.Combinat.Groups.Braid |
3 (Function) | Math.Combinat.Groups.Thompson.F |
idSeries | Math.Combinat.Numbers.Series |
innerPartition | Math.Combinat.Partitions.Skew |
integerFactorsTrialDivision | Math.Combinat.Numbers.Primes |
integerLog2 | Math.Combinat.Numbers.Primes |
integerSquareRoot | Math.Combinat.Numbers.Primes |
integerSquareRoot' | Math.Combinat.Numbers.Primes |
integerSquareRootNewton' | Math.Combinat.Numbers.Primes |
integralLagrangeInversion | Math.Combinat.Numbers.Series |
integralReciprocalSeries | Math.Combinat.Numbers.Series |
intToBool | Math.Combinat.Helper |
IntVector | Math.Combinat.Partitions.Vector |
Inv | Math.Combinat.Groups.Free |
invBrGen | Math.Combinat.Groups.Braid |
inverse | |
1 (Function) | Math.Combinat.Permutations, Math.Combinat |
2 (Function) | Math.Combinat.Groups.Braid |
3 (Function) | Math.Combinat.Groups.Thompson.F |
inverseGen | Math.Combinat.Groups.Free |
inverseTwoLineNotation | Math.Combinat.Permutations, Math.Combinat |
inverseWord | Math.Combinat.Groups.Free |
inversions | Math.Combinat.Permutations, Math.Combinat |
invertGTSimplexTableau | Math.Combinat.Tableaux.GelfandTsetlin.Cone |
isCyclicPermutation | Math.Combinat.Permutations, Math.Combinat |
isDyckPath | Math.Combinat.LatticePaths, Math.Combinat |
isEmpty | Math.Combinat.Classes |
isEmptyPartition | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
isEvenPermutation | Math.Combinat.Permutations, Math.Combinat |
isIdentityPermutation | Math.Combinat.Permutations, Math.Combinat |
isLatticeWord | Math.Combinat.Tableaux, Math.Combinat |
isMinus | Math.Combinat.Sign, Math.Combinat.Permutations, Math.Combinat |
isOddPermutation | Math.Combinat.Permutations, Math.Combinat |
isPartition | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
isPermutation | Math.Combinat.Permutations, Math.Combinat |
isPermutationBraid | Math.Combinat.Groups.Braid |
isPlus | Math.Combinat.Sign, Math.Combinat.Permutations, Math.Combinat |
isPositive | Math.Combinat.Groups.Thompson.F |
isPositiveBraidWord | Math.Combinat.Groups.Braid |
isProbablyPrime | Math.Combinat.Numbers.Primes |
isPureBraid | Math.Combinat.Groups.Braid |
isReduced | Math.Combinat.Groups.Thompson.F |
isReversePermutation | Math.Combinat.Permutations, Math.Combinat |
isSemiStandardSkewTableau | Math.Combinat.Tableaux.Skew |
isSemiStandardTableau | Math.Combinat.Tableaux, Math.Combinat |
isSquare | Math.Combinat.Numbers.Primes |
isStandardSkewTableau | Math.Combinat.Tableaux.Skew |
isStandardTableau | Math.Combinat.Tableaux, Math.Combinat |
isStrictlyDecreasing | Math.Combinat.Helper |
isStrictlyIncreasing | Math.Combinat.Helper |
isSubPartitionOf | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
isSuperPartitionOf | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
isTreeLeaf | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
isTreeLeaf_ | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
isTreeNode | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
isTreeNode_ | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
isValidPath | Math.Combinat.LatticePaths, Math.Combinat |
isValidPlanePart | Math.Combinat.Partitions.Plane |
isValidTDiag | Math.Combinat.Groups.Thompson.F |
isVeryProbablyPrime | Math.Combinat.Numbers.Primes |
isWeaklyDecreasing | Math.Combinat.Helper |
isWeaklyIncreasing | Math.Combinat.Helper |
iteratedDualPieriRule | Math.Combinat.Tableaux.GelfandTsetlin |
iteratedDualPieriRule' | Math.Combinat.Tableaux.GelfandTsetlin |
iteratedDualPieriRule'' | Math.Combinat.Tableaux.GelfandTsetlin |
iteratedPieriRule | Math.Combinat.Tableaux.GelfandTsetlin |
iteratedPieriRule' | Math.Combinat.Tableaux.GelfandTsetlin |
iteratedPieriRule'' | Math.Combinat.Tableaux.GelfandTsetlin |
iTypeArg | Math.Combinat.TypeLevel |