The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

A note on "A combinatorial proof of associativity of Ore extensions"

På svenska

Author

  • Johan Richter

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.

Publishing year

2014

Language

English

Pages

156-157

Publication/Series

Discrete Mathematics

Volume

315

Document type

Journal article

Publisher

Elsevier

Topic

  • Mathematics

Keywords

  • Ore extension
  • Associativity

Status

Published

ISBN/ISSN/Other

  • ISSN: 0012-365X