{"id":"9f5478a6-ddd5-4a05-9128-dc02108206cd","arxiv_id":"2412.05857","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Restricted numerical power monoids have no primal elements, and the distribution of atom sizes in P_fin,0(N_0) is asymptotically binomial with parameters n and 1/2.","lead":"The paper extends a recent theorem on power monoids by showing that restricted numerical power monoids have no primal (prime-like) elements, and it develops a new size-based census of atoms in the main example. The census reveals that the number of elements in a random atom behaves asymptotically like a fair coin flip count, a result that refines earlier atomic density work.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 5.2 Case 2 omits the union over O(n^r) possible small factors B, so the claimed O(n^{-1}) bound on P(S2) is unjustified and the moment theorem lacks a proof.","rationale":"The paper's central probabilistic claim is the asymptotic binomial behavior of atom sizes, which rests entirely on Theorem 5.2's asymptotic formula for α_{n,k}. The reader identified a uniformity gap in Theorem 5.4's use of the error term γ_ε(n); that is a legitimate concern. However, a more basic omission occurs inside Theorem 5.2: Case 2 bounds S2 for a single pattern B but fails to account for the O(n^r) possible choices of B. Without a union bound, the claimed O(n^{-1}) probability for S2 is unsupported, and for r ≥ 2 the simple union bound would give a polynomial probability. This is an internal proof gap, not a disagreement with external consensus. The theorem is plausible and the gap may be fixable with a sharper large-deviation argument, so conditional acceptance remains appropriate rather than outright rejection. I therefore keep the reader's CONDITIONAL verdict, while noting that the specific weak point I would emphasize is the missing union in Case 2 of Theorem 5.2 rather than the uniformity of γ_ε(n) in Theorem 5.4.","tokens_in":19255,"tokens_out":26034,"duration_ms":242991,"concrete_test":"Re-derive the probability bound for S2 by summing the Lemma 5.1 estimate over all B ⊆ [0, ωn] with |B| ≤ r and 0 ∈ B. If the summed bound is O(n^{r−1}) times binom(n, εn−1), then the asserted O(n^{-1}) count in Theorem 5.2 does not follow; test whether a Chernoff or Janson large-deviation bound on the number of isolated points yields exp(−c n) instead, which would make the gap repairable.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central moment theorem (Theorem 5.4) depends on the asymptotic formula for α_{n,k} given in Theorem 5.2. In the proof of Theorem 5.2, Case 2 bounds the probability that A lies in S2, the set of subsets admitting a decomposition A = B + C with min(|B|,|C|) ≤ r. After restricting to max B ≤ ωn, the authors fix a pattern (b1,...,br) representing the small factor B and apply Lemma 5.1 to assert that there are binom(n, εn−1) O(n^{-1}) possible A. But S2 is the union over all B with |B| ≤ r and max B ≤ ωn, of which there are at least (ωn)^r. A union bound therefore gives O(n^{r−1}) binom(n, εn−1) sets A, not O(n^{-1}) binom(n, εn−1). Since r is later chosen large to satisfy γ > 2ε^r, the factor n^{r−1} is not o(1). Thus the proof of the asymptotic formula is incomplete, and Theorem 5.4's moment limit rests on an unproved estimate. The reader's uniformity concern about γ_ε(n) is a separate, real gap; here the gap is more basic because it affects the pointwise statement of Theorem 5.2 for each fixed ε.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies arithmetic properties of power monoids of numerical monoids. In Section 3 it proves that restricted numerical power monoids contain no primal elements, and that among unrestricted numerical power monoids only P_fin(N_0) contains a primal element, namely {1}. In Sections 4 and 5 it analyzes the atomic density of P_fin,0(N_0). The authors define the block sizes alpha_{n,k} of atoms of size k with maximum at most n, prove an upper bound in Theorem 4.3, an asymptotic lower bound for 0.111n < k < 0.5n in Theorem 4.6, and an asymptotic formula alpha_{n,epsilon n} = (1-o(1)) binom(n,epsilon n-1) for each fixed epsilon in (0,1) in Theorem 5.2. From this they derive almost-unimodality of the sequences (alpha_{n,k})_k and the main moment theorem: for the random variable X_n giving the size of a uniformly random atom with maximum at most n, E(X_n^r)/E(Y_n^r) -> 1, where Y_n ~ Bin(n,1/2).","tokens_in":19408,"tokens_out":24252,"duration_ms":225108,"significance":"If the main results are correct, the moment theorem is an elegant and surprisingly clean answer to a natural atomic-density question: the size of a uniformly random bounded atom in P_fin,0(N_0) is asymptotically binomial with parameters n and 1/2. This substantially refines the density results of Shitov and of Bienvenu-Geroldinger, and the almost-unimodality corollary is a valuable byproduct. The primal-element theorem is a natural analogue of Bienvenu-Geroldinger's absolute-irreducibility theorem and appears plausible. The paper is clearly organized and uses appropriate tools (Stirling estimates, entropy bounds, and concentration inequalities). However, the central probabilistic estimate in Theorem 5.2 has a missing union bound, and Theorem 5.4 relies on an unproved uniformity assertion; these gaps prevent the main asymptotic claims from being accepted as proved.","major_comments":[{"comment":"The estimate P(A in S_2) = O(n^{-1}) is not justified. The proof fixes a small factor B of size at most r with max B <= omega n, represents it by gaps b_1,...,b_r, and applies Lemma 5.1 to conclude that, for that fixed B, there are binom(n,epsilon n-1) O(n^{-1}) admissible A. But S_2 is the union over all such B, and the number of choices of B is Omega(n^r). A union bound therefore gives binom(n,epsilon n-1) O(n^{r-1}), not O(n^{-1}). Since r is chosen later to satisfy gamma > 2 epsilon^r, the factor n^{r-1} is not o(1). Consequently the asymptotic formula for alpha_{n,epsilon n} is not proved, and the later applications in Corollary 5.3 and Theorem 5.4 inherit this gap.","section":"§5.1, Theorem 5.2, Case 2"},{"comment":"The proof of Theorem 5.4 assumes that the convergence gamma_epsilon(n) -> 0 is uniform over epsilon in the interval [1/10,9/10]. The proof defines gamma(n) = max{gamma_epsilon(n) : epsilon in [1/10,9/10]} and asserts gamma(n) -> 0. Pointwise convergence for each fixed epsilon does not imply convergence of the supremum over a continuum, and the proof of Theorem 5.2 supplies constants that may depend on epsilon. A uniformity argument, or a strengthened version of Theorem 5.2 with error bounds valid uniformly on compact subintervals of (0,1), is needed. As written, the conclusion s_2(n) -> 0 is not established.","section":"§5.2, Theorem 5.4"},{"comment":"The algebraic identity used in the first display is incorrect. With j = k-1, the left side sum_{k=1}^{n+1} k^r binom(n,k-1) equals sum_{j=0}^n (j+1)^r binom(n,j) = 2^n E[(Y_n+1)^r], not 2 E[Y_n^r] (or the expression implied by the display). The proof should replace E[Y_n^r] by E[(Y_n+1)^r] and then use E[(Y_n+1)^r]/E[Y_n^r] -> 1 for fixed r. As it stands, the displayed equality is false and the subsequent expression for the limit needs correction.","section":"§5.2, proof of Theorem 5.4, first display"},{"comment":"The lower-bound construction for good sets is invalid when n is odd. In that case both S_0 and S_1 have cardinality 3, while the proof treats S_1,...,S_{floor(n/2)-1} as if each contributes exactly two elements. If S_1 is among the chosen indices, the constructed set has size k+1 rather than k, for both parities of k. Thus the claimed lower bound of binom(floor(n/2)-1, floor(k/2)-1) non-atoms of size k is not established. The theorem may still be true, but the supplied construction does not prove it.","section":"§4.2, Theorem 4.3"}],"minor_comments":[{"comment":"In the first display, the notation alpha_{n,r} should be alpha_{n,k}; the subscript is constant but should range over k.","section":"§5.2, proof of Theorem 5.4"},{"comment":"In the subcase max B >= omega n, the inclusion C subset [0,(1-omega)n/r] appears to be a typo; the correct bound is C subset [0,(1-omega)n], and the subsequent estimate should be adjusted accordingly.","section":"§5.1, proof of Theorem 5.2, Case 2"},{"comment":"The random variable is defined as X_n, but the probability mass function is written using P(X_{N,n} = k); the notation should be standardized.","section":"§5.2"}],"recommendation":"major_revision","confidential_remarks":"The paper appears to be a preliminary version from a collaborative project. The main results are likely true and the gaps are probably fixable, but the missing union bound in Theorem 5.2 is substantive and requires a real reworking of the proof, not merely cosmetic changes. The uniformity issue in Theorem 5.4 is also independent of the other gaps and needs an explicit argument. I recommend major revision rather than rejection, since the central claims are plausible and the paper's framework is promising."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things to know. The primality half is a clean, honest variation of Bienvenu-Geroldinger's theorem on absolute irreducibles, and I believe it is correct. The atomic-density half introduces a genuinely new partition of atoms by size and gets some nice explicit small cases, but the proof of the main asymptotic (Theorem 5.2) has a real gap, and the moment theorem (5.4) rests on it. As written, the central new results in Sections 4–5 are not proved.\n\nWhat the paper does well: the idea of partitioning A_n by cardinality is natural and overdue; the formulas for α_{n,3} and α_{n,4} are correct and pleasant; the probabilistic reformulation is a good way to think about atomic density; the paper is readable and engages seriously with Shitov and Bienvenu-Geroldinger. The primality part is a legitimate extension and the transfer from P_{fin,0}(N0) to general numerical monoids is handled sensibly.\n\nWhere it gets soft. Theorem 4.3 has a parity slip: for odd n, S_1 has three elements, so the binomial count of good sets of even size k is off. This is minor and fixable. Theorem 5.2 is the real problem. In Case 2, the authors fix one small factor B and apply Lemma 5.1 to get O(n^{-1}) probability for that B. But S_2 is the union over all B with |B| ≤ r and max B ≤ ωn, and there are O(n^r) such B. A union bound gives O(n^{r-1}), which does not decay since r is later chosen large. The claimed O(n^{-1}) bound on P(S_2) is therefore not justified. This is a load-bearing gap: the asymptotic formula for α_{n,k} and everything built on it, including the moment theorem, lacks proof. There is also a separate uniformity issue in Theorem 5.4, where the maximum of γ_ε(n) over a continuum is asserted to go to zero without an argument. I think both are fixable, but they need real work, not copy-editing.\n\nWho this is for: people working on factorization theory of power monoids and on Shitov-type density questions. The primality result can be cited now if you need it; I'd be cautious about citing the moment theorem until the proof is repaired.\n\nRecommendation: send it to a serious referee, but expect major revision. The referee should ask for a repaired Theorem 5.2, a uniform error bound in 5.4, and a fix for the parity case in 4.3.","headline":"Primality result is solid and clean; the atomic-density side has a genuine proof gap in the main asymptotic, so the paper needs major revision before the moment theorem can be trusted.","tokens_in":20067,"tokens_out":8696,"would_cite":false,"duration_ms":79511,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["13A05","11Y05","06F05"],"pacs":[],"model":"deepseek-v4-flash","headline":"The size of a uniformly random atom with maximum at most n has the same moments, asymptotically, as the number of heads in n fair coin flips.","keywords":["power monoid","restricted power monoid","atomic monoid","numerical monoid","atomic density","primal element","binomial moments"],"falsifier":"For $n$ up to a few thousand, exhaustively list all subsets $A = \\{0\\} \\cup B$ with $B \\subseteq \\{1,\\dots,n\\}$ and test atomicity by checking no factorization $A = C + D$ with $\\min(|C|,|D|) \\ge 2$; then compare the empirical moments of $|A|$ against those of $\\text{Bin}(n,1/2)$. If for some fixed $r$ the ratio $\\mathbb{E}(X_n^r)/\\mathbb{E}(Y_n^r)$ fails to tend to $1$, the main theorem is false. A sharper check targets the uniformity claim: compute $\\gamma_\\epsilon(n) = 1 - \\alpha_{n,\\epsilon n}/\\binom{n}{\\epsilon n - 1}$ over a fine grid of $\\epsilon \\in [0.1, 0.9]$ and verify that its maximum tends to $0$.","tokens_in":18927,"feed_emoji":"🎲","tokens_out":11462,"duration_ms":93175,"temperature":0.7,"pith_summary":"The paper establishes two groups of results about power monoids built from finite subsets of numerical monoids under the sumset operation. First, it proves that restricted numerical power monoids contain no primal elements — the algebraic analogue of primes introduced by Cohn — and that among unrestricted numerical power monoids the only one containing a primal element is $\\mathcal{P}_{\\text{fin}}(\\mathbb{N}_0)$, whose unique primal element is $\\{1\\}$. Second, it gives a precise asymptotic description of the atomic density of $\\mathcal{P}_{\\text{fin},0}(\\mathbb{N}_0)$ by partitioning its atoms into blocks $\\mathcal{A}_{n,k}$ of sets of size $k$ with maximum at most $n$. The paper shows that the number of atoms in each block is almost the number of all sets of that size, so the block counts form an almost unimodal sequence, and proves that for every fixed $r$ the $r$-th moment of the size of a uniformly random bounded atom matches the $r$-th moment of a $\\text{Bin}(n, 1/2)$ random variable asymptotically. A sympathetic reader would care because this turns a purely algebraic counting question into a probabilistic limit law: the sizes of atoms with bounded maximum behave, in every moment, like the number of heads in $n$ fair coin flips.","feed_headline":"Bounded atoms in power monoids match fair-coin moments","feed_subtitle":"The size of a uniformly random bounded atom matches the moments of n fair coin flips, turning an algebraic count into a simple limit law.","key_machinery":"The argument runs on the block decomposition $\\mathcal{A}_{n,k}$ and the counts $\\alpha_{n,k} = |\\mathcal{A}_{n,k}|$. The central identity is the asymptotic expansion $\\alpha_{n,\\epsilon n} = \\binom{n}{\\epsilon n - 1}(1 - \\gamma_\\epsilon(n))$ with $\\gamma_\\epsilon(n) = O(n^{-1})$, proved by bounding the number of sets $A = B + C$ that decompose with $\\min(|B|,|C|) \\ge 2$. The bound uses Shitov's coefficient-counting of pairs $(B,C)$ via the coefficients of $(1+x)^{2n}$, together with a Chebyshev concentration lemma that controls the number of random subsets of size $\\epsilon n$ admitting a factorization with a small summand. For the moment theorem, the paper writes $\\alpha_{n,k} = \\binom{n}{k-1} - \\beta_{n,k}$, splits the weighted error sum into the ranges $k < \\epsilon n$, $\\epsilon n \\le k \\le (1-\\epsilon)n$, and $k > (1-\\epsilon)n$, and shows each range contributes negligibly: the middle range by the claimed uniform decay of $\\gamma_\\epsilon(n)$, the tails by Hoeffding's inequality applied to the binomial moments. For the primal-element part, the key device is Lemma 3.4, which characterizes when $\\{0,a\\}$ divides a set $S$, and a descent argument based on representing intervals as sums of smaller intervals.","core_discovery":"On the paper's own terms, the central discovery is that atomicity in the restricted numerical power monoid $\\mathcal{P}_{\\text{fin},0}(\\mathbb{N}_0)$ is generic: for each fixed $\\epsilon \\in (0,1)$, the number $\\alpha_{n,\\epsilon n}$ of atoms of size $\\epsilon n$ with maximum at most $n$ satisfies $\\alpha_{n,\\epsilon n} = \\binom{n}{\\epsilon n - 1}(1 - \\gamma_\\epsilon(n))$ with $\\gamma_\\epsilon(n) = O(n^{-1})$. Since $\\binom{n}{\\epsilon n - 1}$ counts all subsets of $\\{1,\\dots,n\\}$ of size $\\epsilon n - 1$ together with $0$, this says that asymptotically almost every candidate set of the right size is an atom. Summing this identity over all $k$ shows the sequence $(\\alpha_{n,k})_k$ is unimodal in the sense that $\\alpha_{n,k} < \\alpha_{n,k+1}$ for $k < n/2$ and $\\alpha_{n,k} > \\alpha_{n,k+1}$ for $k > n/2$, with at most $o(n)$ exceptions. The paper then converts this into a moment statement: writing each $\\alpha_{n,k}$ as $\\binom{n}{k-1} - \\beta_{n,k}$, it shows the weighted error terms vanish, yielding $\\mathbb{E}(X_n^r)/\\mathbb{E}(Y_n^r) \\to 1$ for every fixed $r$, where $X_n$ chooses an atom of $\\mathcal{P}_{\\text{fin},0}(\\mathbb{N}_0)$ with maximum at most $n$ uniformly and returns its size, and $Y_n \\sim \\text{Bin}(n,1/2)$. The paper also proves the structural result that restricted numerical power monoids have no primal elements and the only unrestricted numerical power monoid with a primal element is $\\mathcal{P}_{\\text{fin}}(\\mathbb{N}_0)$, whose unique primal element is $\\{1\\}$.","pith_inferences":["The moment convergence for every fixed $r$ suggests, though the paper does not prove, full convergence in distribution of $X_n$ to $\\text{Bin}(n,1/2)$, for example in total variation distance or in the Kolmogorov metric.","The block-counting method may be portable to restricted power monoids of other numerical monoids $N$, where the density result $q_n \\to 1$ is already known; a natural test is whether the limiting size distribution of atoms with maximum at most $n$ is again binomial, possibly with parameter depending on $n$ and the Frobenius number of $N$.","The simultaneous absence of absolute irreducibles and primal elements in restricted numerical power monoids suggests these monoids are very far from being pre-Schreier; one might ask whether they contain primary elements, a weaker notion that the paper does not address."],"forward_implications":["For every fixed positive integer $r$, $\\mathbb{E}(X_n^r)/\\mathbb{E}(Y_n^r)$ tends to $1$, where $Y_n \\sim \\text{Bin}(n,1/2)$, so the size distribution of a uniformly random atom with maximum at most $n$ is asymptotically binomial in all moments.","The sequence $(\\alpha_{n,k})_{1\\le k \\le n+1}$ is increasing up to $k \\approx n/2$ and decreasing afterward, for all but $o(n)$ values of $k$; in particular it is unimodal on $n(1-o(1))$ indices.","The exact formulas $\\alpha_{n,3} = \\binom{n}{2} - \\lfloor n/2 \\rfloor$ and $\\alpha_{n,4} = \\binom{n}{3} - \\tfrac{1}{2}\\binom{n}{2} + \\tfrac{1}{2}\\lfloor n/2 \\rfloor$ hold for all $n$, so the first two nontrivial block sizes are known precisely.","Restricted numerical power monoids $\\mathcal{P}_{\\text{fin},0}(N)$ contain no primal elements, and the only numerical power monoid with any primal element is $\\mathcal{P}_{\\text{fin}}(\\mathbb{N}_0)$, whose unique primal element is $\\{1\\}$."],"supporting_citations":[{"why":"Supplies the motivating theorem on absolute irreducibles, the density result $|\\mathcal{A}_n|/|\\mathcal{P}_n| \\to 1$, and the concentration lemma adapted as Lemma 5.1.","marker":"[3]"},{"why":"Provides the Boolean-polynomial counting bound for decomposable sets and the asymptotic $\\alpha_n = 2^n(1-o(1))$ used to control non-atoms.","marker":"[16]"},{"why":"Establishes the power monoid construction and its unit-cancellative property, the framework the whole paper works in.","marker":"[7]"},{"why":"Introduces primal elements, the notion whose (almost) non-existence Theorem 3.5 establishes.","marker":"[4]"}],"fun_headline_variants":["Atom sizes in power monoids mimic fair coin flips","Bounded atoms: binomial moments, no primal elements","Fair-coin limit law for numerical power monoid atoms","Atomic density matches Bin(n,1/2) in power monoids","Power monoid atoms follow binomial distribution asymptotically"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The moment theorem depends on the error term $\\gamma_\\epsilon(n)$ in the block-counting estimate being not only $O(n^{-1})$ for each fixed $\\epsilon$ but also uniformly so over $\\epsilon \\in [0.1, 0.9]$; the proof chooses constants separately for each $\\epsilon$ and then takes a maximum over the continuum without supplying a uniformity argument.","fun_headline_variants_meta":{"raw":{"variants":["Atom sizes in power monoids mimic fair coin flips","Bounded atoms: binomial moments, no primal elements","Fair-coin limit law for numerical power monoid atoms","Atomic density matches Bin(n,1/2) in power monoids","Power monoid atoms follow binomial distribution asymptotically"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000291,"raw_usage":{"total_tokens":1980,"prompt_tokens":1506,"completion_tokens":474,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":1122,"completion_tokens_details":{"reasoning_tokens":393}},"tokens_in":1122,"tokens_out":474,"duration_ms":5273,"temperature":1.0,"reasoning_tokens":393,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T20:17:33.928874+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For $n$ up to a few thousand, exhaustively list all subsets $A = \\{0\\} \\cup B$ with $B \\subseteq \\{1,\\dots,n\\}$ and test atomicity by checking no factorization $A = C + D$ with $\\min(|C|,|D|) \\ge 2$; then compare the empirical moments of $|A|$ against those of $\\text{Bin}(n,1/2)$. If for some fixed $r$ the ratio $\\mathbb{E}(X_n^r)/\\mathbb{E}(Y_n^r)$ fails to tend to $1$, the main theorem is false. A sharper check targets the uniformity claim: compute $\\gamma_\\epsilon(n) = 1 - \\alpha_{n,\\epsilon n}/\\binom{n}{\\epsilon n - 1}$ over a fine grid of $\\epsilon \\in [0.1, 0.9]$ and verify that its maximum tends to $0$.","supporting_citations":[{"cited_title":"Shitov, How many boolean polynomials are irreducible? Int","cited_arxiv_id":null,"evidence_quote":"Provides the Boolean-polynomial counting bound for decomposable sets and the asymptotic $\\alpha_n = 2^n(1-o(1))$ used to control non-atoms."},{"cited_title":"Fan and S","cited_arxiv_id":null,"evidence_quote":"Establishes the power monoid construction and its unit-cancellative property, the framework the whole paper works in."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces primal elements, the notion whose (almost) non-existence Theorem 3.5 establishes."}],"review_version":1}