Search arXivSearch

arXiv · 2511.16580

Block-Separated Overpartitions: Fibonacci Structure and Euler Factorization

Abstract

We introduce and study block-separated overpartitions, a constrained family of overpartitions in which no two consecutive distinct part-blocks are both overlined. This local restriction produces a new sequence that naturally interpolates between classical partitions and unrestricted overpartitions. We show that the internal decoration of distinct part-blocks is governed by Fibonacci-type combinatorics: once the set of distinct part-sizes is fixed, the admissible overlining patterns are counted by Fibonacci numbers. This leads to a symmetric-function expansion of the generating function and a two-state transfer-matrix formulation. After extracting the Euler product, we obtain normalized recurrences, second-order scalar recurrences, determinantal representations, and a continued-fraction description of finite truncations. Finally, we determine the asymptotic growth of the counting function, and prove that block-separated overpartitions share the same exponential scale as ordinary partitions, with a modified subexponential constant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

El-Mehdi Mehiri. 2026-03-06. Block-Separated Overpartitions: Fibonacci Structure and Euler Factorization. https://arxiv.org/abs/2511.16580

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO