Shisheng Li

collaborators

5 papers

math.CO2026

Asymptotics of the Tchoukaillon array and a conjecture of Beluhov

Shisheng Li

The Tchoukaillon array is an infinite array of the positive integers, arising from a one-row Mancala solitaire, in which each positive integer occurs exactly once. Its zeroth colum…

math.NT2026

Every natural number is a sum of distinct semiprime unit fractions

Shisheng Li

We prove that every natural number is a finite sum of distinct unit fractions whose denominators are semiprimes (products of two distinct primes). This is the $ω = 2$ integer case of…

math.CO2026

Nonexistence of Whirling-Knight Tours at Half Coil Count for $n \equiv 4, 6 (mod 8)$

Shisheng Li

A whirling knight's tour is a Hamiltonian cycle in the digraph of counter-clockwise knight steps about the centre of an $n \times n$ board; its coil count $c$ is the winding number…

math.CO2026

$SB (3, n)$ has no Hamiltonian cycle when $n$ is even: a sign-of-permutation proof, with extension to all odd $m \equiv 3 (mod 4)$

Shisheng Li

We resolve exercise 7.2.2.4--224 of Knuth's Pre-Fascicle 8a (10 April 2026 draft, rated [46]): the digraph $SB (3, n)$ has no Hamiltonian cycle when $n$ is even. The argumen…

cs.DS2026

A note on the parameter $ℓ$ in Buchbinder--Feldman's deterministic submodular matroid algorithm

Shisheng Li

Buchbinder and Feldman recently gave a deterministic $(1 - 1/ e - ε)$ -approximation for maximizing a non-negative monotone submodular function subject to a matroid constraint,…

Asymptotics of the Tchoukaillon array and a conjecture of Beluhov

Every natural number is a sum of distinct semiprime unit fractions

Nonexistence of Whirling-Knight Tours at Half Coil Count for n≡4,6(mod8)

SB(3,n) has no Hamiltonian cycle when n is even: a sign-of-permutation proof, with extension to all odd m≡3(mod4)

A note on the parameter ℓ in Buchbinder--Feldman's deterministic submodular matroid algorithm

Nonexistence of Whirling-Knight Tours at Half Coil Count for $n \equiv 4, 6 (mod 8)$

$SB (3, n)$ has no Hamiltonian cycle when $n$ is even: a sign-of-permutation proof, with extension to all odd $m \equiv 3 (mod 4)$

A note on the parameter $ℓ$ in Buchbinder--Feldman's deterministic submodular matroid algorithm