Vector-covering systems of arithmetic sequences

Previous | Up | Next

Article

Vector-covering systems of arithmetic sequences. (English). Czechoslovak Mathematical Journal, vol. 24 (1974), issue 3, pp. 455-461

References:

[1] Erdös P.: Egy kongruenciarendszerekröl szóló problémáról. Mat. Lapok 3 (1952) 122-128. MR 0070651

[2] Fraenkel A. S.: A characterization of exactly covering congruences. Discrete Mathematics (to appear). Zbl 0257.10003

[3] Novák В., Znám Š.: Remarks to the problem of exactly covering systems of arithmetic sequences. Amer. Math. Monthly 81 (1974) 42-45.

[4] Newman M.: Roots of unity and covering sets. Math. Ann. 191 (1971) 279-282. DOI 10.1007/BF01350330 | MR 0286763

[5] Porubský Š.: A generalization of some results for exactly covering systems. Mat. čas. 22 (1972) 208-215. MR 0308021

[6] Stein S. K.: Unions of arithmetic sequences. Math. Ann. 134 (1957-58) 289-294. MR 0093493

[7] Znám Š.: On exactly covering systems of arithmetic sequences. Math. Ann. 180 (1969) 227-232. DOI 10.1007/BF01350740 | MR 0242760

[8] Znám Š.: A simple characterization of disjoint covering systems. (submitted to Discrete Mathematics).

Partner of