arXiv (All)
open access
Congruences for Overcolored Partition $k$-tuples Restricted by Parity of the Parts
In recent work, authors defined $\bar{b}^k_{r,s}(n)$ to be the number of overcolored partition $k$-tuples wherein both even and odd parts are colored with $r$ and $s$ colors, respectively. This function generalizes the overcubic partition $k$-tuples studied by Chacon and Sellers. The present work gi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Strong Edge Colouring of Disk Graphs: A 6-Approximation and an Improved Unit-Disk Bound#1119096
- Genetic Algorithm for Graph Colouring: Exploration of Galinier and Hao's algorithm#824270
- Optimizing the CGMS upper bound on Ramsey numbers#793389
- Optimizing the CGMS upper bound on Ramsey numbers#789385
- Engel's Interval Packing Problem in the Boolean Lattice#1050907
Record · ID 1116945
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive