pith. sign in

arxiv: 2605.05137 · v2 · submitted 2026-05-06 · ❄️ cond-mat.stat-mech

Lattice Tadpoles

S G Whittington This is my paper

Pith reviewed 2026-05-15 06:06 UTC · model grok-4.3

classification ❄️ cond-mat.stat-mech
keywords lattice tadpoleslassosself-avoiding embeddingsasymptotic growthtopological constraintsknotspolymer statisticslattice walks
0
0 comments X

The pith

The number of lattice tadpoles grows exponentially with size, even under knotting or piercing constraints.

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

The paper proves that the number of tadpoles embedded in a lattice has a well-defined exponential growth rate as the total length increases. This holds for standard tadpoles as well as those with additional constraints, such as the head being unknotted or the tail piercing the surface of the head. The same type of proof works for related shapes including dumbbells and various multi-tailed tadpoles. These results give precise information on how the count of such structures scales, which is useful for understanding polymer configurations on lattices. Readers interested in statistical mechanics of long molecules would find the existence of these limits informative for modeling purposes.

Core claim

We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the surface spanned by the head. Similar results can be proved for other homeomorphism types such as dumbbells, twin tailed tadpoles and two tailed tadpoles.

What carries the argument

Tadpoles or lassos as self-avoiding lattice embeddings with a loop head and attached tail, subject to topological constraints.

If this is right

  • The growth constant for the number of tadpoles exists and can be bounded using submultiplicative arguments.
  • The growth rate remains the same when the head must be unknotted.
  • Piercing of the head's surface by the tail does not prevent the existence of the asymptotic limit.
  • Analogous asymptotic results apply to dumbbells and twin-tailed tadpoles.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Such growth rates could inform the entropy calculations for knotted polymer chains in three dimensions.
  • The approach might extend to counting other constrained lattice animals with attachments.
  • Numerical simulations of large tadpoles could verify the predicted growth rates under constraints.

Load-bearing premise

The structures are self-avoiding embeddings on the regular d-dimensional integer lattice, permitting the application of standard submultiplicative inequalities for their counts.

What would settle it

Enumeration of tadpole numbers for increasing sizes showing that the limit of (1/n) log of the count fails to exist when the unknotted constraint is imposed.

Figures

Figures reproduced from arXiv: 2605.05137 by S G Whittington.

