ZFC independence and subset sum
Combinatorics
2017-08-29 v1 Logic
Abstract
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.
Cite
@article{arxiv.1708.08186,
title = {ZFC independence and subset sum},
author = {S. Gill Williamson},
journal= {arXiv preprint arXiv:1708.08186},
year = {2017}
}