Swee Hong Chan's Conjecture

Updated 7 July 2026

Swee Hong Chan's conjecture comprises two forms: arithmetic congruences for mock theta/Appell–Lerch sums and a combinatorial bijection for necklaces and periodic functions.
In the number-theoretic setting, explicit congruences for coefficients of Ramanujan’s sixth order mock theta function were conjectured and later proven with stronger modulo conditions.
The combinatorial version establishes a natural bijection between necklaces (cyclic words) and restricted multisets using coprimality and orbit normalization principles.

“Swee Hong Chan’s conjecture” denotes, in the arXiv literature provided here, a family of conjectural statements due to S. H. Chan rather than a single universally fixed proposition. The two most direct and internally coherent usages are number-theoretic and combinatorial. In the first, Chan conjectured explicit congruences for coefficients attached to Ramanujan’s sixth order mock theta function and to related Appell–Lerch sums; these conjectures were proved by Baruah and Begum, who also obtained stronger congruences. In the second, Chan conjectured a bijection between necklaces of length $n$ with at most $q$ colors and periodic functions $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ whose weighted sum is divisible by $n$ , under the coprimality hypothesis $\gcd(n,q)=1$ ; a 2025 paper presents a proof of this bijection (Baruah et al., 2018, Li et al., 26 Jul 2025).

1. Principal formulations

Within the supplied literature, the most direct formulations associated with S. H. Chan are as follows.

Context	Conjectural content	Resolution
Mock theta/Appell–Lerch sums	Congruences for $a(n)$ , $a_{1,10}(n)$ , and $a_{3,10}(n)$ in specified arithmetic progressions	Proved; stronger mod $125$ congruences also obtained
Necklaces and restricted multisets	A bijection for $\gcd(n,q)=1$ between necklaces and periodic functions with weighted sum divisible by $q$ 0	Proved

In the mock-theta setting, the basic coefficient sequence is defined by

$q$ 1

where $q$ 2 is Ramanujan’s function, identified in the paper as one of the sixth order mock theta functions. Chan had previously proved

$q$ 3

and conjectured stronger congruences modulo $q$ 4. He also conjectured congruences for coefficients of generalized Appell–Lerch sums $q$ 5 (Baruah et al., 2018).

In the necklace setting, the conjecture is stated as a bijection between necklaces of length $q$ 6 with at most $q$ 7 colors and periodic functions $q$ 8 whose weighted sum is divisible by $q$ 9, with the essential hypothesis

$f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 0

The 2025 paper is presented as a proof of this conjecture (Li et al., 26 Jul 2025).

2. Congruence conjectures for sixth order mock theta coefficients

The number-theoretic form of Chan’s conjecture arises from Ramanujan’s sixth order mock theta function $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 1 and related Appell–Lerch sums. The standard $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 2-Pochhammer notation is used: $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 3 and

$f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 4

The paper also adopts the shorthand $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 5 (Baruah et al., 2018).

Chan’s conjectured congruences for $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 6 are

$f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 7

These strengthen the previously established congruence modulo $f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 8,

$f:\mathbb Z_n\to\{0,1,\dots,q-1\}$ 9

The same paper also treats generalized Appell–Lerch sums $n$ 0, noting in particular that

$n$ 1

For these coefficients, Chan conjectured

$n$ 2

These statements place Chan’s conjecture in the arithmetic theory of mock theta functions, where the central phenomenon is congruence behavior in specific residue classes. The conjectures are explicit, progression-by-progression divisibility assertions rather than asymptotic or structural hypotheses.

3. Proof methods and arithmetic consequences

Baruah and Begum prove Chan’s congruences by deriving an exact generating function for the progression $n$ 3 in terms of $n$ 4-products, then reducing it modulo $n$ 5, applying

$n$ 6

and using Jacobi’s identity

$n$ 7

From coefficient extraction in residue classes $n$ 8, they obtain

$n$ 9

They then push the same generating-function method further to prove the new congruences

$\gcd(n,q)=1$ 0

These modulo $\gcd(n,q)=1$ 1 congruences are explicitly described as new (Baruah et al., 2018).

For $\gcd(n,q)=1$ 2 and $\gcd(n,q)=1$ 3, the proof begins from identities obtained from Qu–Wang–Yao’s general theorem and proceeds via Ramanujan’s general theta function

$\gcd(n,q)=1$ 4

together with the Jacobi triple product

$\gcd(n,q)=1$ 5

The argument also uses classical $\gcd(n,q)=1$ 6-dissections, $\gcd(n,q)=1$ 7-dissections of $\gcd(n,q)=1$ 8 and $\gcd(n,q)=1$ 9, product identities for the Rogers–Ramanujan continued fraction

$a(n)$ 0

and theta-function addition formulas. Extracting the $a(n)$ 1 terms and reducing modulo $a(n)$ 2 yields

$a(n)$ 3

The significance stated for these proofs is twofold. First, they provide exact $a(n)$ 4-product formulas for arithmetic progressions of mock theta coefficients, enabling congruence proofs in the style of Ramanujan’s partition congruences. Second, they extend the arithmetic theory of Appell–Lerch sums by exhibiting hidden modular structure in coefficient sequences that are not modular forms themselves but are closely related to mock modular forms (Baruah et al., 2018).

