F4 | Math.Combinat.RootSystems |
factorial | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialNaive | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialPrimeExponents | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialPrimeExponentsNaive | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialPrimeExponents_ | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialSplit | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorialSwing | Math.Combinat.Numbers.Sequences, Math.Combinat.Numbers, Math.Combinat |
factorize | Math.Combinat.Numbers.Primes, Math.Combinat.Numbers, Math.Combinat |
factorizeNaive | Math.Combinat.Numbers.Primes, Math.Combinat.Numbers, Math.Combinat |
fasc2B_algorithm_L | Math.Combinat.Permutations, Math.Combinat |
fasc3B_algorithm_M | Math.Combinat.Partitions.Vector |
fasc4A_algorithm_P | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
fasc4A_algorithm_R | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
fasc4A_algorithm_U | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
fasc4A_algorithm_W | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
filledBox | Math.Combinat.ASCII, Math.Combinat |
fillSkewPartitionWithColumnWord | Math.Combinat.Tableaux.Skew |
fillSkewPartitionWithRowWord | Math.Combinat.Tableaux.Skew |
findPositiveHyperplane | Math.Combinat.RootSystems |
flatten | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
flipRunRand | Math.Combinat.Helper |
flipRunRandT | Math.Combinat.Helper |
flipTree | Math.Combinat.Groups.Thompson.F |
foldTree | Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
Forest | Math.Combinat.Trees.Binary, Math.Combinat.Trees.Nary, Math.Combinat.Trees, Math.Combinat |
forestToBinaryTree | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
forestToNestedParentheses | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
forgetNodeDecorations | Math.Combinat.Trees.Binary, Math.Combinat.Trees, Math.Combinat |
freeReduceBraidWord | Math.Combinat.Groups.Braid |
FrenchNotation | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromBinTree | Math.Combinat.Groups.Thompson.F |
fromConjLex | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromDescList | Math.Combinat.Partitions.Integer.Compact |
fromDescList' | Math.Combinat.Partitions.Integer.Compact |
fromDisjointCycles | Math.Combinat.Permutations, Math.Combinat |
fromExponentialForm | |
1 (Function) | Math.Combinat.Partitions.Integer.Naive, Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
2 (Function) | Math.Combinat.Partitions.Integer.Compact |
fromExponentVector | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromJust | Math.Combinat.Helper |
fromList | Math.Combinat.Partitions.Integer.Naive, Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromListUnsafe | Math.Combinat.Partitions.Integer.Naive, Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromNonCrossing | Math.Combinat.Partitions.NonCrossing |
fromPartition | Math.Combinat.Partitions.Integer, Math.Combinat.Partitions, Math.Combinat |
fromPermutation | Math.Combinat.Permutations, Math.Combinat |
fromPlanePart | Math.Combinat.Partitions.Plane |
fromSetPartition | Math.Combinat.Partitions.Set |
fromSkewPartition | Math.Combinat.Partitions.Skew |
fromTriangularArray | Math.Combinat.Tableaux.GelfandTsetlin.Cone |