Pith. sign in

REVIEW 2 major objections 2 minor 21 references

A Partition-Based Generating Function for Row-Convex Polyominoes

T0 review · 2 major / 2 minor · reviewed 2026-05-08 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Summing permutation products over integer partitions of the area gives the exact number of row-convex polyominoes.

desk verdict The paper's asymptotic for the polyomino count oscillates into negatives, so the partition counting rule needs fixing. read the letter →

arxiv 2605.03203 v1 submitted 2026-05-04 math.CO cs.CV

Vincenzo M. Scarrica This is my paper · ORCID
classification math.COcs.CV
keywords row-convexpolyominoesgeneratingfunctionsintegerpartitionspermutationproductstransferseriesasymptoticenumerationcombinatorial
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes that the total number of row-convex polyominoes of area N arises by summing, over every integer partition of N, the product of all permutations of the partition's parts. Each such product is presented as counting the distinct horizontal alignments of successive rows that keep the figure row-convex and free of holes. A transfer series argument applied to this sum produces a closed generating function whose dominant singularity yields the precise asymptotic form S(N) ~ A 2^N cos(N theta + phi) with theta = arctan(sqrt(7)/3). A sympathetic reader would care because the construction directly links the classical objects of integer partitions and polyominoes, supplying both an explicit counting formula and an exact growth rate without relying on recursion or exhaustive search.

What carries the argument

the sum over all integer partitions of the area of the product of permutations of each partition's parts, together with the transfer series that converts the sum into a generating function

What would settle it

An exhaustive enumeration of all distinct row-convex polyominoes of area 12, for instance, would either equal or fail to equal the numerical value obtained by summing the relevant permutation products over every integer partition of 12.

Watch

Extended reading notes

Core claim

An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of row lengths, and the product of all permutations of the parts accounts for all possible horizontal alignments of consecutive rows. Summing over the products yields a formula for the total number of convex polyominoes of a given size. Numerical examples are provided for small areas, and the exact generating function is derived via a transfer series argument, establishing the asymptotic growth S(N) as A 2^N cos(N theta + phi) with theta = arctan(sqrt(7)/3).

Load-bearing premise

The product of all permutations of the parts in each partition exactly equals the number of distinct horizontal alignments of consecutive rows that produce valid row-convex polyominoes without holes or overcounting.

Editorial extensions

If this is right

  • The total count of row-convex polyominoes of area N is given exactly by summing the permutation products over all partitions of N.
  • A closed-form generating function for the sequence is obtained directly from the partition construction.
  • The number of such polyominoes grows asymptotically as A 2^N cos(N theta + phi) with theta equal to arctan of sqrt(7) over 3.
  • Integer partitions are placed in direct correspondence with the enumeration of row-convex polyominoes.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same partition-plus-permutation counting rule could be adapted to obtain formulas for column-convex or directed convex polyominoes by changing only the alignment condition.
  • The cosine oscillation in the asymptotic implies that the ratio of successive terms approaches 2 while alternating around that limit in a predictable phase.
  • The formula might permit direct sampling of random row-convex polyominoes by first choosing a partition according to its weighted contribution and then choosing an alignment from the permutations.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The manuscript proposes an alternative generating function for row-convex polyominoes of area N based on integer partitions of N. For each partition, the product of the permutations of its parts is taken to count all possible horizontal alignments of consecutive rows; these products are summed to obtain the total count S(N). An exact generating function is derived via a transfer-series argument, from which the asymptotic S(N) ~ A 2^N cos(N theta + phi) is extracted with theta = arctan(sqrt(7)/3).

Significance. If the combinatorial construction were valid, the work would supply a direct link between integer partitions and polyomino enumeration together with an explicit closed-form asymptotic. No machine-checked proofs, reproducible code, or parameter-free derivations are supplied, however, and the claimed asymptotic is incompatible with positivity of a counting function.

