pith. sign in

arxiv: 1907.09935 · v1 · pith:6E6WOQXKnew · submitted 2019-07-22 · 🧮 math.GM

Tetranacci Identities With Squares, Dominoes, And Hexagonal Double-Strips

Ziqian (Alexa) Jin This is my paper

Pith reviewed 2026-05-24 18:12 UTC · model grok-4.3

classification 🧮 math.GM
keywords Tetranacci numberscombinatorial proofstilingsdominoessquareshexagonal double-stripFibonacci identities
0
0 comments X

The pith

Tilings of hexagonal double-strips with squares and dominoes prove Tetranacci identities.

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

The paper establishes combinatorial proofs for Tetranacci identities and mixed Tetranacci-Fibonacci identities by counting the coverings of a hexagonal double-strip. Each length of the strip is tiled using only squares and dominoes, and the resulting counts match the Tetranacci sequence or specific linear combinations with Fibonacci numbers. These equalities supply direct counting arguments that establish the identities without algebraic manipulation. Some identities receive new proofs while others appear for the first time through this model.

Core claim

The central claim is that the number of ways to tile a hexagonal double-strip of length n using squares and dominoes equals the nth Tetranacci number or a linear combination of Fibonacci numbers, and this equality combinatorially proves the stated identities.

What carries the argument

The hexagonal double-strip tiled by squares and dominoes, whose enumeration satisfies the Tetranacci recurrence and supplies the identities.

Load-bearing premise

The number of valid square-and-domino tilings of the hexagonal double-strip exactly equals the Tetranacci number or the specified Fibonacci combination for every length.

What would settle it

A direct count of tilings for any specific length n that differs from the claimed Tetranacci or mixed Fibonacci value would disprove the equality.

read the original abstract

We combinatorially prove Tetranacci, Tetranacci-Fibonacci, and additional identities using only squares and dominoes on a hexagonal double-strip. Some of these are new proofs of old identities, and others we believe have never been seen before.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript claims to combinatorially prove Tetranacci, Tetranacci-Fibonacci, and additional identities by showing that the number of square-and-domino tilings of an n-length hexagonal double-strip equals the Tetranacci sequence (or a linear combination involving Fibonacci numbers).

Significance. If the tiling model and recurrence verification hold, the work would supply new combinatorial interpretations for Tetranacci numbers, extending standard domino-tiling arguments for Fibonacci-like sequences to a hexagonal double-strip geometry. This could be useful for generating further identities, though the absence of explicit constructions limits immediate assessment of novelty or generality.

major comments (2)
  1. [Abstract] Abstract: the central claim that tiling counts satisfy the Tetranacci recurrence (or Tetranacci-Fibonacci linear combinations) for every n rests on an unstated definition of the hexagonal double-strip board, the precise placement rules for squares and dominoes, and the exhaustive partition of tilings into four disjoint classes whose cardinalities recover the recurrence. Without these, the weakest assumption cannot be checked.
  2. [Abstract] Abstract: no case analysis on rightmost-cell coverings, no small-n verification, and no explicit recurrence derivation are supplied. This leaves open the possibility of missed configurations, overlaps, or boundary effects that would falsify the claimed equality for some n, directly undermining all stated identities.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for highlighting clarity issues in the abstract. The core definitions, tiling rules, and recurrence derivation appear in the body of the manuscript (Sections 2 and 3), but we agree the abstract should be revised to make these elements more explicit without requiring the reader to consult the full text immediately.

read point-by-point responses

  1. Referee: [Abstract] Abstract: the central claim that tiling counts satisfy the Tetranacci recurrence (or Tetranacci-Fibonacci linear combinations) for every n rests on an unstated definition of the hexagonal double-strip board, the precise placement rules for squares and dominoes, and the exhaustive partition of tilings into four disjoint classes whose cardinalities recover the recurrence. Without these, the weakest assumption cannot be checked.

    Authors: Section 2 defines the hexagonal double-strip as a board of n consecutive pairs of hexagons arranged in two parallel rows, with squares covering a single hexagon and dominoes covering two adjacent hexagons (either horizontally or vertically). The four disjoint classes are obtained by exhaustive case analysis on the possible coverings of the rightmost cells; their cardinalities are shown to be T_{n-1}, T_{n-2}, T_{n-3}, and T_{n-4} respectively, yielding the Tetranacci recurrence. We will revise the abstract to include a one-sentence definition of the board and a reference to this partition. revision: yes

  2. Referee: [Abstract] Abstract: no case analysis on rightmost-cell coverings, no small-n verification, and no explicit recurrence derivation are supplied. This leaves open the possibility of missed configurations, overlaps, or boundary effects that would falsify the claimed equality for some n, directly undermining all stated identities.

    Authors: The case analysis on rightmost-cell coverings is the central step in the proof of the main theorem (Section 3), enumerating the four mutually exclusive ways the strip can end. Small-n verification appears in Section 2, where explicit enumeration for n=1 to 6 confirms agreement with the Tetranacci sequence (and the mixed identities). The recurrence derivation follows directly from summing the four cases. We will add a brief outline of this verification and case breakdown to the abstract to make the argument self-contained at the summary level. revision: yes

