On isomorphism classes of generalized Fibonacci cubes
From MaRDI portal
(Redirected from Publication:499490)
Abstract: The generalized Fibonacci cube is the subgraph of the -cube induced on the set of all strings of length that do not contain as a substring. It is proved that if then . The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary string. It is also proved that there exist pairs of strings such that , where and cannot be obtained from by its reversal or binary complementation. Strings and with for which are characterized.
Recommendations
Cites work
- scientific article; zbMATH DE number 1157214 (Why is no real title available?)
- Analytic combinatorics
- Asymptotic number of isometric generalized Fibonacci cubes
- Asymptotic properties of Fibonacci cubes and Lucas cubes
- Connectivity of Fibonacci cubes, Lucas cubes, and generalized cubes
- Fast recognition of Fibonacci cubes
- Generalized Fibonacci cubes
- Generalized fibonacci cubes are mostly hamiltonian
- Linear recognition and embedding of Fibonacci cubes
- Parity index of binary words and powers of prime words
- Solution to a conjecture on words that are bad and 2-isometric
- String overlaps, pattern matching, and nontransitive games
- Structure of Fibonacci cubes: a survey
- The index of a binary word
Cited in
(15)- Circular embeddability of isometric words
- Proofs of two conjectures on generalized Fibonacci cubes
- Asymptotic number of isometric generalized Fibonacci cubes
- Hypercubes and isometric words based on swap and mismatch distance
- On generalized Fibonacci cubes and unitary transforms
- Combinatorial isomorphism between Fibonacci classes
- Infinite families of 2-isometric and not 3-isometric binary words
- A negative answer to a problem on generalized Fibonacci cubes
- Cube-complements of generalized Fibonacci cubes
- A characterization of non-isometric binary words
- Quaternary \(n\)-cubes and isometric words
- The self-concatenation of isometric strings is isometric
- On \(k\)-ary \(n\)-cubes and isometric words
- All good (bad) words consisting of 5 blocks
- Proof of a conjecture on 2-isometric words
This page was built for publication: On isomorphism classes of generalized Fibonacci cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499490)