major comments (2)
  1. [Abstract] Abstract: the stated asymptotic S(N) ~ A 2^N cos(N theta + phi) with theta = arctan(sqrt(7)/3) implies that S(N) satisfies the linear recurrence s_n = 3 s_{n-1} - 4 s_{n-2} whose characteristic roots have modulus 2 and arguments ±theta. Because theta/π is irrational, the cosine term is negative for a positive-density set of integers N, so the right-hand side changes sign infinitely often. This cannot equal a strictly positive integer sequence S(N).
  2. [Abstract] Abstract (partition-based construction): the claim that the product of all permutations of the parts of an unordered partition equals the number of valid horizontal alignments is incorrect. Row lengths form an ordered composition of N, and the number of alignments between successive rows of lengths l_i and l_{i+1} is exactly l_i + l_{i+1} - 1. Summing the product of these factors over compositions yields the correct generating function; the partition-plus-permutation construction does not and produces the erroneous recurrence above.
minor comments (2)
  1. The abstract states that numerical examples for small areas are provided, yet no explicit counts, tables, or comparisons with known sequences appear in the supplied text.
  2. The transfer-series steps that convert the partition-permutation sum into the claimed generating function are mentioned but not exhibited; the explicit functional equation or kernel method details are absent.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of our manuscript and for identifying key issues in our proposed generating function and asymptotic analysis. We acknowledge the validity of the criticisms and will make substantial revisions to address them.

read point-by-point responses

  1. Referee: the stated asymptotic S(N) ~ A 2^N cos(N theta + phi) with theta = arctan(sqrt(7)/3) implies that S(N) satisfies the linear recurrence s_n = 3 s_{n-1} - 4 s_{n-2} whose characteristic roots have modulus 2 and arguments ±theta. Because theta/π is irrational, the cosine term is negative for a positive-density set of integers N, so the right-hand side changes sign infinitely often. This cannot equal a strictly positive integer sequence S(N).

    Authors: We agree that this is a serious inconsistency. A valid counting sequence S(N) must be positive for all N, but the proposed asymptotic with an irrational multiple of π in the argument would indeed change sign infinitely often. This indicates an error in our transfer-series derivation of the generating function or in extracting the asymptotic. In the revised version, we will either correct the generating function or remove the asymptotic claim if it cannot be justified. revision: yes

  2. Referee: the claim that the product of all permutations of the parts of an unordered partition equals the number of valid horizontal alignments is incorrect. Row lengths form an ordered composition of N, and the number of alignments between successive rows of lengths l_i and l_{i+1} is exactly l_i + l_{i+1} - 1. Summing the product of these factors over compositions yields the correct generating function; the partition-plus-permutation construction does not and produces the erroneous recurrence above.

    Authors: We accept this correction. Our construction incorrectly treated partitions as unordered and used the product of permutations of part sizes to count alignments, which does not correspond to the actual number of ways to align rows while maintaining convexity and no holes. The proper approach uses ordered compositions and the factor l_i + l_{i+1} - 1 for each consecutive pair. We will revise the manuscript to adopt this correct combinatorial model, update the generating function derivation, and remove or correct the partition-based claims. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity detected in derivation

full rationale

The paper starts from an explicit combinatorial construction (integer partitions of area, product over permutations of parts to count alignments), asserts this sums to the total number of row-convex polyominoes, then applies a transfer-series argument to obtain a closed generating function and its asymptotic expansion. No equation reduces the asserted count to a fitted parameter renamed as a prediction, no self-citation supplies a uniqueness theorem or ansatz, and the asymptotic constants emerge from the characteristic equation rather than being inserted. The chain is therefore self-contained from its initial (possibly incorrect) premise; the observed sign-change problem in the asymptotic is an error of the premise, not a circular reduction.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The central claim rests on a single domain assumption that permutations of partition parts map bijectively to distinct row alignments; no free parameters are introduced beyond constants arising from the generating function, and no new entities are postulated.

