{"id":"fce0714a-8b67-4861-a7d4-0990d253fe8b","arxiv_id":"2411.13671","paper_version":3,"verdict":"REJECT","confidence":"LOW","novelty_score":2.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper repackages known critical determinant formulas for two-dimensional Minkowski balls into a 'moduli space' language, adding a trivial scaling by 2^m and hexagon area corollaries, with no new proofs.","lead":"This paper restates known geometry-of-numbers results about Minkowski balls under a new 'moduli space' framework, giving formulas for critical determinants and hexagon areas. The formulas reduce to standard scaling properties plus earlier work by the same author, and the paper contains no new proofs.","discovery_kind":"review","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The index-2^m sublattice claim in Theorem 1 is off by a factor 2^m: sublattice determinants scale by the index, not by λ^2, so the stated construction cannot yield the 4^mΔ(D_p) values in (23)–(24).","rationale":"The reader's verdict correctly identifies the paper as an announcement that delegates proofs to [13] and [14]. The most concrete internal problem, however, is not the reliance on [13] but the false construction stated in Theorem 1: the determinant of a sublattice scales by its index, while the determinant of a lattice admissible for a dilated body scales by the square of the dilation factor. These two mechanisms are conflated. Since the paper explicitly claims the determinants (23)-(24) are those of index-2^m sublattices, the theorem as written is false. This is not merely a typo: the same factor 4^m appears in the moduli-space formulas (18)-(19), and the surrounding text presents the sublattice description as the content of the result. The determinant values themselves are correct by standard scaling of the known Δ(D_p), so the intended theorem could be repaired by replacing 'sublattices of index 2^m' with 'lattices 2^mΛ' (or 'superlattices of index 4^m'). But as written, the paper's central construction is wrong. The hexagon theorems 2 and 3 additionally rely on the unproved Lemma 1 that every critical lattice has a 6-point shell; the paper gives no proof or citation for this lemma beyond the same [13]. My concrete test with p=2 isolates the index error exactly; it does not require checking the correctness of [13]. Because the reader already rejected the paper, my finding does not change the verdict, but it adds a precise, independently verifiable internal inconsistency to the rejection.","tokens_in":7424,"tokens_out":8060,"duration_ms":942611,"concrete_test":"Check p=2, m=1 with exact arithmetic. The critical lattice of D_2 is the hexagonal lattice with determinant √3/2 and shortest nonzero vector length 1. Enumerate all index-2 sublattices (there are 3); each has determinant √3 and contains a vector of length 1 (or √3), hence intersects the open disk of radius 2, so none is admissible for 2D_2. The admissible lattice 2Λ has determinant 2√3 and is a superlattice of index 4, not an index-2 sublattice. This one computation isolates the inconsistency; if the author intended 'index 4^m', the statement needs correction, and if the intended construction is scaling, it is a trivial corollary rather than a new theorem.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Every step of the paper's main new theorem rests on the assertion (Theorem 1, end) that the determinants in (23)–(24) \"are the determinants of the sublattices of index 2^m of the critical lattices\" of D_p. This is internally inconsistent with the displayed formulas. For a lattice Λ with determinant Δ(D_p), a sublattice Λ′ of index N has determinant N·Δ(D_p). Thus an index-2^m sublattice would have determinant 2^m Δ(D_p), not 4^m Δ(D_p) as in (23)–(24). The admissible lattice for the dilated body 2^mD_p is obtained by scaling Λ by 2^m, giving determinant 4^m Δ(D_p); that scaled lattice is a superlattice of Λ of index 4^m, not a sublattice of index 2^m. The inconsistency is concrete: for p=2, m=1, Δ(D_2)=√3/2, the claimed determinant is 2√3, while every index-2 sublattice of the hexagonal lattice has determinant √3 and contains a nonzero vector of length ≤2, so it is not even admissible for the radius-2 disk. Hence the construction in Theorem 1 as stated is false. The numerical values in (23)-(24) are nonetheless the standard scaling of the known results from [13]; what fails is the sublattice interpretation, which is also echoed in the 'moduli spaces' formulas (18)-(19). This is a load-bearing error because the paper presents these sublattices as the extremal packing lattices, and the subsequent extremal-function and hexagon theorems inherit the same unsupported six-point assumption (Lemma 1) without proof.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies extremal functions attached to two-dimensional Minkowski balls D_p = {|x|^p + |y|^p < 1} and their scalings 2^m D_p. It claims three main theorems: Theorem 1 gives the critical determinants of 2^m D_p in the piecewise form (23)-(24); Theorem 2 gives the minimal area of inscribed hexagons (26); Theorem 3 gives the minimal area of circumscribed hexagons (27). The derivations rest on a cited result from the author's earlier work [13] for the critical determinant of D_p, formula (22), and on Lemma 1 asserting that the critical lattice always contains exactly three pairs of boundary points. The paper also introduces a moduli-space formalism connecting these quantities to Diophantine approximation, packing, and covering problems.","tokens_in":7826,"tokens_out":7634,"duration_ms":71605,"significance":"If the main claims were fully proved, the paper would offer a compact unified description of packing constants and optimal hexagons for l^p balls. The numerical content is correct in known special cases: for p = 2 the formulas reproduce the classical constants 3√3/2 and 2√3, and formulas (23)-(24) are exactly the standard scaling 4^m Δ(D_p) of the critical determinant from [13]. The paper also clearly organizes several classical results and states a genuinely interesting question about covering constants in §6.3. However, the paper does not supply proofs of its new theorems; Theorem 1 is a scaling of [13], and Theorems 2 and 3 are formal corollaries of the same input plus the unproved six-point lemma. The contribution is therefore mostly organizational, and the load-bearing Lemmas and endpoint-minimization steps are not justified in this manuscript.","major_comments":[{"comment":"The sentence \"these are the determinants of the sublattices of index 2^m of the critical lattices of the corresponding balls D_p\" is inconsistent with (23)-(24). A sublattice of index 2^m has determinant 2^m Δ(D_p), whereas formulas (23)-(24) give 4^m Δ(D_p). The lattice with the latter determinant is the scaled lattice 2^m Λ, which contains Λ as a sublattice of index 4^m, not as a sublattice of index 2^m. The concrete p = 2, m = 1 case makes the failure visible: Δ(D_2) = √3/2, so formula (23) gives 2√3, but no index-2 sublattice of the hexagonal lattice has determinant 2√3, and every index-2 sublattice contains a nonzero vector of length at most 2 by Minkowski's convex body theorem, so it is not admissible for the radius-2 disk. The numerical values in (23)-(24) are correct as the standard scaling 4^m Δ(D_p), but the sublattice interpretation must be corrected.","section":"§6.2, Theorem 1 (end)"},{"comment":"Lemma 1 asserts that for any point (Px, Py) of a critical lattice on the Minkowski curve, the point (u, v) solving (10) lies in the lattice and on the curve, and that the shell contains exactly six points. No proof is given and no reference is cited for this lemma. This property is load-bearing: it is used in §4 to reduce the optimization problem to lattices with three pairs of boundary points, and it underlies Theorems 2 and 3. If the six-point property fails for some p, the hexagon formulas (26)-(27) collapse. The authors should either prove Lemma 1 or state precisely which theorem of [13] or another reference contains this result.","section":"§3.1, Lemma 1"},{"comment":"These theorems are not derived. The minimality claims require an argument that the minimum over the moduli space (16) is attained at the endpoint parameters σ = 1 or σ = σ_p. The paper simply concatenates Proposition 5, Corollary 2, and Proposition 6 with formula (22) from [13]. If (22) is accepted as a black box, Theorems 2 and 3 are immediate corollaries, not new results, and the paper should present them as such with the two-line computation. As written, the reader cannot verify the 3Δ and 4Δ factors without the missing proof of Lemma 1 and without an explicit derivation of the endpoint evaluation.","section":"§6.4, Theorems 2 and 3"},{"comment":"The factor 4^m in (17)-(19) is asserted \"from Proposition 1 and from [13]\", but Proposition 1 only states convexity of 2D. The scaling property d(2^m Λ) = 4^m d(Λ) is standard, but it should be stated explicitly as a lemma with a proof or a precise citation, especially because the paper's later Theorem 1 depends on this scaling law. As written, the transition from (15) to (18) is not justified within the manuscript.","section":"§5.1, Propositions 3 and 4"}],"minor_comments":[{"comment":"The sentence \"In Section we give applications to algebraic number theory\" has a missing section number, and no such section appears in the paper.","section":"§1, last paragraph"},{"comment":"The word \"hear\" should be \"here\"; the displayed inequality is also not connected to the optimization problem that follows until several paragraphs later.","section":"§2, equation (14)"},{"comment":"The typo \"symmetrc\" should be \"symmetric\"; more importantly, the corollary only concerns convexity and does not by itself justify the 4^m determinant scaling used later.","section":"§2, Corollary 1"},{"comment":"The second branch contains an extra comma: \"σ p = (2 p − 1)1/p, , 2 ≤ p ≤ p0\". The intended condition on p across the two branches should be written more clearly.","section":"§6.4, Theorem 3, formula (27)"},{"comment":"The references contain broken LaTeX/encoding, e.g., \"Acad/acute.ts1emie\"; they should be typeset correctly as \"Académie\" with proper accents.","section":"References [14], [15]"}],"recommendation":"major_revision","confidential_remarks":"The main theorems rely almost entirely on the author's own cited works [13]-[15]; this is not improper, but it means the novelty of the present manuscript is mostly expository. The editor may wish to ask for a clear statement of provenance for Lemma 1 and for the endpoint-minimization step in Theorems 2 and 3. The index-2^m error in Theorem 1 is concrete and must be fixed before the paper can be considered, but it is local and does not invalidate the numerical formulas themselves."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this paper does not give a new result. The core formulas for Δ(D_p) and the hexagon areas are quoted from the author's earlier papers [13,14], and the only new-looking step, the m-scaling, is the standard identity Δ(2^m K)=4^m Δ(K). Worse, the closing sentence of Theorem 1—that the determinants in (23)–(24) are those of index-2^m sublattices of the critical lattices—is false as stated. An index-2^m sublattice would have determinant 2^m Δ(D_p), while the formulas are 4^m Δ(D_p). The scaled lattice 2^m Λ is a superlattice of index 4^m, not a sublattice of index 2^m. For p=2, m=1, an index-2 sublattice of the hexagonal lattice has determinant √3 and still contains the unit vector (1,0), so it is not even admissible for 2D_2. So the sublattice interpretation is internally inconsistent with the displayed formulas.\n\nWhat the paper does do is collect a set of known results—Cohn's, Watson's, Davis's, and the author's own work on Minkowski's conjecture—into a 'moduli space' framework. That could be useful for someone wanting a unified notation for packing constants and hexagon areas. The formulas themselves, including the piecewise crossover at p0≈2.5725, match the known values. The paper is honest that the covering extremal function remains open.\n\nThe soft spots, in addition to the index error: no proofs are supplied for Theorems 1–3; they are simply delegated to [13] and [14]. Lemma 1, asserting that the critical lattice always has exactly six boundary points, is unproved and is load-bearing for the hexagon theorems. The novelty is mostly notational, and the reliance on self-citations without independent verification is heavy.\n\nIf you are working on geometry of numbers or lattice packing, you already know these results from the original sources; the moduli-space terminology does not change the content. A reader new to the area might get a useful survey-style overview, but they should not cite it as a primary source.\n\nRecommendation: I would not send this to a serious referee as is. The index error is a concrete false statement, and without proofs the rest is a restatement of earlier work. If the author fixes the index statement and provides a proof of Lemma 1 or a reference with one, then it could be a useful note, but at this point I'd recommend a desk reject.","headline":"Restates known critical determinant formulas for 2D Minkowski balls; the only new m-scaling is standard, and the claimed index-2^m sublattice interpretation is false by a factor of 2^m.","tokens_in":8344,"tokens_out":3450,"would_cite":false,"duration_ms":32864,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["11H06","11-XX","52C05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper gives exact critical determinants for every dyadic scaling of two-dimensional Minkowski balls, plus minimal inscribed and circumscribed hexagon areas, through a two-branch formula with crossover at p≈2.5725.","keywords":["lattice packing","critical determinant","Minkowski ball","Minkowski domain","extremal function","moduli space","inscribed hexagon","covering constant"],"falsifier":"Compute the critical determinant of $D_p$ numerically for several $p$ in $(2.57,2.58)$ to high precision, for example $p=2.5725$, and compare with the two branches of (22); if the minimum is attained at a value of $\\sigma$ strictly between $1$ and $\\sigma_p$, or if a critical lattice with more than six boundary points exists for some $p$, the piecewise formulas and the hexagon theorems fail.","tokens_in":7204,"feed_emoji":"📐","tokens_out":7469,"duration_ms":69711,"temperature":0.7,"pith_summary":"The paper is trying to establish that all the classical extremal quantities attached to two-dimensional Minkowski balls $D_p: |x|^p+|y|^p<1$ -- the critical determinant, the optimal lattice-packing density, and the minimal areas of inscribed and circumscribed hexagons -- are controlled by a single two-branch function on the $(p,\\sigma)$-plane, and that doubling the body simply multiplies this function by $4^m$. If this is right, the hard part of Minkowski's packing problem for these curves is already contained in the known piecewise critical determinant, and every dyadic scaling follows without new optimization. The paper also states that the minimal inscribed hexagon area is exactly $3\\Delta(D_p)$ and the minimal circumscribed hexagon area exactly $4\\Delta(D_p)$, connecting the packing and covering sides through one six-point lattice.","feed_headline":"Two-piece formula gives exact packing constants for Minkowski balls","feed_subtitle":"At every dyadic scale the critical determinant is 4^m times a p-branch value, crossing at p≈2.5725.","key_machinery":"The load-bearing object is the Minkowski-Cohn moduli function $\\Delta(p,\\sigma)=(\\tau+\\sigma)(1+\\tau^p)^{-1/p}(1+\\sigma^p)^{-1/p}$ on the domain $1<p<\\infty$, $1\\le\\sigma\\le\\sigma_p$. It parameterizes the determinants of admissible lattices and the areas of associated hexagons for $D_p$; minimizing over $\\sigma$ gives the critical determinant, and multiplying by $4^m$ accounts for $2^m$-scaling. The second mechanism is Lemma 1's shell property: the critical lattice contains exactly three pairs of points on the Minkowski curve, $\\pm a_1,\\pm a_2,\\pm(a_1+a_2)$, and this is what turns the determinant formula into hexagon area formulas by the factors 3 and 4.","core_discovery":"The central discovery is the exact extremal function for dyadically scaled Minkowski balls in the plane. For each $p>1$, let $\\sigma_p=(2^p-1)^{1/p}$ and let $\\tau_p\\in[0,1)$ solve $2(1-\\tau_p)^p=1+\\tau_p^p$. The paper claims that for every integer $m\\ge0$, the critical determinant of $2^mD_p$ is $\\Delta(2^mD_p)=4^m\\Delta(D_p)$, with $\\Delta(D_p)$ given piecewise by $\\Delta(p,1)=4^{-1/p}(1+\\tau_p)/(1-\\tau_p)$ for $1<p\\le2$ and $p\\ge p_0$, and by $\\Delta(p,\\sigma_p)=\\sigma_p/2$ for $2\\le p\\le p_0$, where $p_0\\approx2.5725$ is the crossover. It further claims the minimal inscribed hexagon area is $3\\Delta(D_p)$ and the minimal circumscribed hexagon area is $4\\Delta(D_p)$. These are presented as corollaries of the six-point critical-lattice property: the critical lattice carries exactly the boundary points $\\pm a_1,\\pm a_2,\\pm(a_1+a_2)$.","pith_inferences":["The paper leaves the covering extremal function open; if a covering analogue of the six-point property holds, the minimal circumscribed hexagon found here would be a natural candidate for the covering constant's lower bound, a step the paper does not take.","Because Lemma 1 is stated without proof, the unconditional status of all hexagon results rests on a missing argument; supplying a proof of the six-point shell property would be the decisive next step.","A numerical search near $p_0\\approx2.5725$ could test the branch switch: for $p$ just below $p_0$ the optimal lattice should be $\\Lambda_p^{(0)}$ with determinant $\\sigma_p/2$, and just above it $\\Lambda_p^{(1)}$ with determinant $4^{-1/p}(1+\\tau_p)/(1-\\tau_p)$; the paper gives no transition analysis."],"forward_implications":["For every integer $m\\ge0$, the densest lattice packing of $2^mD_p$ has its density determined by $4^m$ times the two-branch value of $\\Delta(D_p)$; no separate packing calculation is needed for each scale.","The minimal inscribed hexagon in $D_p$ has area $3\\Delta(D_p)$, and the minimal circumscribed hexagon has area $4\\Delta(D_p)$, so these two covering and packing constants are locked to the same critical lattice.","In the Euclidean case $p=2$, the formulas recover $\\Delta(D_2)=\\sqrt3/2$, inscribed hexagon area $3\\sqrt3/2$, and circumscribed hexagon area $2\\sqrt3$.","Minkowski's optimization problem for the diophantine inequality (14) is solved in two dimensions for all $p$ and all dyadic scales, conditional on the cited critical-determinant theorem."],"supporting_citations":[{"why":"States the piecewise critical determinant of $D_p$ and the two critical lattices $\\Lambda_p^{(0)}$, $\\Lambda_p^{(1)}$; the main theorems depend on this theorem as their starting point.","marker":"[13]"},{"why":"Establishes the case $m=1$ for doubled balls $2D_p$, which Theorem 1 extends to all $m$.","marker":"[14]"},{"why":"Gives the Minkowski-Cohn moduli space formula (15) used to parameterize admissible lattices.","marker":"[4]"},{"why":"Proves the critical-lattice structure for $|x|^p+|y|^p\\le1$ in the Watson range, supporting the branch $1<p<2$.","marker":"[5]"},{"why":"Supports the branch $p_0>p\\ge2$ in the critical-determinant formula.","marker":"[3]"},{"why":"Formulates the optimization problem in the diophantine inequality (14).","marker":"[1]"}],"fun_headline_variants":["Two-piece formula gives exact packing constants for Minkowski balls","Crossover at p≈2.5725 in critical determinant of Minkowski balls","Minimal hexagon areas pinned for planar Minkowski balls","Precise extremal function solves dyadic Minkowski ball packing"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"Everything rests on the cited theorem that the critical determinant of $D_p$ is exactly (22), and on Lemma 1, stated without proof, that every critical lattice has exactly three pairs of boundary points; if either premise fails, the formulas for scaled balls and hexagons collapse.","fun_headline_variants_meta":{"raw":{"variants":["Two-piece formula gives exact packing constants for Minkowski balls","Crossover at p≈2.5725 in critical determinant of Minkowski balls","Minimal hexagon areas pinned for planar Minkowski balls","Precise extremal function solves dyadic Minkowski ball packing"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000588,"raw_usage":{"total_tokens":2767,"prompt_tokens":960,"completion_tokens":1807,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":576,"completion_tokens_details":{"reasoning_tokens":1729}},"tokens_in":576,"tokens_out":1807,"duration_ms":13820,"temperature":1.0,"reasoning_tokens":1729,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T16:01:15.107715+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the critical determinant of $D_p$ numerically for several $p$ in $(2.57,2.58)$ to high precision, for example $p=2.5725$, and compare with the two branches of (22); if the minimum is attained at a value of $\\sigma$ strictly between $1$ and $\\sigma_p$, or if a critical lattice with more than six boundary points exists for some $p$, the piecewise formulas and the hexagon theorems fail.","supporting_citations":[{"cited_title":"Golovanov, A","cited_arxiv_id":null,"evidence_quote":"States the piecewise critical determinant of $D_p$ and the two critical lattices $\\Lambda_p^{(0)}$, $\\Lambda_p^{(1)}$; the main theorems depend on this theorem as their starting point."},{"cited_title":"On packing of Minkowski balls, Comptes rendus de l’Ac ad/acute.ts1emie bulgare Sci., Tome 76, No 3, 335-342 (2023)","cited_arxiv_id":null,"evidence_quote":"Establishes the case $m=1$ for doubled balls $2D_p$, which Theorem 1 extends to all $m$."},{"cited_title":"(1950) Minkowski’s conjectures on critical lattices in the metric {|ξ|p+ |η|p}1/p , Annals of Mathematics, 51 (2), 734–738","cited_arxiv_id":null,"evidence_quote":"Gives the Minkowski-Cohn moduli space formula (15) used to parameterize admissible lattices."},{"cited_title":"(1953) Minkowski’s conjecture on the critical lattices of the region |x|p + |y|p ≤ 1 , (I), (II), J","cited_arxiv_id":null,"evidence_quote":"Proves the critical-lattice structure for $|x|^p+|y|^p\\le1$ in the Watson range, supporting the branch $1<p<2$."},{"cited_title":"(1948) Note on a conjecture by Minkowski, J","cited_arxiv_id":null,"evidence_quote":"Supports the branch $p_0>p\\ge2$ in the critical-determinant formula."},{"cited_title":"(1907) Diophantische Approximationen , Leipzig: Teubner","cited_arxiv_id":null,"evidence_quote":"Formulates the optimization problem in the diophantine inequality (14)."}],"review_version":1}