Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.13096

Combinatorial construction of known positive series for partition classes defined by Capparelli, Meurman, Primc, and Primc in the $k$=1 Case

Kağan Kurşungöz
View original source ↗Read source document ↗Export metadata ↓

Abstract

Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and Šikić, and by Trupčević. One main reason why CMPP partitions are significant is the authors' conjecture that the generating functions are infinite products in all cases. CMPP partitions are true extensions of the partition classes in the Rogers-Ramanujan-Gordon identities which are defined by difference conditions. As such, a natural question is to look for generating functions similar to the series side of Andrews-Gordon identities. Russell found such bivariate series for one case. These evidently positive series overlap with the positive series found earlier by Griffin, Ono and Warnaar in the edge cases. Russell used symbolic computation in the proofs. We will combinatorially interpret Russell's bivariate series extending one case of the series due to Griffin, Ono and Warnaar in a base partition and moves setting, and supply some missing cases, as well.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kağan Kurşungöz. 2026-05-20. Combinatorial construction of known positive series for partition classes defined by Capparelli, Meurman, Primc, and Primc in the $k$=1 Case. https://arxiv.org/abs/2605.13096

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