assumptions (1)
  • domain assumption The product of all permutations of the parts in an integer partition of the area equals the number of distinct horizontal alignments of consecutive rows that form a row-convex polyomino without internal holes.
    This mapping is invoked to convert partition data into polyomino counts and is the load-bearing step of the proposed generating function.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Partition-Based Generating Function for Row-Convex Polyominoes." pith.science (2026). https://pith.science/paper/2605.03203

@misc{pith2026260503203,
  author       = {Pith},
  title        = {Pith review of: A Partition-Based Generating Function for Row-Convex Polyominoes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2605.03203}},
  note         = {Machine review of arXiv:2605.03203}
}
read the original abstract

An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of row lengths, and the product of all permutations of the parts accounts for all possible horizontal alignments of consecutive rows. Summing over the products yields a formula for the total number of convex polyominoes of a given size. Numerical examples are provided for small areas, and the exact generating function is derived via a transfer series argument, establishing the asymptotic growth S(N) as A2^(N) cos(N*theta) + phi) with theta = arctan(sqrt(7)/3). The method establishes a direct connection between integer partitions and polyomino enumeration, offering a simple yet effective framework for both exact and asymptotic combinatorial analysis. Potential applications include shape priors in discrete image analysis, grid-based modeling, and combinatorial generation of convex structures.

Figures

Figures reproduced from arXiv: 2605.03203 by the authors.

