Optimal Gray code for involutions

DOI10.1016/J.IPL.2019.04.003MaRDI QIDQ2419799zbMATH OpenOpenAlexWikidataFDO

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

Publication date 4 June 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.04.003

zbMATH Keywords

Gray codeHamming distanceinvolution

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics in computer science (68R05)

Recommendations

• Gray codes for involutions
• Gray codes for signed involutions
• Gray code for permutations with a fixed number of cycles
• Gray code for permutations with a fixed number of left-to-right minima.
• More restrictive Gray codes for some classes of pattern avoiding permutations

Cites work

• Generating involutions, derangements, and relatives by ECO
• Gray codes for involutions
• Gray codes for signed involutions
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 434868 (Why is no real title available?)
• The On-Line Encyclopedia of Integer Sequences

Cited in

(4)

• Gray codes for involutions
• scientific article; zbMATH DE number 4087600 (Why is no real title available?)
• Doubly adjacent gray codes for the symmetric group
• Gray codes for signed involutions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Optimal Gray code for involutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419799)