A note on "A combinatorial proof of associativity of Ore extensions"
Författare
Summary, in English
Nystedt recently gave a combinatorial proof of the fact that Ore extensions are associative. As part of it he proves that two sets of strings are identical, using a counting argument. We show that the equality of the sets can be proven directly. (C) 2013 Elsevier B.V. All rights reserved.
Avdelning/ar
Publiceringsår
2014
Språk
Engelska
Sidor
156-157
Publikation/Tidskrift/Serie
Discrete Mathematics
Volym
315
Dokumenttyp
Artikel i tidskrift
Förlag
Elsevier
Ämne
- Mathematics
Nyckelord
- Ore extension
- Associativity
Status
Published
ISBN/ISSN/Övrigt
- ISSN: 0012-365X