Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

The Tutte-Grothendieck group of a convergent alphabetic rewriting system (1112.6179v1)

Published 28 Dec 2011 in cs.DM and math.GR

Abstract: The two operations, deletion and contraction of an edge, on multigraphs directly lead to the Tutte polynomial which satisfies a universal problem. As observed by Brylawski in terms of order relations, these operations may be interpreted as a particular instance of a general theory which involves universal invariants like the Tutte polynomial, and a universal group, called the Tutte-Grothendieck group. In this contribution, Brylawski's theory is extended in two ways: first of all, the order relation is replaced by a string rewriting system, and secondly, commutativity by partial commutations (that permits a kind of interpolation between non commutativity and full commutativity). This allows us to clarify the relations between the semigroup subject to rewriting and the Tutte-Grothendieck group: the later is actually the Grothendieck group completion of the former, up to the free adjunction of a unit (this was even not mention by Brylawski), and normal forms may be seen as universal invariants. Moreover we prove that such universal constructions are also possible in case of a non convergent rewriting system, outside the scope of Brylawski's work.

Summary

We haven't generated a summary for this paper yet.