Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups

DOI10.1016/S0021-8693(03)00277-1zbMath1029.05006MaRDI QIDQ1403877

Inessa Levi, Steve Seif

Publication date: 20 August 2003

Published in: Journal of Algebra (Search for Journal in Brave)

zbMATH Keywords

partitiontransformationHamiltonian cyclemiddle levels conjectureidempotent rank of a semigroup

Mathematics Subject Classification ID

Partitions of sets (05A18) Semigroups of transformations, relations, partitions, etc. (20M20) Other types of codes (94B60) Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Rank and idempotent rank of finite full transformation semigroups with restricted range. ⋮ Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups ⋮ The minimal number of generators of a finite semigroup. ⋮ Permutations of a semigroup that map to inverses.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
• Monotone Gray codes and the middle levels problem
• Determinants of partition matrices
• On idempotent ranks of semigroups of partial transformations.
• Index system and separability of constant weight Gray codes
• Idempotent rank in finite full transformation semigroups
• Idempotent generators in finite full transformation semigroups
• S_n-normal semigroups
• COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS
• A mechanical counting method and combinatorial applications
• ALGORITHMS FOR LABELING CONSTANT WEIGHT GRAY CODES

This page was built for publication: Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups