Strings from linear recurrences and permutations: a gray code

DOI10.1016/j.tcs.2022.10.012OpenAlexW4304943563MaRDI QIDQ2089698

Elena Barcucci, Antonio Bernini, Renzo Pinzani

Publication date: 24 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.10069

zbMATH Keywords

numeration systemsgray codepattern avoiding permutations\(k\)-generalized Fibonacci sequences

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gray code orders for \(q\)-ary words avoiding a given factor
• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Strings from linear recurrences: a Gray code
• Combinatorics of Permutations
• Systems of Numeration
• Error Detecting and Error Correcting Codes
• Generation of Permutations by Adjacent Transposition
• Some linear recurrences and their combinatorial interpretation by means of regular languages

This page was built for publication: Strings from linear recurrences and permutations: a gray code