On Infinite and Finite Covering Systems
A system \({\mathcal S}=\{b_ i \pmod {a_ i}:i\in I\}\) of arithmetic sequences that forms a partition of the set of all integers is called a disjoint covering system (DCS). A long standing open problem in the study of finite \((| I|<\infty)\) or infinite \((I\) is countably infinite) DCS's asks: given a multiset (copies of each element are allowed) \(A=\{a_ i: i\in I\}\) of moduli, determine if it is possible to find corresponding residues \(\{b_ i: i\in I\}\) so as to obtain a DCS. A clear necessary condition in the finite case is \(r(A):=\sum_{a\in A}1/a_ i=1\). In the infinite case one can only expect \(r(A)\leq 1\). A DCS is called saturated if \(r(A)=1\). The authors give a necessary condition for the multiset of moduli of a saturated DCS and show its relation to the hitherto known results in this direction.
- Infinite coverings of cages
- A contribution to infinite disjoint covering systems
- On Infinite Disjoint Covering Systems
- A Sofic System with Infinitely Many Minimal Covers
- Exact Covering Systems and the Gauss-Legendre Multiplication Formula for the Gamma Function
- Infinite covering systems of congruences which don’t exist
- scientific article; zbMATH DE number 7640035 (Why is no real title available?)
This page was built for publication: On Infinite and Finite Covering Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986357)
