References
- Bellman, R. (1997). Matrix Analysis. Philadelphia, PA: S.I.A.M. Press.
- Berger, M. A., Felzenbaum, A., Fraenkel, A. S. (1985). Improvements to two results concerning systems of residue sets. Ars. Combin. 20:69–82.
- Berger, M. A., Felzenbaum, A., Fraenkel, A. S. (1986). The Herzog–Schönheim conjecture for finite nilpotent groups. Can. Math. Bull. 29(3):329–333. DOI: 10.4153/CMB-1986-050-0.
- Berger, M. A., Felzenbaum, A., Fraenkel, A. S. (1987). Lattice parallelotopes and disjoint covering systems. Discrete Math. 65(1):23–44. DOI: 10.1016/0012-365X(87)90208-1.
- Berger, M. A., Felzenbaum, A., Fraenkel, A. S. (1987). Remark on the multiplicity of a partition of a group into cosets. Fund. Math. 128(3):139–144. DOI: 10.4064/fm-128-3-139-144.
- Brodie, M. A., Chamberlain, R. F., Kappe, L. C. (1988). Finite coverings by normal subgroups. Proc. Amer. Math. Soc. 104(3):669–674. DOI: 10.1090/S0002-9939-1988-0964841-9.
- Chouraqui, F. (2019). The Herzog–Schönheim conjecture for finitely generated groups. Int. J. Algebra Comput. 29(06):1083–1112. DOI: 10.1142/S0218196719500425.
- Chouraqui, F. About an Extension of the Davenport-Rado Result to the Herzog-Schönheim Conjecture for Free Groups. ArXiv 1901.09898. To appear in Advances in group theory and applications.
- Chouraqui, F. (2020). An approach to the Herzog-Schönheim conjecture using Automata. Developments in Language Theory 2020, Lecture Notes in Computer Sciences 12086. Switzerland: Springer-Verlag, pp. 55–68.
- Chouraqui, F. The space of coset partitions of Fn and Herzog–Schönheim conjecture. ArXiv 1804.11103.
- Epstein, D. B. A., Cannon, J. W., Holt, D. F., Levy, S. V. F., Paterson, M. S., Thurston, W. P. (1992). Word Processing in Groups. Boston: Jones and Bartlett Books.
- Epstein, D. B. A., Iano-Fletcher, A. R., Zwick, U. (1996). Growth functions and automatic groups. Experimental Math. 5(4):297–315.
- Erdős, P. (1952). Egy kongruenciarenslszerekről szóló problémáról. Matematikai Lapok. 4:122–128.
- Erdős, P. (1950). On integers of the form 2k+p and some related problems. Summa Brasil. Math. 2:113–123.
- Erdős, P. (1981). Problems and results in Number theory. Recent Progress in Analytic Number Theory, vol. 1. London: Academic Press, pp. 1–13.
- Flajolet, P., Sedgewick, R. (2009). Analytic Combinatorics. United Kingdom: Cambridge University Press.
- Ginosar, Y. (2018). Tile the group. Elem. Math. 73(2):66–73. DOI: 10.4171/EM/354.
- Ginosar, Y., Schnabel, O. (2011). Prime factorization conditions providing multiplicities in coset partitions of groups. J. Comb. Number Theory. 3(2):75–86.
- Herzog, M., Schönheim, J. (1974). Research problem no. 9. Canad. Math. Bull. 17:150.
- Karlin, S., Taylor, H. (1975). A first course in stochastic processes, second ed. New York: Academic Press.
- I. Korec, Š. ZnáM, (1977). On disjoint covering of groups by their cosets. Math. Slovaca. 27:3–7.
- Lam, T., Leung, K. (2000). On vanishing sums of roots of unity. J. Algebra 224(1):91–109. DOI: 10.1006/jabr.1999.8089.
- Lenstra, H. W. Jr., (1979). Vanishing sums of roots of unity. Math Centre Tracts. 101:249–268.
- Mann, H. B. (1965). On linear relations between roots of unity. Mathematika 12(2):107–117. DOI: 10.1112/S0025579300005210.
- Margolis, L., Schnabel, O. (2018). The Herzog–Schönheim conjecture for small groups and harmonic subgroups. Beitr. Algebra Geom. 60(3):399–418.
- Meier, C. D. (2010). Matrix analysis and applied linear algebra. Philadelphia: SIAM Press.
- Newman, M. (1971). Roots of unity and covering sets. Math. Ann. 191(4):279–282. DOI: 10.1007/BF01350330.
- NováK, B., Š. Znám (1974). Disjoint covering systems. Amer. Math. Monthly. 81:42–45.
- Pin, J. E. (1992). On Reversible Automata, Lecture Notes in Computer Science 583. Switzerland: Springer. pp. 401–416.
- Pin, J. E. Mathematical foundations of automata theory. https://www.irif.fr/jep/PDF/MPRI/MPRI.pdf.
- Porubsky, Š. (1974). Natural exactly covering systems of congruences. Czechoslovak Math. J. 24:598–606.
- Porubsky, Š. (1975). Covering systems and generating functions. Acta Arith. 26(3):223–231. n
- Porubsky, Š. (1981). Results and problems on covering systems of residue classes. Mitt. Math. Sem. Giessen. 150(1981):1–85.
- Porubsky, Š., Schönheim, J., (2002). Covering systems of Paul Erdős. Past, present and future. Paul Erdős and his mathematics. JáNos Bolyai Math. Soc. 11:581–627.
- Schoenberg, I.. J. (1964). A note on the cyclotomic polynomial. Mathematika. 11(2):131–136. DOI: 10.1112/S0025579300004344.
- Sims, C. C. (1994). Computation with finitely presented groups. Encyclopedia of Mathematics and Its Applications 48. United Kingdom: Cambridge University Press
- Stanley, R. P. (1986). Enumerative Combinatorics. Monterey, CA: Wadsworth and Brooks/Cole.
- Stillwell, J. (1980). Classical Topology and Combinatorial Group Theory, Graduate Texts in Mathematics 72. Berlin: Springer-Verlag.
- Sun, Z. W. (2006). Finite covers of groups by cosets or subgroups. Int. J. Math. 17(09):1047–1064. DOI: 10.1142/S0129167X06003813.
- Sun, Z. W. (1991). An improvement of the Znám–Newman result. Chinese Quart. J. Math. 6(3):90–96.
- Sun, Z. W. (1996). Covering the integers by arithmetic sequences II Trans. Trans. Amer. Math. Soc. 348(11):4279–4320. DOI: 10.1090/S0002-9947-96-01674-1.
- Sun, Z. W. Classified publications on covering systems. http://math.nju.edu.cn/zwsun/Cref.pdf.
- Tomkinson, M. J. (1986). Groups Covered by Abelian Subgroups. London Math. Soc. Lecture Note Ser. United Kingdom: Cambridge University Press
- Tomkinson, M. J. (1987). Groups covered by finitely many cosets or subgroups. Commun. Algebra 15(4):845–859. DOI: 10.1080/00927878708823445.
- ZnáM, Š. (1969). On exactly covering systems of arithmetic sequences. Math. Ann. 180:227–232.