login
A014315
Number of permutations of squarefree monomials of degree n in n non-commutative variables that are compatible with a non-commutative monomial order (in the Groebner basis sense).
0
1, 2, 132, 10132883443872
OFFSET
1,2
LINKS
Fritz Schwarz, Monomial orderings and Gröbner bases, ACM SIGSAM Bulletin 25(1) (1991), 10-23. [It contains the algorithm MACOT that possibly can be used to enumerate all compatible monomial orders as described in the name of the sequence. - Petros Hadjicostas, Dec 16 2019]
Wikipedia, Gröbner basis.
Wikipedia, Monomial order.
EXAMPLE
For example, when n=3, 132 of the (3!)! = 720 possible permutations of xyz, xzy, yxz, yzx, zxy, zyx are compatible with a monomial order.
CROSSREFS
Sequence in context: A099682 A214436 A135759 * A221468 A327911 A318965
KEYWORD
nonn,more
AUTHOR
Svante Linusson (linusson(AT)matematik.su.se)
STATUS
approved