The Tutte-Grothendieck group of an alphabetic rewriting system
DOI10.1155/2013/574578zbMath1264.05070arXiv1112.6179OpenAlexW3100421016WikidataQ58997750 ScholiaQ58997750MaRDI QIDQ1952720
Publication date: 3 June 2013
Published in: ISRN Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.6179
contractionsemigroupmultigraphsTutte polynomialstring rewriting systemdeletionGrothendieck group completionnonconvergent rewriting systemspartial commutationsTutte-Grothendieck group
Graph polynomials (05C31) Other designs, configurations (05B30) Combinatorial aspects of matroids and geometric lattices (05B35) Grammars and rewriting systems (68Q42) Graph algorithms (graph-theoretic aspects) (05C85) Grothendieck groups, (K)-theory and commutative rings (13D15)
Cites Work
- Combinatorics on traces
- The diamond lemma for ring theory
- Combinatorial problems of commutation and rearrangements
- A Brylawski decomposition for finite ordered sets
- The Tutte-Grothendieck ring
- Groupes et algérbes de Lie
- Treue Darstellung Liescher Ringe.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item