{"id":"f697f8de-fa47-4858-8f92-c2351a184eda","arxiv_id":"2412.05805","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper derives an infinite-degree equation for the Hausdorff dimension of some sofic self-affine fractals, but its example computations do not match the paper's own definitions.","lead":"The paper claims to compute the exact Hausdorff dimension of certain self-affine fractals, called sofic sets, by solving an infinite-degree equation, including the first non-trivial example in three dimensions. The general theorems are plausible, but the worked examples contain algebraic errors that undermine the demonstration.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Worked examples in §4 are algebraically wrong in at least three of four cases, so the paper's central claim of explicit dimension calculations is unsupported; the Claim 3.7 proof also has an unexplained inequality jump.","rationale":"The reader's verdict is REJECT, and my independent read agrees that the paper as written does not support its central claim. The reader's weakest_assumption focuses on the proof gap in Claim 3.7, which is a legitimate concern about the theorem's proof. However, the most directly falsifying issue is the algebraic errors in the worked examples: three of the four examples contradict the paper's own definitions, and these examples are the sole demonstration of the abstract's claim of explicit, first-time calculations. I verified the three errors explicitly: Example 4.1 fails because (1,1,1) A0^2 A1 is not a multiple of (1,1,1); Example 4.2 has a missing factor 3 in the scalar; Example 4.3 has the wrong r^{-2} coefficient. These are not issues of disagreement with external consensus; they are internal inconsistencies with the matrices and definitions printed in the paper. The theorems may be salvageable after correcting the examples and completing the Claim 3.7 proof, but the paper in its current form does not deliver its central promise. Since my concern does not change the reader's rejection, the verdict should remain REJECT (no change).","tokens_in":16232,"tokens_out":18375,"duration_ms":158368,"concrete_test":"Recompute Example 4.1 with N=1,k=0: evaluate (1,1,1) A0^2 A1 using the printed matrices; it equals (8,6,6), which is not a scalar multiple of (1,1,1), contradicting the displayed CN,k formula. Independently recompute Example 4.2 with k=1,N=1: (1,0) A1 A0 = (4,0), while the paper's formula gives (1,0). Either check is sufficient to falsify the worked calculations on which the central claim rests.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's advertised contribution is to calculate exact Hausdorff dimensions explicitly, and that claim is substantiated only through the four worked examples in §4. At least three of these examples are algebraically inconsistent with the paper's own definitions. In Example 4.1, for the word (0) with N=1,k=0, direct multiplication gives (1,1,1) A0^2 A1 = (8,6,6), which is not a scalar multiple of (1,1,1); the claimed formula for CN,k therefore does not hold, and the displayed infinite-degree equation for r is not derived. In Example 4.2, the vector (1,0) A1^k A2^{N-k} A0 equals ((3^{k+1}5^{N-k}-1)/2)(1,0), not ((3^k5^{N-k}-1)/2)(1,0) as stated; the omission of the factor 3 changes the coefficients Ck. In Example 4.3, b2 = ||M1^2 Φ0||_1^{log_3 2} = 2^{log_3 2}, not sqrt(2), because ||M1^2 Φ0||_1 = 2 and a1 = log_3 2. These are not minor typographical slips; they affect the equations that are the only evidence for the abstract's promise of a first non-trivial calculation in R^3. Separately, the proof of Claim 3.7 compresses several padding steps into one inequality chain and does not explicitly establish both inequalities needed for the claimed limit equality; while this may be repairable, it is another obstacle to accepting the theorem as written.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a 'tower-decomposition' technique for computing the Hausdorff dimension of sofic affine-invariant sets. For planar sofic sets whose summed adjacency matrix is primitive and which contain a block with one-dimensional image, it claims the dimension is log_{m1} r where r solves an explicit infinite-degree equation r^L = C_0 + C_1/r + C_2/r^2 + ... (§3.1, Theorem 3.2). For sofic sets in R^3 with a recursive structure, it claims a reduction to products of tree-indexed operators and, under an l1-increasing hypothesis, a similar explicit equation (§3.2, Theorem 3.6 and Proposition 3.8). Four worked examples in §4 are presented, including a claimed first non-trivial exact dimension calculation for a sofic set in R^3. The conceptual framework is attractive and the derivation is parameter-free, but the worked examples contain algebraic errors and one key proof step in Claim 3.7 is incomplete.","tokens_in":16599,"tokens_out":22349,"duration_ms":192710,"significance":"If the main theorems are correct, the tower-decomposition method would be a valuable extension of Kenyon and Peres' work, turning a generally intractable limit of matrix products into the spectral radius of an explicit operator. The coefficients are derived from the adjacency matrices rather than fitted, and I found no circularity. However, the advertised contribution is substantiated only through the four examples in §4, and at least three of them contain algebraic errors that change the displayed infinite-degree equations and numerical values. The R^3 claim therefore is not supported as written. The paper's core idea is worth pursuing, but the manuscript needs substantial correction and re-verification before the results can be accepted.","major_comments":[{"comment":"The displayed identity for the planar example is false. For N=1 and k=0, the string is (0), and direct multiplication using the displayed matrices gives (1,1,1) A0^2 A1 = (4,4,4) = 4(1,1,1). The displayed formula gives C_{1,0} = 2^2((2+2√2)-(2-2√2)) = 16√2, which is not the scalar 4. Since the coefficients in the infinite-degree equation for r are exactly these scalars raised to log_3 2, the stated value r = 3.1201... is not derived from the displayed computation.","section":"Section 4.1, Example 4.1"},{"comment":"The formula (1,0) A1^k A2^{N-k} A0 = ((3^k 5^{N-k}-1)/2)(1,0) is incorrect. For k=0, N=1, direct computation gives (1,0) A2 A0 = (7,0), not (2,0). Diagonalizing A1 and A2 yields (1,0) A1^k A2^{N-k} A0 = ((3^{k+1}5^{N-k}-1)/2)(1,0). This missing factor of 3 changes the coefficients C_k and hence the numerical value r = 6.4693... claimed in the example.","section":"Section 4.2, Example 4.2"},{"comment":"The coefficient b_2 is miscomputed. From the displayed matrix M1, M1 Φ0 = e1 and M1^2 Φ0 = e_∅ + e2, so ||M1^2 Φ0||_1 = 2 and therefore b_2 = 2^{log_3 2}, not √2. The expansion displayed in the example, 1 + 1/r + √2/r^2 + ..., is accordingly inconsistent with the definition of b_k and with the stated value r = 2.2894... for the R^3 example.","section":"Section 4.3, Example 4.3"},{"comment":"The final inequality in the proof of Claim 3.7 is not justified as written. The sum over W_2^{N+d}(s) and Q(0) is bounded by a constant times a sum over strings of length N+3d+1, but the displayed expression uses Φ_N(s) rather than Φ_{N+3d+1}(s), and the reindexing of the inserted factors A^d and A_p into the tower decomposition is not supplied. Since this estimate is the bridge between Theorem 2.2 and the products M_{u_N}...M_{u_1}, it is load-bearing and needs a complete proof.","section":"Section 3.2, proof of Claim 3.7"},{"comment":"Examples 4.3 and 4.4 invoke Proposition 3.8, but hypothesis (3) of that proposition is not verified. The required string (t_1,...,t_L) is never identified, and the footnote 'This is easily satisfied in most cases' is not a proof of the l1-increasing property for the specific operators M_u. Because the b_k formulas in these examples are derived from Proposition 3.8, this missing verification affects the validity of the R^3 dimension calculations.","section":"Section 4.3, Section 4.4, and Proposition 3.8"}],"minor_comments":[{"comment":"The definition of a sofic system says 'an additional condition on G is required, which we omit here.' This omitted condition should be stated explicitly or cited precisely, since the paper's main objects are sofic systems.","section":"Section 2, Definition 2.1"},{"comment":"In the last displayed inequality of the proof, the tower vector is written as Φ_N(s) although the summation is over I_1^{N+3d+1}; this should be Φ_{N+3d+1}(s), and the surrounding text should be corrected accordingly.","section":"Section 3.2, proof of Claim 3.7"},{"comment":"The example defines b_k only for 'natural number k' but then uses b_0 = 1 in the expansion; the definition should explicitly include k=0.","section":"Section 4.3, Example 4.3"},{"comment":"The introductory statement of the R^3 example uses an operator notation with b_k defined by an expression containing nested norms; the later §4.3 definition is clearer, but the two displays should be reconciled to avoid confusion.","section":"Introduction, first R^3 example"}],"recommendation":"major_revision","confidential_remarks":"The paper makes a strong priority claim ('first non-trivial calculation in R^3') that should be checked carefully against [Ali24] and [Fe24] once the Section 4 computations are corrected. The algebraic errors in the worked examples and the incomplete proof of Claim 3.7 are the main obstacles; if the author can correct the examples and supply the missing reindexing argument, the paper may become publishable."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The technique is genuinely new. The tower-decomposition idea extends Kenyon-Peres to non-commuting matrices, and the tree-indexed operator version for R^3 is a real step beyond the prior commuting/shared-eigenvector cases. The main theorems are clearly stated and the proof strategy is understandable. If the theorems are correct, the R^3 result is a genuine first. The citation pattern is fine, and the self-citation to [Ali24] is appropriate since that work covered only trivial cases.\n\nBut the worked examples, which are the only evidence for the advertised explicit calculations, do not hold up. In Example 4.1, the closed form for C_{N,k} does not match direct multiplication: for N=1, k=0, the formula gives 16√2, while (1,1,1)A0^2A1 = (4,4,4); for k=1, (1,1,1)A1A0A1 is not a scalar multiple of (1,1,1) at all. The identity at the heart of the example fails. In Example 4.2, there is a missing factor of 3: the correct coefficient involves 3^{k+1}5^{N-k}, not 3^k5^{N-k}. In Example 4.3, the stated b2 = √2 does not follow from the operator as defined; with M1 as written, ||M1^2Φ0||_1 = 1, and even the stress-test's proposed value 2^{log_3 2} is not √2. These are not minor typos; they affect the equations that produce r and the claimed dimension.\n\nThere is also a gap in the proof of Claim 3.7. The inequality chain jumps from the tower norm to the original matrix product without establishing both directions of the limit, and the padding steps need more detail. This is repairable, but it is another obstacle to accepting the theorem as written.\n\nThe main theorems may be salvageable. The proof of Theorem 3.2 looks structurally sound, and the Claim 3.7 gap appears fixable. But as written, the paper does not deliver what it promises.\n\nMy recommendation: reject the current version, but invite a major revision where the examples are recomputed and the Claim 3.7 proof is completed. The technique deserves referee attention; the current version does not.","headline":"Novel tower-decomposition approach for sofic self-affine fractals, but the worked examples contain algebraic errors that undermine the paper's main claim; needs major revision.","tokens_in":17124,"tokens_out":6935,"would_cite":false,"duration_ms":55837,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["28A80","28D20","37B40"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that for certain sofic self-affine fractals, the Hausdorff dimension solves an explicit infinite-degree equation.","keywords":["self-affine fractals","sofic systems","sofic affine-invariant sets","Hausdorff dimension","tower-decomposition","spectral radius","dynamical systems"],"falsifier":"For one of the paper's own $R^{3}$ examples, such as Example 4.3 or 4.4, compute both sides of Claim 3.7 for increasing finite N -- the tower sum sum_s ||Phi_N(s)||$_1^{{a_1}}$ and the original double sum in equation (1.1) -- and compare their exponential growth rates; if they differ, the reduction fails and the claimed dimension does not follow.","tokens_in":15989,"feed_emoji":"📐","tokens_out":6583,"duration_ms":50006,"temperature":0.7,"pith_summary":"The paper shows that for sofic self-affine fractals satisfying a 1-dimensional-image condition in the plane, or a recursive structure in three dimensions, the Hausdorff dimension is not just an intractable limit of matrix products but equals the logarithm of a concrete number. That number is the unique positive root of an explicit infinite-degree equation, equivalently the spectral radius of a linear operator built from the tower-decomposition. The author applies this to several non-commuting examples and obtains the first non-trivial exact Hausdorff dimensions of sofic sets in $R^{3}$. The value matters because it turns a generally incalculable expression into explicit arithmetic.","feed_headline":"Exact dimensions for sofic fractals, from an infinite-degree equation","feed_subtitle":"New technique yields exact Hausdorff dimensions for sofic fractals, including first non-trivial 3D cases.","key_machinery":"The tower-decomposition: insert a distinguished string s whose matrix product has 1-dimensional image, record the scalar factor J_u multiplying a fixed left vector v^top for every possible placement of that string, and group the matrix-product sum by the position of the last such factor. This converts the original sum into iteration of an infinite matrix M (a shift plus a return map), whose spectral radius gives the dimension. In $R^{3}$ the analogous operator acts on the direct sum indexed by the rooted tree Gamma of finite words over non-removable indices, with return weights C_s(u), and the dimension becomes log_{m1} of the spectral radius of the product operator.","core_discovery":"The central discovery is that the matrix-product limit for the Hausdorff dimension can be collapsed, under suitable degeneracy conditions on the adjacency matrices, into iteration of a single linear operator. In the planar case, if some string of matrices has 1-dimensional image, the dimension is log_{m1} r where r is the unique positive solution of r^L = C_0 + C_1/r + C_2/$r^{2}$ + ... with explicitly given non-negative constants C_k. In $R^{3}$, when the sofic set has a recursive structure (for every first-level symbol s there is a second-level symbol t with A_{(s,t)} having image spanned by a fixed vector), the same reduction works with an operator on a tree-indexed space, and the dimension is again log_{m1} of a spectral radius. The author's three-dimensional examples are the first non-trivial exact Hausdorff dimension calculations for sofic sets in $R^{3}$.","pith_inferences":["If the tower-decomposition extends to higher dimensions, the same tree-indexed operator formalism could yield explicit dimension equations for sofic self-affine sponges in R^d whenever a recursive-structure analogue holds.","The infinite-degree equation formulation suggests a numerical scheme: truncate the operator to finite submatrices and apply Perron-Frobenius to approximate r, yielding certified bounds on the dimension.","The spectral-radius viewpoint may allow perturbation estimates: small changes to the adjacency matrices should change r continuously, giving stability statements for the dimension without recomputing the full limit.","The success under the 1-dimensional-image condition hints that other degenerate conditions, such as rank-one factors appearing in longer products, might also collapse the matrix-product limit to a single operator."],"forward_implications":["For planar sofic sets satisfying the 1-dimensional-image condition, the Hausdorff dimension is exactly log_{m1} r with r the unique positive root of the explicit infinite-degree equation.","For R^3 sofic sets with recursive structure and primitive sum matrix, the dimension is the exponential growth rate of ||M_{s_N} ... M_{s_1} Phi_0||_1^{a_1} summed over first-level strings, computable as a spectral radius.","When a removable index exists, the R^3 dimension satisfies a one-variable infinite-degree equation r = b_0 + b_1/r + b_2/r^2 + ..., as in Proposition 3.8.","The worked examples give explicit numerical dimensions: log_2 3.1201... = 1.6416... and log_3 6.4693... = 1.6994... in the plane; log_2 2.2894... = 1.1950... and log_2 4.673... = 2.224... in R^3."],"supporting_citations":[{"why":"Supplies the planar Hausdorff dimension formula as a limit of matrix products and the initial tower idea used in Example 4.2.","marker":"[KP96-2]"},{"why":"Provides the general R^3 dimension formula (Theorem 2.2) that the tower-decomposition refines.","marker":"[BF12, Theorems 1.1 and 4.1]"},{"why":"Gives the version of the dimension formula for sofic sets in arbitrary dimension that the paper uses as its starting point.","marker":"[Fe24, Lemma 2.5]"},{"why":"Shows the dimension formula can also be obtained via weighted topological entropy, establishing the context of prior trivial cases.","marker":"[Ali24, Claim 1.6]"}],"fun_headline_variants":["First exact 3D sofic fractal dimension computed","Infinite-degree equation solves sofic fractal dimension","Spectral radius yields exact Hausdorff dimension for sofic fractals","Exact sofic fractal dimension via infinite-degree equation","Kenyon-Peres method gives exact 3D sofic dimension"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof of the three-dimensional reduction (Claim 3.7) assumes that the $\\ell^1$ norms of the tower vectors grow at exactly the same exponential rate as the original matrix-product sums, and the justification for one inequality step in that claim is not fully spelled out.","fun_headline_variants_meta":{"raw":{"variants":["First exact 3D sofic fractal dimension computed","Infinite-degree equation solves sofic fractal dimension","Spectral radius yields exact Hausdorff dimension for sofic fractals","Exact sofic fractal dimension via infinite-degree equation","Kenyon-Peres method gives exact 3D sofic dimension"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001071,"raw_usage":{"total_tokens":4442,"prompt_tokens":855,"completion_tokens":3587,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":471,"completion_tokens_details":{"reasoning_tokens":3514}},"tokens_in":471,"tokens_out":3587,"duration_ms":23835,"temperature":1.0,"reasoning_tokens":3514,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T20:22:56.670198+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For one of the paper's own $R^{3}$ examples, such as Example 4.3 or 4.4, compute both sides of Claim 3.7 for increasing finite N -- the tower sum sum_s ||Phi_N(s)||$_1^{{a_1}}$ and the original double sum in equation (1.1) -- and compare their exponential growth rates; if they differ, the reduction fails and the claimed dimension does not follow.","supporting_citations":[],"review_version":1}