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

Johan Richter

doi:10.1016/j.disc.2013.10.018

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

Johan Richter

Mathematics (Faculty of Engineering)

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	156-157
Journal	Discrete Mathematics
Volume	315
DOIs	https://doi.org/10.1016/j.disc.2013.10.018
Publication status	Published - 2014

Subject classification (UKÄ)

Mathematical Sciences

Free keywords

Ore extension
Associativity

Access to Document

10.1016/j.disc.2013.10.018

Cite this

@article{3e5ea2b8ed234849904cce6bc0d35855,

title = "A note on {"}A combinatorial proof of associativity of Ore extensions{"}",

abstract = "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.",

keywords = "Ore extension, Associativity",

author = "Johan Richter",

year = "2014",

doi = "10.1016/j.disc.2013.10.018",

language = "English",

volume = "315",

pages = "156--157",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

}

TY - JOUR

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

AU - Richter, Johan

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Ore extension

KW - Associativity

U2 - 10.1016/j.disc.2013.10.018

DO - 10.1016/j.disc.2013.10.018

M3 - Article

SN - 0012-365X

VL - 315

SP - 156

EP - 157

JO - Discrete Mathematics

JF - Discrete Mathematics

ER -

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

Abstract

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this