We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if they are sparse. This affirmatively answers a question of Chung and Graham (2002) for the particular case of Cayley graphs of abelian groups, while in general the answer is negative., Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht., and Obsahuje seznam literatury
A real matrix A is a G-matrix if A is nonsingular and there exist nonsingular diagonal matrices D_{1} and D_{2} such that A^{-T} = D_{1}AD_{2}, where A^{-T} denotes the transpose of the inverse of A. Denote by J = diag(±1) a diagonal (signature) matrix, each of whose diagonal entries is +1 or −1. A nonsingular real matrix Q is called J-orthogonal if Q^{T} JQ = J. Many connections are established between these matrices. In particular, a matrix A is a G-matrix if and only if A is diagonally (with positive diagonals) equivalent to a column permutation of a J-orthogonal matrix. An investigation into the sign patterns of the J-orthogonal matrices is initiated. It is observed that the sign patterns of the G-matrices are exactly the column permutations of the sign patterns of the J-orthogonal matrices. Some interesting constructions of certain J-orthogonal matrices are exhibited. It is shown that every symmetric staircase sign pattern matrix allows a J-orthogonal matrix. Sign potentially J-orthogonal conditions are also considered. Some examples and open questions are provided., Frank J. Hall, Miroslav Rozložník., and Obsahuje seznam literatury