Gray codes for signed involutions

DOI10.1016/j.disc.2018.06.011zbMath1422.94045OpenAlexW2810077219WikidataQ129648426 ScholiaQ129648426MaRDI QIDQ724881

José Luis Santos, Ricardo Mamede, Gonçalo Gutierres

Publication date: 26 July 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.06.011

zbMATH Keywords

Gray codeCAT algorithmsigned involution

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cyclic codes (94B15)

Related Items (1)

Optimal Gray code for involutions

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transposition generation of alternating permutations
• Gray code for permutations with a fixed number of cycles
• Generating restricted classes of involutions, Bell and Stirling permutations
• Gray code for derangements
• A loopless algorithm for generating the permutations of a multiset
• Counting involutory, unimodal, and alternating signed permutations
• A Survey of Combinatorial Gray Codes
• Combinatorics of Set Partitions
• A loopless implementation of a gray code for signed permutations
• Generation of Permutations by Adjacent Transposition

This page was built for publication: Gray codes for signed involutions