Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Discrepancies of Hypergraphs of High Kolmogorov Complexity

Willem L. Fouché 1
1Department of Quantitative Management, University of South Africa, PO Box 392, 0003 Pretoria, South Africa
  • Published: 31/05/2000

Abstract

We study the discrepancies of set systems whose incidence matrices are encoded by binary strings which are complex in the sense of Kolmogorov-Chaitin. We show that these systems display an optimal degree of irregularity of distribution.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Willem L. Fouché . Discrepancies of Hypergraphs of High Kolmogorov Complexity[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 033. 199-207. DOI: .