Covers of product sets and the Korec-Znám result
A finite system \(\mathcal D\) of sets \(H_i\) of the form \(H_ i=\{n\in\mathbb{Z}: n\equiv a i \pmod{N_i}\}\) is called covering if every integer belongs to some \(H_i\). The number \(N_i\) is referred to as the modulus of \(H_i\). The system \(\mathcal D\) is called minimal covering if none of its proper subsystems is covering. Denote \(\operatorname{lcp}(\mathcal D)\) the least common multiple of the moduli \(N_i\). Further, for any natural \(k\) with canonical form \(k=\prod^{t}_{j=1}p_ j^{t_ j}\) put \(f(k)=\sum^t_{j=1}t_ j(p_t-1)+1.\) The main result is the following: Theorem. Any minimal covering systems \(\mathcal D\) must contain at least \(f(\operatorname{lcp}(\mathcal D))\) sets. This generalizes some results by I. Korec and the reviewer from 1974.
- Lattice parallelotopes and disjoint covering systems
- A group-theoretic approach to covering systems
- New results for covering systems of residue sets
- scientific article; zbMATH DE number 24314 (Why is no real title available?)
- scientific article; zbMATH DE number 1990002 (Why is no real title available?)
- scientific article; zbMATH DE number 3365349 (Why is no real title available?)
- On the minimal covering of infinite sets
- Irreducible disjoint covering systems (with an application to Boolean algebra)
- Prime covers and periodic patterns
This page was built for publication: Covers of product sets and the Korec-Znám result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103002)