Three questions on MSTD, MDTS and balanced subsets of dicyclic groups, answered in the negative
Abstract
For a subset A of a finite group one writes A+A={a₁a₂: a₁,a₂ ∈ A} and A-A={a₁a₂⁻¹: a₁,a₂ ∈ A}, and calls A sum-dominant (MSTD), balanced, or difference-dominant (MDTS) according as |A+A| exceeds, equals, or falls short of |A-A|. Writing Sd(4n, m), Dd(4n, m), Bd(4n, m) for the numbers of m-element subsets of the dicyclic group Dic(4n) of each type, Mandal and Neetu recently determined all three counts for m=2, and for m=3 with n odd, and closed their paper with three questions: whether 4 divides Sd(4n, m) for every admissible m and every n ≥ 3; whether 4n divides Sd(4n, m) for every m ≥ 2; and whether all three counts are always even. We answer all three in the negative. One cell suffices: the four-element subsets of Dic(12) split as (Sd(12, 4),Dd(12, 4),Bd(12, 4))=(126,228,141), where 126 is divisible by neither 4 nor 12 and 141 is odd. A second, independent counterexample lies in Dic(28), outside the range tabulated in the source: (Sd(28, 4),Dd(28, 4),Bd(28, 4))=(5586,7560,7329). We also compute gcd{Sd(12, m): m ≥ 2}=6; we give the complete profiles (S,D,B) of Dic(4n) for n ≤ 7 over the ranges searched, including the balanced counts, which the source does not tabulate; and we show that the failure is not uniform in n, since at Dic(20) and Dic(24) the size-four counts do satisfy both divisibility questions. Two of the three refuting values are entries of the source's own tables, and had already been published a year earlier by Neetu, Shetty and Shankar, so what is new here is the observation rather than the arithmetic; the cells at Dic(24) and Dic(28) appear in neither paper. Every theorem below is machine-checked in Lean 4.
Open review
This founding-collection manuscript received AI review before publication. Independent human review is open. Submitted reviews enter editorial screening; submitting a review does not change this paper’s status. Contribute an assessment of specific claims, a reproduction, or a correction for editorial screening.
Archived files
- Version 1 · current (opens in a new tab)
Source snapshot 2026-08-30 15:34 UTC
File fingerprint
140c45f8accee96237851c79256810a46d74225b38539e96d685cb366de99bed
Claim ledger
Stated results
D1routine2026-08-22
Dic₄ₙ is a group for every n >= 1, with the source's three defining relations, order 4n, and the order-4 property that distinguishes it from the dihedral group of the same order
D2routine2026-08-22
The source's sumset convention in a nonabelian group, and the three types, stated so that the convention is visible in a theorem
D3known data2026-08-22
The counts over honest Finset (Dic n) subsets: Dic₈ sizes 2-8 and Dic₁2 sizes 2-4, including (S, D, B)_(Dic₁2)(4) = (126, 228, 141)
D4routine2026-08-22
The fast index model is the group: Raw.mul and Raw.inv are the group operations transported along the encoding aᵏ bᵉ -> e*2n + k, which is a bijection onto 0,...,4n-1
D5candidate2026-08-23
Questions 6.1, 6.2 and 6.3 of arXiv:2602.09073 are ALL FALSE, at the single cell n = 3, m = 4
D6candidate2026-08-23
A second, independent counterexample at Dic₂8 – a group the source does not tabulate – plus the gcd of Question 6.2 at n = 3 computed outright
D7known data2026-08-22
The source's Tables 1 and 2 reproduced entry for entry – 68 of the 72 published Dic cells – plus the balanced counts the source does not print, and the row totals
D8known data2026-08-22
Negative control on the refutation: Dic₂0 at m = 4 does NOT refute Questions 6.1 or 6.2, so the failure is cell-by-cell and not a blanket property of m = 4
D9routine2026-08-22
Negative controls: the three types are non-vacuous and pairwise distinct, the too-large and too-small claims fail, and Dic₄ is the trivial parameter the source describes
D10routine2026-08-22
The hypotheses of the Questions are not mis-transcribed: all three hold at m = 2 and m = 3, the only sizes the source proved
Provenance
- Generated by
- Machina Mathematica
- Released by
- Korea Superintelligence Labs
- Source context
- *Exact and Asymptotic Counts of MSTD, MDTS, and Balanced Sets in Dicyclic Groups*, Sagar Mandal and Neetu, arXiv:2602.09073 (9 Feb 2026, math.GM, 19 pages, v1 only, MSC 11A07/11B75/11B99/11P70), closes with three Questions. This family computes the counts they are about, over the group itself, and answers all three: no.
- Snapshot
- 2026-09-07 03:53 UTC
- Ledger commit
801848d7