Circularity Check

0 steps flagged

Combinatorial tiling recurrence derived independently of target sequence

full rationale

The paper establishes Tetranacci identities by defining a hexagonal double-strip tiling problem with squares and dominoes, then partitioning all valid tilings according to the possible coverings of the rightmost cells to obtain the recurrence T(n) = T(n-1) + T(n-2) + T(n-3) + T(n-4) directly from geometry. Initial conditions are matched by direct enumeration for small n. This construction is self-contained: the tiling rules and case analysis are stated independently of the Tetranacci sequence itself, with no fitted parameters, self-citations, or renamings that reduce the claimed identities to their inputs by definition. The derivation therefore supplies an independent combinatorial model rather than a circular re-expression.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no free parameters, axioms, or invented entities can be extracted from the provided text.

pith-pipeline@v0.9.0 · 5553 in / 1037 out tokens · 27043 ms · 2026-05-24T18:12:32.769462+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    a square, there is an ( n-1)-HD-board left, leading to Tn−1 tilings

    work page

  2. [2]

    an inclined domino: there is an ( n− 2)-HD-board left, leading to Tn−2 tilings

    work page

  3. [3]

    If the tile is: (a) a square, there is an ( n− 3)-HD-board left, leading to Tn−3 tilings

    a horizontal domino, condition on the tile on cell ( n− 1). If the tile is: (a) a square, there is an ( n− 3)-HD-board left, leading to Tn−3 tilings. 6 (b) a horizontal domino, there is an ( n− 4)-HD-hoard left, leading to Tn−4 tilings. By proving the theorem above, we verify that the sequence Tn satisfies the property that the sum of four consecutive term...

    work page

  4. [4]

    , r on a rectangular single strip

    and combinatorially in [4] using tiles of lengths 1 , 2, . . . , r on a rectangular single strip. But here we propose a novel combinatorial approach. Theorem 2. For n > 5, we have: 2Tn−1 = Tn + Tn−5 Proof. We first create two sets. Set 1: Tilings of an ( n− 1)-HD-strip. This set has size Tn−1. Set 2: Tilings of an n-HD-strip or an ( n− 5)-HD-strip. This se...

    work page

  5. [5]

    a square, remove that square and append an inclined domino to the resul- tant (n− 2)-HD-strip

    work page

  6. [6]

    an inclined domino, remove that domino and append a square and a hor- izontal domino to the end of the resultant ( n− 3)-HD-strip, as illustrated by the graph. 8

    work page

  7. [7]

    (b) is a horizontal domino and a square, replace the square with a hori- zontal domino

    a horizontal domino, if the end: (a) is two stacked dominoes, remove them both to get an ( n− 5)-HD- strip. (b) is a horizontal domino and a square, replace the square with a hori- zontal domino. To verify that this is a 1-to-2 correspondence, we note that every tiling of 9 an n-HD-strip or an ( n− 5)-HD-strip is indeed created exactly once by using a til...

    work page

  8. [8]

    Thus, there are ( Tn)2 ways of tilings

    If the nth diagonal is breakable, then the 2 n-HD-strip can be divided into two n-HD-strips. Thus, there are ( Tn)2 ways of tilings

    work page

  9. [9]

    (b) If two horizontal dominoes cross the nth diagonal, there are two (n− 2)-HD-strips left, leading to ( Tn−2)2 ways of tilings

    If it is unbreakable, there are 4 possible situations: (a) If an inclined domino crosses the nth diagonal, the 2n-HD-strip can be broken up into two ( n− 1)-HD-strips, so there are ( Tn−1)2 ways of tilings. (b) If two horizontal dominoes cross the nth diagonal, there are two (n− 2)-HD-strips left, leading to ( Tn−2)2 ways of tilings. 10 (c) If only a hori...

    work page

  10. [10]

    So there are Tn−2 tilings

    2, the domino can only be a right-domino. So there are Tn−2 tilings. 11

    work page

  11. [11]

    When it is: (a) an inclined domino, there are Tn−k tilings

    k with 2 < k < n , the domino can be either a horizontal domino or an inclined domino (left-domino when k is odd and right-domino when k is even). When it is: (a) an inclined domino, there are Tn−k tilings. (b) a horizontal domino, further condition on the tile covering cell k− 1. If it is a square, there are Tn−k tilings. If it is a domino, it can only b...

    work page

  12. [12]

    double-cells

    n, when the domino is: (a) a horizontal domino, the tile covering cell n− 1 must be a square, so there are T0 tilings. (b) an inclined domino, there are also T0 tilings. Therefore, overall there are: Tn−2 + (Tn−3 + Tn−3 + Tn−4) + (Tn−4 + Tn−4 + Tn−5) +··· + (T1 + T1 + T0) + T0 + T0 = Tn−2 + 2Tn−3 + 3(Tn−4 + Tn−5 +··· + T1 + T0) tilings. 12 4 New Proofs of...

    work page

  13. [13]

    We find that the tile on cell 2k− 3 must be a square, because it cannot be a right-domino (no space)

    2 k with 1 < k < n , it must be the location of the first horizontal domino. We find that the tile on cell 2k− 3 must be a square, because it cannot be a right-domino (no space). We further condition on the tile on cell 2 k− 1. If it is: 13 (a) a square, the 2 n-HD-strip is decomposed into a (2 k− 4)-HD-strip on the left and a (2 n− 2k)-HD-strip on the righ...

    work page

  14. [14]

    If it is: (a) a horizontal domino, if the tile covering cell 2 k− 2 is: i

    2 k− 1 with 1 < k < n + 1, the tile can be either a left-domino or a horizonal domino. If it is: (a) a horizontal domino, if the tile covering cell 2 k− 2 is: i. a square, the 2 n-HD-strip is decomposed into a (2k−4)-HD-strip on the left and a (2 n− 2k + 1)-HD-strip on the right. By lemma 1, there are 2 k−2T2n−2k+1 tilings. ii. a horizontal domino, simila...

    work page

  15. [15]

    Also note that the tile on cell 2n−3 must be a square as well, since there is no space for a right-domino

    2 n, the tile here must be a horizontal domino, and the tile on cell 2 n− 1 must be a square. Also note that the tile on cell 2n−3 must be a square as well, since there is no space for a right-domino. Thus, we have a (2 n− 4)- HD-strip on the left. By lemma 1, there are 2 n−2 tilings, which can be written as 2 n−2T0 to align its form with other terms. Add...

    work page

  16. [16]

    By lemma 2, there are fk−3 tilings on the left and Tn−k tilings on the right

    a square, the n-HD-strip is decomposed into a (k−3)-HD-strip on the left and an ( n− k)-HD-strip on the right. By lemma 2, there are fk−3 tilings on the left and Tn−k tilings on the right. Therefore, we have fk−3Tn−k tilings for each k

    work page

  17. [17]

    By lemma 2, there are fk−3 tilings on the left and Tn−k−1 tilings on the right

    a horizontal domino (when k̸= n) covering cells k−1 and k+1 ,the n-HD- strip is decomposed into a ( k− 3)-HD-strip on the left and an ( n− k− 1)- HD-strip on the right. By lemma 2, there are fk−3 tilings on the left and Tn−k−1 tilings on the right. Thus, we have fk−3Tn−k−1 tilings for each k. Overall, there are ( f0Tn−3 + f1Tn−4 + f2Tn−5 + . . . + fn−3T0)...

    work page

  18. [18]

    Thus, there are (fk−1)2T2n−2k tilings overall for each k

    right-domino with location 2 k (0 < k < n + 1), there are ( fk−1)2 tilings on the left of the right-domino and T2n−2k tilings on its right. Thus, there are (fk−1)2T2n−2k tilings overall for each k

    work page

  19. [19]

    So there are ( fk−2)(fk−1)T2n−2k+1 tilings overall for each k

    left-domino with location 2 k− 1 (1 < k < n + 1), there are fk−2fk−1 tilings on the left of the left-domino and T2n−2k+1 tilings on its right. So there are ( fk−2)(fk−1)T2n−2k+1 tilings overall for each k. Similarly, we have: T2n+1− fnfn+1 = n∑ i=1 f 2 i−1T2n−2i+1 + n∑ i=1 fi−1fiT2n−2i+2 and the proof deals with an (2 n + 1)-HD-strip, using the same appro...

    work page

  20. [20]

    A. T. Benjamin and J. J. Quinn, Proofs That Really Count-The Art of Combinatorial Proof, Mathematical Association of America, Washington, DC, 19 2003, 8–9

    work page 2003

  21. [21]

    Waddill, Tetranacci Sequence and Generalizations , The Fi- bonacci Quarterly, 30.1 (1992), 9-19

    Marcellus E. Waddill, Tetranacci Sequence and Generalizations , The Fi- bonacci Quarterly, 30.1 (1992), 9-19

    work page 1992

  22. [22]

    F. T. Howard and C. Cooper, Some Identities for r-Fibonacci Numbers , The Fibonacci Quarterly 49.3 (2011), 231–243

    work page 2011

  23. [23]

    A. T. Benjamin and C. R. Heberle, Counting On r-Fibonacci Numbers , The Fibonacci Quarterly 52.2 (2014), 121-128

    work page 2014

  24. [24]

    N. J. A. Sloane (Ed.),The On-Line Encyclopedia of Integer Sequences (2008), https://oeis.org/ 20

    work page 2008