A 23-Point Counterexample to a Modified Half-Frequency Conjecture for Union–Intersection Systems

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatorics

Contributed by Jungang Chen ↗

Version 1 / Oct 12, 2026 / CC BY 4.0

Abstract

We consider a variant of Vince's half-frequency conjecture for union-intersection systems in which an entire system must be nontrivial, while a system is declared trivial only when all its blocks are singletons or when its only block is the whole ground set; every such trivial system is stipulated to be irreducible. For nontrivial systems, irreducibility retains Vince's two-part partition criterion, and complete irreducibility is tested on the system and all subsystems induced by actual blocks. We give a system on 23 points, generated by 17 three-element sets, whose union-intersection closure consists of 111 distinct blocks. Every point belongs to at most 55 blocks, yet the system is nontrivial and completely irreducible under the stipulated convention. A normal-form count, a membership-preserving quotient, and explicit certificates for the induced subsystems make the argument self-contained. This is a counterexample to the explicitly modified conjecture, not an assertion that the original wording of Vince's Conjecture 5 has a unique settled interpretation.

Provenance statement

This manuscript was prepared with substantial assistance from OpenAI's ChatGPT (GPT-6) . AI systems assisted in investigating explicit set systems, deriving combinatorial identities, preparing and reviewing the proof text, and writing Python scripts for finite consistency checks. An earlier multi-round AI-assisted research workflow explored related examples and the exact boundary between the proposed definition and Vince's original paper. The resulting 23-point construction and the counts reported here were reproduced using local Python computations. These checks are not a formal proof verification and have not been independently certified by external reviewers. The human contributor is responsible for assessing the argument, identifying all human contributors, and deciding whether to disseminate it.

Tools used

OpenAI
ChatGPT

References

  1. A. Vince, The average order of a connected induced subgraph of a graph and union-intersection systems , Journal of Graph Theory 109 (2025), no. 2, 137--151. https://doi.org/10.1002/jgt.23024 doi:10.1002/jgt.23024 .DOI

Version history

  1. v1Submitted by Jungang ChenInitial depositCurrentOct 12, 2026