4. Necklace–restricted multiset formulation

A distinct conjecture of S. H. Chan concerns algebraic combinatorics. The 2025 paper titled “A Bijection between Necklaces and Restricted Multisets” states that it proves Chan’s conjecture establishing a bijection between the set of necklaces of length $a(n)$ 5 with at most $a(n)$ 6 colors and the set of periodic functions

$a(n)$ 7

whose weighted sum is divisible by $a(n)$ 8, where $a(n)$ 9 and $a_{1,10}(n)$ 0 are coprime positive integers (Li et al., 26 Jul 2025).

In the accompanying description, a necklace of length $a_{1,10}(n)$ 1 is interpreted as a cyclic word modulo rotation, and a periodic function $a_{1,10}(n)$ 2 is interpreted as an $a_{1,10}(n)$ 3-periodic sequence. The weighted-sum condition is described by

$a_{1,10}(n)$ 4

The same description also gives the multiset interpretation: $a_{1,10}(n)$ 5 may be viewed as a multiset on $a_{1,10}(n)$ 6 in which the element $a_{1,10}(n)$ 7 appears with multiplicity $a_{1,10}(n)$ 8, bounded by $a_{1,10}(n)$ 9. In this formulation, the divisibility condition becomes

$a_{3,10}(n)$ 0

This conjecture is qualitatively different from Chan’s Appell–Lerch congruences. It is bijective rather than divisibility-theoretic, and it links orbit spaces of cyclic group actions with modular weighted-sum constraints on bounded-multiplicity multisets.

5. Canonical representatives, coprimality, and orbit structure

The description attached to the necklace theorem presents a standard mechanism behind the bijection. One introduces the weighted-sum statistic

$a_{3,10}(n)$ 1

regards a necklace as an orbit of words under cyclic rotation, and then selects a canonical representative by imposing the normalization

$a_{3,10}(n)$ 2

This suggests an orbit-normalization principle: each cyclic orbit should contain a unique representative satisfying the divisibility condition (Li et al., 26 Jul 2025).

The arithmetic condition

$a_{3,10}(n)$ 3

is described as essential. The same description states that the coprimality is what makes the modular normalization work, because it guarantees the existence and uniqueness of the required rotation. In this sense, Chan’s conjecture is not merely an equinumerosity statement. Its content is the existence of a natural bijective representative-selection rule compatible with cyclic symmetry and modular weighted sums.

A plausible implication is that the theorem gives a combinatorial explanation for why necklaces are equinumerous with the weighted-sum-zero functions. In the reconstructed framework attached to the paper, this is the conceptual reason the conjecture is expressed as a bijection rather than as a counting identity alone.

The label “Swee Hong Chan’s conjecture” is not used uniformly across the supplied arXiv material. Some papers are directly about conjectures of S. H. Chan, while others are linked only by attribution in the prompt or by a conceptual analogy.

In “Proofs of Some Conjectures of Chan on Appell-Lerch Sums” the attribution is explicit and unambiguous: the paper proves conjectured congruences of Chan for coefficients of sixth order mock theta functions and generalized Appell–Lerch sums (Baruah et al., 2018). In “A Bijection between Necklaces and Restricted Multisets,” the abstract likewise explicitly presents a proof of Swee Hong Chan’s conjecture in the combinatorial setting (Li et al., 26 Jul 2025).

By contrast, “A Conjecture on Induced Subgraphs of Cayley Graphs” states a conjecture of Potechin–Tsang: for any Cayley graph $a_{3,10}(n)$ 4 and any subset $a_{3,10}(n)$ 5 with $a_{3,10}(n)$ 6, the induced subgraph $a_{3,10}(n)$ 7 has maximum degree at least $a_{3,10}(n)$ 8. The supplied description says that this conjecture is “attributed in the prompt to Swee Hong Chan’s conjecture,” while the paper itself proves the statement for abelian groups with the stronger bound

$a_{3,10}(n)$ 9

where $125$0 is the number of elements of $125$1 of order $125$2 (Potechin et al., 2020).

Similarly, “Proof of the Generalization of the Sawayama-Thébault Theorem” is described as proving two conjectures posed in 2016, but the supplied summary states that the paper itself does not explicitly name Swee Hong Chan. It proves a generalized Sawayama lemma and a generalized Sawayama–Thébault theorem in a Laguerre-geometric framework, with the fixed point identified as the incenter $125$3 of triangle $125$4 (Płatek, 19 Mar 2026).

Finally, “Phase shifts vs time delays: Sagnac and Hong-Ou-Mandel” does not formulate a conjecture of Chan. The supplied description instead presents it as offering a conceptual link: the paper argues that the Sagnac effect is fundamentally a time delay

$125$5

and that Hong–Ou–Mandel interference is insensitive to constant phase shifts but sensitive to time delays, thereby operationalizing the timing-based character of the effect (Enk, 2011).

The most stable usage of the phrase therefore remains the pair of Chan-originating problems in $125$6-series arithmetic and bijective combinatorics. In those settings, “Swee Hong Chan’s conjecture” refers to precise statements that have now been proved: explicit congruences for mock-theta/Appell–Lerch coefficients and a bijection between necklaces and restricted multisets under a coprimality hypothesis.