arXiv (OAI Expanded)
open access
Rationality and Quasipolynomiality of Restricted Rectangle Partitions
This paper proves Conjecture 5.10 of Gajdzica, Visser, and Zakarczemny on restricted partitions of a rectangle. For every fixed positive integer k, the generating function for feasible multisets of bars of lengths at most k tiling a 2 x n rectangle has denominator dividing the product of (1 - x^j) f
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
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- On Diverse Solutions to Max-k-CSP and Bounded Degree k-SAT#1117868
- Recursive-Line Zarankiewicz Numbers with Four Columns#1083231
- Positive formulas for q-Zeta numerators of Ferrers-cell posets#1050955
- Counting Lattice Points in Minkowski Sums of Cross Polytopes#677742
Record · ID 1071108
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