Operads-0.3: Groebner basis computation for Operads.ContentsIndex
Search:
.*.
accumulateTrees
allShuffles
allTrees
applyPerm
applyReconstruction
arityDegree
basisElements
basisElements'
changeOrder
checkShuffleAll
corolla
DecoratedTree
divides
dt
DTLeaf
DTVertex
Embedding
equivalentOrders
extractMap
findAllEmbeddings
findAllLCM
findAllSPolynomials
findInitialSPolynomials
findRootedDecoratedGCD
findRootedEmbedding
findRootedLCM
findSmallLCM
foldMonomials
ForestLex
1 (Type/Class)
2 (Data Constructor)
FreeOperad
fromJustTree
fromList
getTrees
glueTrees
initialOperadicBuchberger
invApplyPerm
isCorolla
isHomogenous
isLeaf
isPermutation
isShuffle
isShuffleIJ
isShuffleIPQ
isSorted
isZero
kSubsets
leadingCoefficient
leadingMonomial
leadingOMonomial
leadingTerm
leaf
leafOrder
lgb
m12_3
m13_2
m1_23
m2
m3
mapMonomials
maxOperationDegree
minimalLeaf
nLeaves
nsCompose
nsComposeAll
OE
oe
oek
oet
OperadElement
operadicBuchberger
operationDegree
operationDegrees
orderedPathSequence
OrderedTree
ordering
OT
ot
PathLex
1 (Type/Class)
2 (Data Constructor)
pathSequence
planarTree
pP
pp
PPrint
PreDecoratedTree
reconstructNode
reconstructTree
reduceBasis
reduceCompletely
reduceOE
relabelLeaves
rePackLabels
reverseOrder
RPathLex
1 (Type/Class)
2 (Data Constructor)
Shuffle
shuffleCompose
shuffleComposeAll
stepInitialOperadicBuchberger
stepOperadicBuchberger
subTreeHasNothing
subTrees
symmetricCompose
symmetricComposeAll
toJustTree
toList
Tree
treeCompare
TreeOrdering
vertexArity
vertexType
yTree
zero