Figure 1
Figure 1. Figure 1: A tadpole with unknotted head where the tail pierces the head three times. 2 Some preliminary results We shall need several definitions and results that are already in the literature and we shall collect them in this section for convenience. We shall primarily be concerned with the d-dimensional hypercubic lattice, Z d , and especially with the square and simple cubic lattices. Suppose that cn is the numbe… view at source ↗
Figure 2
Figure 2. Figure 2: A polygon in two dimensions containing the pattern P1. Theorem 2. For 0 < α < 1 limn→∞ n −1 log t(αn,(1 − α)n) = κd Proof: If we delete an edge in the head, incident on the vertex of degree 3 we obtain a self-avoiding walk with n − 1 edges, so t(αn,(1 − α)n) ≤ cn−1 and lim supn→∞ n −1 log t(αn,(1 − α)n) ≤ κd. We can obtain a lower bound by concatenating a polygon and a positive walk by translating to that … view at source ↗
Figure 3
Figure 3. Figure 3: A tadpole obtained by modifying the pattern P1. Proof: To obtain an upper bound on tˆn we observe that tˆn ≤ tn = e κ2n+o(n) .The lower bound comes from Kesten’s pattern theorem [9] adapted to work for polygons [15]. Suppose that m is even. Define the pattern P1 as follows. It consists of 2(m + 1) edges: P1 = (0, 0) − (0, 1) − · · · − (0, m/2) − (1, m/2) − (1, m/2 − 1) − . . . −(1, −m/2) − (2, −m/2) − (2, … view at source ↗
Figure 4
Figure 4. Figure 4: A tadpole where the head is a trefoil and the tail pierces the head once. and hence lim infn→∞ n −1 log t [k] (αn,(1 − α)n) ≥ κ3. To get an upper bound delete an edge from the tadpole head incident on the vertex of degree 3, to obtain a self-avoiding walk with n−1 edges. Hence lim supn→∞ n −1 log t [k] (αn,(1 − α)n) ≤ κ3. The first result follows. For the second result, use the first construction described… view at source ↗
Figure 5
Figure 5. Figure 5: Twin tailed and two tailed tadpoles. Proof: Define the pattern P3 = (0, 0, 0) − (−1, 0, 0) − (−2, 0, 0) − (−2, 1, 0) − (−2, 2, 0) − (−1, 2, 0) − (0, 2, 0) − (0, 1, 0)− (0, 1, −1) − (−1, 1, −1) − (−1, 1, 0) − (−1, 1, 1) By adding the edge (0, 0, 0) − (0, 1, 0) we can convert P3 into a tadpole with a head having eight edges, that is pierced by the tail. If we consider self-avoiding walks with n − 1 edges tha… view at source ↗
Figure 5
Figure 5. Figure 5: Twin tailed tadpole (left) and two tailed tadpole (right). A dumbbell is a graph with two cycles joined by a sequence of edges. Dumbbells have two vertices of degree 3 and cyclomatic index 2. They occur in Sykes’ counting theorem [16]. Twin tailed and two tailed tadpoles are sketched in [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
read the original abstract

We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the surface spanned by the head. Similar results can be proved for other homeomorphism types such as dumbbells, twin tailed tadpoles and two tailed tadpoles.

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

1 major / 0 minor

Summary. The manuscript proves the existence of connective constants (limits of (1/n) log t_n) for the number t_n of lattice tadpoles (lassos) on the d-dimensional integer lattice, including cases with an unknotted head or a tail that pierces the surface spanned by the head. The proofs rely on establishing submultiplicative or supermultiplicative inequalities for the constrained counts and applying Fekete’s lemma; analogous results are claimed for dumbbells, twin-tailed tadpoles, and two-tailed tadpoles.

Significance. If the derivations hold, the work supplies rigorous existence results for growth rates of topologically constrained self-avoiding lattice embeddings. Such results are valuable for statistical-mechanics models of polymers and knotted structures, where exact connective constants are rarely available. The extension to multiple homeomorphism types is a positive feature.

major comments (1)
  1. [Proof of the main inequality (likely §3)] The central step establishing submultiplicativity (or supermultiplicativity) for constrained tadpoles must be examined in detail. Simple concatenation of two valid embeddings at a lattice edge does not automatically preserve an unknotted head or a piercing condition, and may violate self-avoidance at the join. The manuscript should supply an explicit construction (fixed-size buffer, pattern-theorem excision, or similar) that restores the constraint while adding only a bounded multiplicative factor; without this, the inequality t_{m+n} ≤ C t_m t_n does not follow from the unconstrained case and Fekete’s lemma cannot be invoked directly.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for highlighting the need for a fully explicit argument in the proof of the submultiplicative inequality. We address the concern below and will incorporate the requested details in the revised manuscript.

read point-by-point responses

  1. Referee: [Proof of the main inequality (likely §3)] The central step establishing submultiplicativity (or supermultiplicativity) for constrained tadpoles must be examined in detail. Simple concatenation of two valid embeddings at a lattice edge does not automatically preserve an unknotted head or a piercing condition, and may violate self-avoidance at the join. The manuscript should supply an explicit construction (fixed-size buffer, pattern-theorem excision, or similar) that restores the constraint while adding only a bounded multiplicative factor; without this, the inequality t_{m+n} ≤ C t_m t_n does not follow from the unconstrained case and Fekete’s lemma cannot be invoked directly.

    Authors: We agree that a direct concatenation of two constrained tadpoles does not automatically preserve the topological constraints (unknotted head or piercing tail) or self-avoidance at the join. In the original manuscript the argument for the inequality t_{m+n} ≤ C t_m t_n is sketched via a standard concatenation followed by a brief reference to a fixed-size buffer that restores the constraints; however, the details of the buffer construction and the resulting multiplicative constant were not written out explicitly. In the revision we will add a dedicated subsection (new §3.2) that supplies the explicit construction: we excise a small, fixed-size pattern around the join point using a pattern-theorem argument and replace it with a pre-chosen buffer configuration of bounded length that (i) reconnects the two pieces while preserving the unknotted or piercing condition and (ii) guarantees self-avoidance. The buffer adds at most a multiplicative factor C (independent of m and n) that depends only on the lattice dimension and the fixed buffer size. With this construction the desired submultiplicative inequality holds for each of the constrained families, and Fekete’s lemma applies directly. We have already verified that the same buffer technique works for the dumbbell, twin-tailed, and two-tailed cases mentioned in the paper. revision: yes

Circularity Check

0 steps flagged

No circularity: proofs rely on standard submultiplicative inequalities without reduction to fitted inputs or self-citations

full rationale

The paper establishes rigorous asymptotic results for the number of lattice tadpoles (including with unknotted-head or piercing constraints) by invoking standard submultiplicative inequalities on the counts t_n and applying Fekete’s lemma to obtain the limit of (1/n) log t_n. No parameters are fitted to data, no 'predictions' are constructed from subsets of the same quantities, and no load-bearing steps reduce by definition or via self-citation chains to the target result. The derivation chain is self-contained within combinatorial lattice arguments and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard combinatorial assumptions for self-avoiding walks on Z^d and basic topological invariants; no new free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption The lattice is the regular d-dimensional integer lattice Z^d and embeddings are self-avoiding.
    Invoked implicitly for all counting arguments on embedded structures.
  • standard math Standard submultiplicative inequalities hold for the number of constrained walks and polygons.
    Typical tool for proving existence of connective constants in lattice combinatorics.

pith-pipeline@v0.9.0 · 5340 in / 1224 out tokens · 32104 ms · 2026-05-15T06:06:01.779084+00:00 · methodology

Review history (2 revisions) →

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

18 extracted references · 18 canonical work pages · 1 internal anchor

  1. [1]

    Beaton N R 2025Personal communication

    work page

  2. [2]

    Beaton N R and Owczarek A L 2026Random sampling of self-avoiding theta-graphs arXiv:2605.04367

    work page internal anchor Pith review Pith/arXiv arXiv

  3. [3]

    Dabrowski-Tumanski P, Goundaroulis D, Stasiak A, Rawdon E and Sulkowska J I 2024Protein Science335133

    work page

  4. [4]

    Dabrowski-Tumanski P, Gren B and Sulkowska J I 2019Polymers11707

    work page

  5. [5]

    Guttmann A J and Sykes M F 1973J. Phys. C: Solid State Phys.6945-954

    work page

  6. [6]

    Guttmann A J and Whittington S G 1978J. Phys. A: Math. Gen.11721-729

    work page

  7. [7]

    Hammersley J M 1957Proc. Camb. Phil. Soc.53642-645

    work page

  8. [8]

    Hammersley J M 1961Proc. Camb. Phil. Soc.57516-523

    work page

  9. [9]

    Kesten H 1963J. Math. Phys.4960-969

    work page

  10. [10]

    Madras N 1988J. Stat. Phys.53689-701

    work page

  11. [11]

    Niemyska W, Dabrowski-Tumanski P, Kadlof M, Haglund E, Sulkowski P and Sulkowska J I 2016Scientific Reports636895

    work page

  12. [12]

    O’Brien G L 1990J. Stat. Phys.59969-979

    work page

  13. [13]

    Pippenger N 1989Disc. Appl. Math.25273-278

    work page

  14. [14]

    Stanley H E 1987Phase Transitions and Critical PhenomenaOxford University Press

    work page

  15. [15]

    Sumners D W and Whittington S G 1988J. Phys. A: Math. Gen.211689-1694

    work page

  16. [16]

    Sykes M F 1961J. Math. Phys.252-62

    work page

  17. [17]

    Whittington S G 1975J. Chem. Phys.63779-785

    work page

  18. [18]

    Whittington S G, Trueman R E and Wilker J B 1975J. Phys. A: Math. Gen.856-60 12

    work page