Search arXivSearch

arXiv · 2507.16387

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

Abstract

The Fibonacci cube $Γ_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $Γ^{(p)}_n$, which are subgraphs of $Q_n$ 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, \ldots , 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 $Γ^p_n$ , 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Mollard. 2025-07-22. $p$-th order generalized Fibonacci cubes and maximal cubes in Fibonacci $p$-cubes. https://arxiv.org/abs/2507.16387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO