pith. sign in

arxiv: 1402.6377 · v1 · pith:DEQEJ47Wnew · submitted 2014-02-25 · 🧮 math.CO

On Isomorphism Classes of Generalized Fibonacci Cubes

classification 🧮 math.CO
keywords congstringsbinarycubefibonaccigeneralizedprovedresult
0
0 comments X
read the original abstract

The generalized Fibonacci cube $Q_d(f)$ is the subgraph of the $d$-cube $Q_d$ induced on the set of all strings of length $d$ that do not contain $f$ as a substring. It is proved that if $Q_d(f) \cong Q_d(f')$ then $|f|=|f'|$. 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 $f, f'$ such that $Q_d(f) \cong Q_d(f')$, where $|f| \ge \frac{2}{3}(d+1)$ and $f'$ cannot be obtained from $f$ by its reversal or binary complementation. Strings $f$ and $f'$ with $|f|=|f'|=d-1$ for which $Q_d(f) \cong Q_d(f')$ are characterized.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.