DMJun 11
k-Convex Polyominoes by Semi-perimeter
arXiv:2606.138459.0h-index: 41
Predicted impact top 49% in DM · last 90 daysOriginality Synthesis-oriented
AI Analysis
Provides a conjectured solution for a combinatorial enumeration problem in polyomino theory.
The paper conjectures the generating function for k-convex polyominoes enumerated by semi-perimeter, derived from enumeration data analysis.
We give the conjectured solution for the generating function of k-convex polyominoes, enumerated by semi-perimeter. The solution was obtained from the analysis of enumeration data that we generated.