Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. The remark on p. 78 (physical p. 2 of the scan) that any homogeneous cover of Z⊕Z\mathbf Z\oplus\mathbf Z extends trivially to Zn\mathbf Z^n for every n>2n>2, by reading each congruence as one in nn variables with all but two coefficients 00. The paper defines a cover of Zn\mathbf Z^n only loosely there ("distinct moduli and appropriate GCD conditions on the coefficients"); the statement below makes the condition primitivity of each coefficient-and-modulus tuple. The matrix version is not stated in the paper; it and its block-matrix proof are the corpus's own addition.

T. Cochrane and G. Myerson, Covering congruences in higher dimensions, Rocky Mountain J. Math. 26 (1996), no. 1, 77–81, doi:10.1216/rmjm/1181072104; the edition read and its page mapping are named on the source card.

Statement

For every n≥2n\ge2, there is a finite family of primitive homogeneous linear congruences in nn variables, with distinct moduli greater than one, that covers Zn\mathbb Z^n.

There is also a finite nn-cover by n×nn\times n integer matrices whose determinants have pairwise distinct absolute values, all greater than one.

Proof

For each congruence

ax−by≡0(modm)ax-by\equiv0\pmod m

in the two-dimensional homogeneous cover, use in nn variables the coefficient vector

(a,−b,0,…,0).(a,-b,0,\ldots,0).

Every (x1,…,xn)(x_1,\ldots,x_n) satisfies one of these congruences because its first two coordinates satisfy one from the original cover. Adding zero coefficients does not change the greatest common divisor with mm, and the moduli remain distinct.

For the matrix version, take the matrices AjA_j constructed in the two-dimensional matrix corollary and form

Bj=diag⁡(Aj,In−2).(1)B_j=\operatorname{diag}(A_j,I_{n-2}). \tag{1}

Given an integer row vector (h1,…,hn)(h_1,\ldots,h_n), choose jj and an integer row vector (k1,k2)(k_1,k_2) with (h1,h2)=(k1,k2)Aj(h_1,h_2)=(k_1,k_2)A_j. Then

(h1,…,hn)=(k1,k2,h3,…,hn)Bj.(h_1,\ldots,h_n) =(k_1,k_2,h_3,\ldots,h_n)B_j.

Thus the BjB_j form an nn-cover. Finally, ∣det⁡Bj∣=∣det⁡Aj∣|\det B_j|=|\det A_j|, so their determinant magnitudes remain distinct and greater than one.

Bears on. Higher-dimensional variants of covering congruences; no new one-dimensional covering-system conclusion is asserted.