Figure 1
Figure 1. A 17-cell convex polyomino with corner extensions showing lack of row-convexity. view at source ↗
Figure 2
Figure 2. The five tetrominoes (polyominoes of area 4) commonly known from Tetris: I, O, L, T, and S. view at source ↗
Figure 3
Figure 3. Example of the first polyomino with an internal hole (area 8). view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: Comparison of two polyominoes of area 20: left, convex without holes; right, concave with holes.
Figure 5
Figure 5. Figure 5: Applying a partition to a polyomino. A: original 6-cell row; B: split into partitions 2 + 1 + 2 + 1;
Figure 6
Figure 6. Figure 6: Two-row shift. Number of possible shifts:
Figure 7
Figure 7. Figure 7: Three-row maximal shift. Total configurations: (
Figure 8
Figure 8. Figure 8: Permutation of the rows of a row-convex polyomino. Left: rows of lengths 4

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages

  1. [1]

    Checker boards and polyominoes.The American Mathematical Monthly.61, 675-682 (1954)

    Golomb, S. Checker boards and polyominoes.The American Mathematical Monthly.61, 675-682 (1954)

    work page 1954

  2. [2]

    & Rinaldi, S

    Castiglione, G., Frosini, A., Munarini, E., Restivo, A. & Rinaldi, S. Combinatorial as- pects of L-convex polyominoes.European Journal Of Combinatorics.28, 1724-1741 (2007), https://www.sciencedirect.com/science/article/pii/S0195669806001223

    work page 2007

  3. [3]

    & Schaeffer, G

    Duchi, E., Rinaldi, S. & Schaeffer, G. The number of Z-convex polyominoes.Advances In Applied Math- ematics.40, 54-72 (2008), https://www.sciencedirect.com/science/article/pii/S0196885806002004

    work page 2008

  4. [4]

    & Dutuor, I

    Delest, M., Dubernard, J. & Dutuor, I. Parallelogram Polyominoes and Corners.Journal Of Symbolic Computation.20, 503-515 (1995), https://www.sciencedirect.com/science/article/pii/S0747717185710620

    work page 1995

  5. [5]

    Some results concerning polyominoes.The Fibonacci Quarterly.3, 9-20 (1965)

    Klarner, D. Some results concerning polyominoes.The Fibonacci Quarterly.3, 9-20 (1965)

    work page 1965

  6. [6]

    Counting horizontally convex polyominoes.Journal Of Integer Sequences.2, 8 (1999)

    Hickerson, D. Counting horizontally convex polyominoes.Journal Of Integer Sequences.2, 8 (1999)

    work page 1999

  7. [7]

    & Rinaldi, S

    Del Lungo, A., Duchi, E., Frosini, A. & Rinaldi, S. On the Generation and Enumeration of some Classes of Convex Polyominoes.The Electronic Journal Of Combinatorics.11, R60 (2004), https://www.combinatorics.org/ojs/index.php/eljc/article/view/v11i1r60

    work page 2004

  8. [8]

    & Robitaille, A

    Leroux, P., Rassart, E. & Robitaille, A. Enumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice.Advances In Applied Mathematics.21, 343-380 (1998), https://www.sciencedirect.com/science/article/pii/S0196885898906017

    work page 1998

Show all 21 references
  1. [9]

    & Rechnitzer, A

    Bousquet-M´ elou, M., Guttmann, A., Orrick, W. & Rechnitzer, A. Inversion relations, reciprocity and polyominoes.Annals Of Combinatorics.3pp. 223-249 (1999)

    1999

  2. [10]

    A new way of counting the column-convex polyominoes by perimeter.Discrete Mathematics

    Fereti´ c, S. A new way of counting the column-convex polyominoes by perimeter.Discrete Mathematics. 180, 173-184 (1998), https://www.sciencedirect.com/science/article/pii/S0012365X97001143, Proceed- ings of the 7th Conference on Formal Power Series and Algebraic Combinatorics

    1998

  3. [11]

    & Brocchi, S

    Barcucci, E., Brlek, S. & Brocchi, S. PCIF: An Algorithm for Lossless True Color Image Compression. Combinatorial Image Analysis. pp. 224-237 (2009)

    2009

  4. [12]

    Tiling with sets of polyominoes.Journal Of Combinatorial Theory.9, 60-71 (1970) 10

    Golomb, S. Tiling with sets of polyominoes.Journal Of Combinatorial Theory.9, 60-71 (1970) 10

    1970

  5. [13]

    & P˘ aun, G

    Gheorghe, M. & P˘ aun, G. Computing by self-assembly: DNA molecules, polyominoes, cells.Studies In Multidisciplinarity.5pp. 49-78 (2008)

    2008

  6. [14]

    History and introduction to polygon models and polyominoes.Polygons, Polyominoes And Polycubes

    Guttmann, A. History and introduction to polygon models and polyominoes.Polygons, Polyominoes And Polycubes. pp. 1-21 (2009)

    2009

  7. [15]

    Hardy and S

    G. Hardy and S. Ramanujan, Asymptotic Formula for the Distribution of Integers of Various Types, Proceedings of the London Mathematical Society, 2, 112–132 (1917)

    1917

  8. [16]

    & Lehner, J

    Erd¨ os, P. & Lehner, J. The distribution of the number of summands in the partitions of a positive integer. (1941)

    1941

  9. [17]

    & Shepp, L

    Logan, B. & Shepp, L. A variational problem for random Young tableaux.Advances In Mathematics. 26, 206-222 (1977), https://www.sciencedirect.com/science/article/pii/0001870877900305

    1977

  10. [18]

    The limit shape of convex lattice polygons and related topics.Functional Analysis And Its Applications.28, 13-20 (1994)

    Vershik, A. The limit shape of convex lattice polygons and related topics.Functional Analysis And Its Applications.28, 13-20 (1994)

    1994

  11. [19]

    The factorial function: Stirling’s formula.The Mathematical Gazette.84, 42-50 (2000)

    Fowler, D. The factorial function: Stirling’s formula.The Mathematical Gazette.84, 42-50 (2000)

    2000

  12. [20]

    & Rivkin, A

    Barequet, G., Keren, N., Madras, N., Peters, J. & Rivkin, A. On Totally-Concave Polyominoes..CCCG. pp. 17-24 (2024)

    2024

  13. [21]

    & Sedgewick, R

    Flajolet, P. & Sedgewick, R. Analytic Combinatorics. (Cambridge University Press,2009) 11

    2009

Pith tools

Reviewed May 8, 2026 · model on record in the stance chip above.