2000 character limit reached
Distinct monomial orders with same induced orderings
Published 24 Sep 2014 in math.AC and math.CO | (1409.7004v1)
Abstract: We prove that the lexicographic, degree lexicographic and the degree reverse lexicographic orders for monomials in $R_n=K[X_1,...X_n]$ are uniquely determined by their induced orderings, (i.e. their restrictions to $R_{n,i}=K[X_1,..., \hat{X_i}, .., X_n]$), when $n \geq 4$. We also show that for any $n \geq 4$ there are monomial orders that are not uniquely determined by their induced orderings, and provide examples of these orders for each $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.