2017/08/28 by S. Gill Williamson, Williamson, S. Gill · 1 citation
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #Logic (math.LO) #graph theory and CDMA systems #math.CO #math.LO
paper · pdf · doi:10.48550/arxiv.1708.08186
arxiv created 2017/08/28 · openalex publication_date 2017/08/28 · arxiv updated 2017/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study recursively defined functions associated with directed graphs on the k dimensional nonnegative integral lattice. The existence of certain combinatorial structures associated with these function classes are shown to be independent of the ZFC axioms of mathematics. These structures, in a natural way, give rise to sets of instances to the subset sum problem. We use this connection to make some observations about ZFC independence and the subset sum problem.