2000 character limit reached
Graded Monomial Ordering for $\mathbb{N}$-graded and $\mathbb{N}$-filtered Solvable Polynomial Algebras of $({\cal B},d(~))$-type (1812.11469v1)
Published 30 Dec 2018 in math.RA
Abstract: Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. It is shown that if $A$ is an $\mathbb{N}$-graded algebra of $({\cal B},d(~))$-type, then $A$ has a graded monomial ordering $\prec_{gr}$. It is also shown that $A$ is an $\mathbb{N}$-filtered algebra of $({\cal B},d(~))$-type if and only if $A$ has a graded momomial ordering, where ${\cal B}$ is the PBW basis of $A$.