Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T12:59:39.208Z Has data issue: false hasContentIssue false

A Short Combinatorial Proof of the Vaught Conjecture

Published online by Cambridge University Press:  20 November 2018

Charles C. Edmunds*
Affiliation:
University of Manitoba Winnipeg Manitoba
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In [5] R. C. Lyndon gave the first proof of the Vaught conjecture: that if a, b9 and c are elements of a free group F such that a 2 b 2=c 2, then ab=ba. Lyndon's proof has been followed by many alternative proofs and generalizations [1, 2, 3, 4, 6, 8, 9, 10, 11, 13, 14] all of which involve rather long combinatorial arguments or group theoretical arguments of a noncombinatorial nature.This note provides a short, purely combinatorial proof of the Vaught conjecture.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1975