Graph Lemma (Q7361945)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
AFP entry Combinatorics_Words_Graph_Lemma
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Lemma |
AFP entry Combinatorics_Words_Graph_Lemma |
Statements
24 May 2021
0 references
Štěpán Holub
0 references
Martin Raška
0 references
Štěpán Starosta
0 references
Graph Lemma (English)
0 references
Graph lemma quantifies the defect effect of a system of word equations. That is, it provides an upper bound on the rank of the system. We formalize the proof based on the decomposition of a solution into its free basis. A direct application is an alternative proof of the fact that two noncommuting words form a code.
0 references
