A Majorization Order on Monomials and Termination of a Successive Difference Substitution Algorithm

2011/09/04 by Jia Xu, Yong Yao, Xu, Jia +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #68T15 26D05 #Coding theory and cryptography #Commutative Algebra (math.AC) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC) #Synthesis and Biological Activity #cs.SC #graph theory and CDMA systems #math.AC #msc:26D05 #msc:68T15

paper · pdf · doi:10.48550/arxiv.1109.0686

6 pages

openalex publication_date 2011/09/04 · arxiv created 2014/05/16 · arxiv updated 2014/05/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We introduce a majorization order on monomials. With the help of this order, we derive a necessary condition on the positive termination of a general successive difference substitution algorithm (KSDS) for an input form f.

Related

• Priority Arguments and Epsilon Substitutions
• A new strategy for resolution of singularities in the monomial case in positive characteristic
• Construction of Involutive Monomial Sets for Different Involutive Divisions
• Proving termination with transition invariants of height omega
• More on the properties of the generalized majorization