2025/01/20 by Oliver Tan, Tan, Oliver
Computer Science · Engineering · #05A05 #05A15 #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.2501.11386
openalex publication_date 2025/01/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper proves the minimum size of a supersequence over a set of eight elements is 52. This disproves a conjecture that the lower bound of the supersequence is the partial sum of the geometric Connell sequence. By studying the internal distribution of individual elements within sub-strings of the supersequence called segments, the proof provides important results on the internal structure that could help to understand the general lower bound problem for finite sets.