Irreducible disjoint covering systems (with an application to Boolean algebra)

DOI10.1016/0166-218X(90)90140-8zbMath0729.11006MaRDI QIDQ805651

Aviezri S. Fraenkel, Alexander Felzenbaum, Marc A. Berger

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean algebra; arithmetic progression; tautologies; algebra of cosets; disjoint covering systems of cosets; lattice geometry approach; lattice parallelotope; number of clauses

Mathematics Subject Classification ID

11A07: Congruences; primitive roots; residue systems

52C99: Discrete geometry

11B25: Arithmetic progressions

03G05: Logical aspects of Boolean algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding hypergraph 2-colourability by H-resolution
• A non-analytic proof of the Newman-Znám result for disjoint covering systems
• Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
• Improvement of Mycielski's inequality for non-natural disjoint covering systems of \({\mathbb{Z}}\)
• Covers of product sets and the Korec-Znám result
• Irreducible disjoint covering systems
• New results for covering systems of residue sets
• Remark on the multiplicity of a partition of a group into cosets
• Mycielski-Sierpiński conjecture and Korec-Znám result
• Natural exactly covering systems of congruences
• On a generalization of Mycielski's and Znám's conjectures about coset decomposition of Abelian groups