ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES
Open Access
- 1 May 2005
- journal article
- research article
- Published by Cambridge University Press (CUP) in Glasgow Mathematical Journal
- Vol. 47 (2) , 221-236
Abstract
Let . This leads to a conjecture related to the Middle Levels Conjecture. Finally, we provide an application of our results to calculating minimal generating sets of idempotents for finite semigroups.Keywords
This publication has 12 references indexed in Scilit:
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroupsJournal of Algebra, 2003
- Permutational labelling of constant weight Gray codesBulletin of the Australian Mathematical Society, 2002
- Order-independence algebrasAlgebra universalis, 1998
- A Survey of Combinatorial Gray CodesSIAM Review, 1997
- Monotone Gray codes and the middle levels problemJournal of Combinatorial Theory, Series A, 1995
- Products of idempotent endomorphisms of an independence algebra of infinite rankMathematical Proceedings of the Cambridge Philosophical Society, 1993
- Index system and separability of constant weight Gray codesIEEE Transactions on Information Theory, 1991
- Idempotent rank in finite full transformation semigroupsProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1990
- Semigroups of transformations generated by idempotents with a given defect1988
- Lexicographic matchings cannot form Hamiltonian cyclesOrder, 1988