Strings from linear recurrences and permutations: a gray code
From MaRDI portal
Publication:2089698
DOI10.1016/J.TCS.2022.10.012OpenAlexW4304943563MaRDI QIDQ2089698FDOQ2089698
Authors: Elena Barcucci, Antonio Bernini, R. 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
Recommendations
- Strings from linear recurrences: a Gray code
- Gray codes for \(A\)-free strings
- scientific article; zbMATH DE number 826073
- scientific article; zbMATH DE number 2051160
- Note on Gray codes for permutation lists
- On permutation-generating strings and rosaries
- Combinatorial Gray codes for classes of pattern avoiding permutations
- scientific article; zbMATH DE number 89388
- Gray code for permutations with a fixed number of cycles
- More restrictive Gray codes for some classes of pattern avoiding permutations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Error detecting and error correcting codes
- Combinatorics of permutations
- Systems of Numeration
- Title not available (Why is that?)
- Generation of Permutations by Adjacent Transposition
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some linear recurrences and their combinatorial interpretation by means of regular languages
- Gray code orders for \(q\)-ary words avoiding a given factor
- Strings from linear recurrences: a Gray code
Cited In (2)
Uses Software
This page was built for publication: Strings from linear recurrences and permutations: a gray code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089698)
