p-th order generalized Fibonacci cubes and maximal cubes in Fibonacci p-cubes

Abstract

The Fibonacci cube n is the subgraph of the hypercube Qn induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes (p)n, which are subgraphs of Qn induced by strings without p consecutive 1s. We show the link between vertices of (p)n and compositions of integers with parts in \1, 2, … , p\. Among other eumerative properties, we study the order, size and cube polynomial of (p)n as well as their generating functions. Many of the given expressions are similar to those for Fibonacci cubes, where the p-nomial coefficients play the role of binomial coefficients. We also show that maximal induced hypercubes in Fibonacci p-cubes pn , another generalization of Fibonacci cubes, are connected to vertices of (p + 1)-th order Fibonacci cubes. We use this link to determine the maximal cube polynomial of Fibonacci p-cubes.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…