{"id":"0fe7b44f-5385-4372-a625-075890481c9a","arxiv_id":"1908.00613","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For each r from 2 to 15, the full list of finite permutation groups with exactly n+r set-orbits is determined and tabulated.","lead":"This paper classifies the finite permutation groups that have only n+r orbits when acting on all subsets of an n-element set, for r = 2 through 15. It combines transitivity theorems with GAP computations and prints complete tables of the groups.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Completeness for r=13-15 is asserted but not demonstrated: the needed elimination is left to a 'very similar' process, and the stated n<=81 bound is not justified.","rationale":"The reader's weakest assumption identifies the same load-bearing issue: completeness for r=13-15 is delegated to an unshown 'similar' process and to external GAP code without a version hash. My independent reading confirms this. I add one concrete supporting observation: the proof of Corollary 2.8, which is supposed to justify the initial bound n<=81 in Step 0, is logically insufficient. For n=82 the same k0=7 only forces at least 14 extra set-orbits, and a group with r=15 would have exactly 15 extra orbits, so no contradiction follows. This does not prove the classification wrong; it shows that the missing computations are real and consequential, not mere exposition. The paper is otherwise coherent: the hand-checkable r=2-5 cases follow the stated framework, Lemma 2.10 and Lemma 2.11 give valid lower bounds, and no internal mathematical contradiction is apparent. Therefore the appropriate verdict remains CONDITIONAL: the classification should be accepted only after the r=13-15 pipeline is reproduced or the missing elimination arguments are supplied. No change to the reader's verdict is needed.","tokens_in":12520,"tokens_out":18065,"duration_ms":175609,"concrete_test":"Obtain the GAP code from reference [8]; if it is not available, implement it independently. For each of r=13,14,15, run the full pipeline: apply Step 1 (prime elimination) and Step 2 (Miller's method) to determine the surviving degrees n; for each surviving n, enumerate all subgroups of S_n for n<=11 and use the GAP transitive/primitive libraries plus Lemmas 2.10 and 2.11 for n>=12; compute s(G) for every candidate; and compare the resulting groups exactly with the corresponding table. If the script reproduces the tables and includes a check that no other degree or group survives, the completeness claim is supported; if it does not, the classification is incomplete as stated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that for every 2<=r<=15 the published tables exhaust all groups with s(G)=n+r. For r=12 the paper gives a real elimination argument, but for r=13,14,15 it says only that the process 'will be very similar' (Section 4, Remaining Computations) and then lists tables. No surviving-degree lists, no intransitive/imprimitive exclusions, and no certificate of exhaustive search are provided for these three values. Consequently the completeness of those tables is currently not checkable from the paper. A concrete symptom that the missing arguments are not automatic is Corollary 2.8: the proof claims n<=81 from the first applicable k0=7, but for n=82 the same k0=7 yields only 14 extra set-orbits, which is compatible with r=15; so the stated initial bound is not established by the given reasoning. The GAP code in [8] is the only external check, and no version/hash is recorded.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the natural action of a permutation group G ≤ S_n on the power set of an n-element set and classifies, for 2 ≤ r ≤ 15, all groups G with exactly n + r set-orbits. The method combines a theoretical bound on the degree n (Corollary 2.8 and Step 0), elimination of intransitive and imprimitive groups via Lemmas 2.10 and 2.11, classification of primitive groups using GAP's primitive-group library, and enumeration of subgroups of S_n for small n. The authors present hand-worked classifications for r = 2, 3, 4, 5 and computer-assisted tables for r = 6 through 15, together with a brief discussion of the r = 12 elimination and a statement that r = 13, 14, 15 follow 'very similarly'.","tokens_in":12659,"tokens_out":7521,"duration_ms":69544,"significance":"If the classification tables are complete, this is a substantial extension of the Beaumont–Peterson classification of set-transitive groups and of Kantor's work on k-set-transitive groups. The paper also contributes a general template (Step 0 through Step 4) that could in principle be applied to larger r. A notable strength is that the theoretical reductions use standard results (Livingstone–Wagner, Breusch, Beaumont–Peterson) and that the tables give explicit groups, orders, and GAP identifiers, making the claims concrete and falsifiable. However, the completeness of the central claim depends on computational work that is not fully reproducible from the manuscript, and one of the stated degree bounds is not justified by the argument given.","major_comments":[{"comment":"The completeness of the classification for r = 13, 14, 15 is asserted but not demonstrated. Section 4 states that 'the process will be very similar' and then immediately lists tables; no surviving-degree lists, no intransitive/imprimitive elimination details, and no exhaustive-search certificate are supplied for these three values. Since the central claim of the paper is that the tables are exhaustive for every r ≤ 15, this is a load-bearing gap, not a presentation issue.","section":"§4, 'Remaining Computations' and §5"},{"comment":"The stated bound n ≤ 81 for groups with s(G) < n + 16 is not established by the reasoning in the text. The argument notes that n = 81 yields k0 = 7 and says this gives 'at least 14 additional set-orbits', but 14 additional orbits is compatible with s(G) = n + 15, i.e. with r = 15. To exclude n > 81 one needs at least 15 additional orbits (or a separate argument); no such argument appears. In particular, the statement that 'for any reasonable r, say r < 16, we know that n ≤ 81' is not justified by Theorem 2.7 as used.","section":"§2, Corollary 2.8, and §3, Step 0"},{"comment":"For r = 12 the paper works out the elimination only for n = 12, saying other possible n values 'can be checked in a similar way.' Since the intended range of n is not explicitly listed, and since Lemmas 2.10 and 2.11 provide lower bounds that must be individually compared with n + r, the reader cannot verify that all intransitive and imprimitive degrees in the relevant range are eliminated. The same concern applies a fortiori to r = 13, 14, 15.","section":"§4, 'Remaining Computations'"},{"comment":"The classification relies on GAP computations that are not included in the paper or in an appendable artifact. Reference [8] is an external URL with no version identifier, hash, or log of the computation, and no machine-checked certificate is provided. For a computational classification with completeness as the main claim, the absence of a reproducible and auditable computation makes the result unverifiable as currently presented.","section":"§5 and reference [8]"}],"minor_comments":[{"comment":"In the proof of Corollary 2.6, 'If G is even' should read 'If n is even'; the current wording is a typographical slip that could confuse readers.","section":"§2, Corollary 2.6 proof"},{"comment":"The phrase 'the primitive groups on 8, 10, 12 letters that whose order is divisible by 28, 120, 495' contains a redundant 'that whose'; the intended meaning is clear but the sentence should be rewritten.","section":"§4, r = 4 paragraph"},{"comment":"The tables list entries such as '12 A11' and '13 A12' without comment; these are presumably point stabilizers of A11 in S12 and A12 in S13, but this should be stated explicitly because it aids the reader in checking the table against the definition of degree n.","section":"§4, tables for r = 12 and r = 13"},{"comment":"Reference [7] is a URL rather than a stable bibliographic entry; if the transitive-group structures are being cited, a more permanent source (such as the GAP small-groups library or Butler–McKay tables) should be given.","section":"References"}],"recommendation":"major_revision","confidential_remarks":"The mathematical idea and the hand-checked parts of the classification are plausible and worth publishing, but the completeness claims for r = 13–15 and even r = 12 outside n = 12 are currently not verifiable. I would like the authors to supply either full elimination arguments, a complete log of the GAP computation, or an electronically appended certified artifact; with that, the paper could be suitable for publication. The current treatment of Corollary 2.8 also needs correction because the bound n ≤ 81 is not proved as written."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The genuinely new thing here is the tables: for each r=2..15, the authors list the permutation groups on n letters with exactly n+r set-orbits. That is a real extension of the Beaumont-Peterson set-transitive classification (r=1). The method is a sensible combination of classical transitivity bounds (Livingstone-Wagner, a Breusch prime-gap argument) and GAP enumeration. The r=2..5 cases are worked out in enough detail to follow, and the r=12 elimination is a good model for how the reduction should go. The paper reads as an honest computational classification, not a fitted or self-referential result.\n\nThe main problem is that completeness for r=13,14,15 is asserted, not demonstrated. The text says the process 'will be very similar' to the r=12 case and then lists the tables. That is not checkable from the paper. A referee cannot verify that no intransitive or imprimitive group survives without the case breakdown, the actual code, or some certificate. The GAP code is on an external page with no version or hash, so the computation is not reproducible as given.\n\nThere is also a concrete gap in the stated n-bound. Corollary 2.8 claims that a group not containing A_n with fewer than n+16 set-orbits must have n<=81. The proof relies on n=81 giving k0=7 and 'at least 14 additional set-orbits'. But for n=83 odd, the same k0=7 forces at least 14 additional set-orbits, which is compatible with n+15 orbits (r=15). So the displayed reasoning does not eliminate n=83 or other larger n. The bound may be true, but it is not proven here, and the classification depends on it via Step 0.\n\nMinor: one citation looks incorrect—[12] is the von Neumann-Morgenstern game theory book, not a 1944 permutation group paper. The attribution elsewhere is generally careful.\n\nIf the authors supply the missing elimination details for r=13-15, correct the k0 argument (or verify n>81 separately), and give a versioned copy of the GAP code, I would take this as a solid computational theorem. As it stands, it is a promising but incomplete manuscript: the central classification is plausible, but the completeness claims are not yet independently verifiable. I would send it to a serious referee, expecting a major revision rather than acceptance as-is.","headline":"New classification tables for the n+r set-orbit problem (r=2..15), but completeness for r=13-15 is delegated to unshown computation and the n<=81 bound in Corollary 2.8 is not established as written.","tokens_in":13184,"tokens_out":7397,"would_cite":true,"duration_ms":64044,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20B05","20B15","20B40"],"pacs":[],"model":"deepseek-v4-flash","headline":"Every permutation group whose powerset action has exactly n+r orbits is classified for 2≤r≤15.","keywords":["set-orbits","permutation groups","power set action","set-transitive groups","classification","GAP computation","finite group actions","transitivity"],"falsifier":"Run the published GAP code independently and compare its output with the tables; any group whose computed $s(G)$ equals $n+r$ but is absent from the tables, or any listed group whose recomputed $s(G)$ differs from $n+r$, would falsify the completeness claim. A direct first check is to recompute $s(G)$ for every listed group from its generators and verify the table value.","tokens_in":12315,"feed_emoji":"🔢","tokens_out":11520,"duration_ms":108246,"temperature":0.7,"pith_summary":"This paper asks which permutation groups on an $n$-element set split the collection of all subsets into as few pieces as possible. It develops a general reduction method and applies it to give a complete classification for every $r$ with $2 \\le r \\le 15$: the groups with exactly $n+r$ set-orbits are listed, by degree, order, and identifying code. The case $r=1$ was already known (the set-transitive groups), so the paper extends the known boundary from the most symmetrical groups to the next several levels of symmetry. A complete classification matters because the number of set-orbits is a coarse, natural measure of how much symmetry a permutation group has, and no classification beyond the set-transitive case had been settled.","feed_headline":"All permutation groups with n+r set-orbits are now known, r≤15","feed_subtitle":"A complete list, extending the known r=1 case, with degrees bounded by 81 for every r up to 15.","key_machinery":"The central object is the set-orbit: an orbit of $G$ on the collection of all subsets of $\\{1,\\dots,n\\}$, with $s(G)$ counting all such orbits. The argument is carried by a chain of reductions. A monotonicity theorem, saying that for $t\\le n/2$ the number of $t$-set-orbits never decreases as $t$ increases, turns a small number of orbits at one cardinality into a cascade of forced orbits. A prime-gap estimate (a prime always exists between $x$ and $9x/8$ for $x\\ge 48$) is used with a transitivity bound to show that, for $r<16$, a group not containing the alternating group must have degree $n\\le 81$. Parity constraints, together with lower bounds for intransitive and imprimitive groups in terms of orbit products and binomial coefficients, eliminate most degrees and force surviving candidates to be transitive or primitive. Finally, divisibility of $|G|$ by binomial coefficients, followed by a GAP computation over all remaining transitive and primitive groups, yields the tables.","core_discovery":"For each integer $r$ with $2\\le r\\le 15$, the paper claims to have determined every permutation group $G \\subseteq S_n$ whose induced action on the power set $\\mathscr{P}(\\{1,\\dots,n\\})$ has exactly $s(G)=n+r$ orbits. The answer is a finite list for each $r$, tabulated with the degree, order, and a GAP identifier; for $r=12$ through $15$ the elimination of intransitive and imprimitive groups is described (in detail for $r=12$) and the remaining cases are computed. The classification is exhaustive in the sense that any group with $n+r$ set-orbits appears in the corresponding table, and no group outside the table has that count. This extends the classical $r=1$ classification of set-transitive groups.","pith_inferences":["The tables reveal a family the paper does not isolate: for $r=n$, the groups $S_{n-1}$ and $A_{n-1}$ acting on $n$ points with one fixed point have exactly $2n=n+r$ set-orbits, so any classification for unrestricted $r$ must contain this family for every $n$.","Because the expensive step is enumerating all subgroups of $S_n$ for $n\\ge 12$, a classification beyond $r=15$ would likely advance most by a theoretical treatment of intransitive and imprimitive groups, not by faster orbit-counting.","The parity and monotonicity constraints appear to be the main force fixing small $r$: for large $n$ they rule out most degrees before any group-specific computation is needed, which is why the tables contain mostly small degrees."],"forward_implications":["For every $r$ from $2$ to $15$, the tables are exhaustive: no permutation group outside the listed ones has exactly $n+r$ set-orbits.","The reduction method is reusable: for any fixed $r$ it bounds $n$, eliminates intransitive and imprimitive groups, and reduces the check to transitive and primitive candidates, so larger $r$ can be attempted by the same route.","If $G$ does not contain the alternating group and has fewer than $n+16$ set-orbits, then $n\\le 81$, so the whole classification problem for small $r$ is finite and bounded.","The $r=1$ case is included as the base of the same framework, so the set-transitive classification and its near neighbours are treated uniformly."],"supporting_citations":[{"why":"Supplies the base case $r=1$ (set-transitive groups) and elementary facts such as $s_t(G)=s_{n-t}(G)$ and primitivity of set-transitive subgroups.","marker":"[2]"},{"why":"Supplies the monotonicity inequality $s_{t-1}(G)\\le s_t(G)$ used throughout to force many set-orbits.","marker":"[10]"},{"why":"The computer algebra system used to compute $s(G)$ for the surviving candidate groups.","marker":"[6]"},{"why":"The authors' GAP code; the completeness of the $r\\le 15$ classification depends on this enumeration.","marker":"[8]"},{"why":"Supplies the lemmas bounding $s(G)$ for intransitive groups (a product lower bound over orbits) and the index inequality used to eliminate imprimitive candidates.","marker":"[1]"},{"why":"Supplies the transitivity bound from a degree decomposition used in Step 2 to rule out many degrees.","marker":"[11]"},{"why":"Supplies the prime-gap estimate (a prime between $x$ and $9x/8$ for $x\\ge48$) used to bound possible degrees by 81.","marker":"[3]"},{"why":"Supplies the classical bound that a group not containing $A_n$ is at most $(n/3+1)$-transitive, used in the main elimination.","marker":"[4]"},{"why":"Supplies the database of transitive groups whose orders satisfy the divisibility checks during the final enumeration.","marker":"[7]"}],"fun_headline_variants":["All permutation groups with n+r set-orbits classified for r≤15","Set-orbit classification extended: all groups with r=2..15 determined","New classification: permutation groups with few power-set orbits","Finite permutation groups with n+r set-orbits fully determined for r≤15","Classification of set-orbits complete for r up to 15"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The classification is complete only if the published elimination lemmas and the GAP code together cover every intransitive, imprimitive, transitive, and primitive group for each $r\\le 15$; for $r=13,14,15$ the paper outlines the elimination by analogy with the detailed $r=12$ case rather than writing it out.","fun_headline_variants_meta":{"raw":{"variants":["All permutation groups with n+r set-orbits classified for r≤15","Set-orbit classification extended: all groups with r=2..15 determined","New classification: permutation groups with few power-set orbits","Finite permutation groups with n+r set-orbits fully determined for r≤15","Classification of set-orbits complete for r up to 15"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00088,"raw_usage":{"total_tokens":3745,"prompt_tokens":826,"completion_tokens":2919,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":442,"completion_tokens_details":{"reasoning_tokens":2833}},"tokens_in":442,"tokens_out":2919,"duration_ms":21310,"temperature":1.0,"reasoning_tokens":2833,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:43:57.618567+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the published GAP code independently and compare its output with the tables; any group whose computed $s(G)$ equals $n+r$ but is absent from the tables, or any listed group whose recomputed $s(G)$ differs from $n+r$, would falsify the completeness claim. A direct first check is to recompute $s(G)$ for every listed group from its generators and verify the table value.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the base case $r=1$ (set-transitive groups) and elementary facts such as $s_t(G)=s_{n-t}(G)$ and primitivity of set-transitive subgroups."},{"cited_title":"Livingstone and A","cited_arxiv_id":null,"evidence_quote":"Supplies the monotonicity inequality $s_{t-1}(G)\\le s_t(G)$ used throughout to force many set-orbits."},{"cited_title":"(https://www.gap-system.org)","cited_arxiv_id":null,"evidence_quote":"The computer algebra system used to compute $s(G)$ for the surviving candidate groups."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"The authors' GAP code; the completeness of the $r\\le 15$ classification depends on this enumeration."},{"cited_title":"Babai and L","cited_arxiv_id":null,"evidence_quote":"Supplies the lemmas bounding $s(G)$ for intransitive groups (a product lower bound over orbits) and the index inequality used to eliminate imprimitive candidates."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the transitivity bound from a degree decomposition used in Step 2 to rule out many degrees."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the prime-gap estimate (a prime between $x$ and $9x/8$ for $x\\ge48$) used to bound possible degrees by 81."},{"cited_title":"Burnside, Theory of Groups , Cambridge, 1897","cited_arxiv_id":null,"evidence_quote":"Supplies the classical bound that a group not containing $A_n$ is at most $(n/3+1)$-transitive, used in the main elimination."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the database of transitive groups whose orders satisfy the divisibility checks during the final enumeration."}],"review_version":1}