A geometrical approach to multiset orderings

DOI10.1016/0304-3975(89)90020-0zbMath0672.06004OpenAlexW2033245919WikidataQ55393326 ScholiaQ55393326MaRDI QIDQ1119955

Ursula Martin Webb

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90020-0

zbMATH Keywords

conedominance orderingmultiset orderings

Mathematics Subject Classification ID

Ordered sets (06A99)

Related Items (9)

Linear interpretations by counting patterns ⋮ Ranking committees, income streams or multisets ⋮ Leanest quasi-orderings ⋮ The order types of termination orderings on monadic terms, strings and multisets ⋮ Natural termination ⋮ Orders on multisets and discrete cones ⋮ Dedekind multisets and function shells ⋮ Invariants, patterns and weights for ordering terms ⋮ Random Ordering of Semiprimes

Cites Work

• Orderings for term-rewriting systems
• A theorem on refining division orders by the reverse lexicographic order
• Extension functions for multiset orderings
• Young diagrams and determinantal varieties
• Rings with lexicographic straightening law
• On multiset orderings
• On dominance and varieties of commuting matrices
• Proving termination with multiset orderings
• Cycles of Partitions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A geometrical approach to multiset orderings