On exceptional cliques in matrix rings

Abstract

We study the notion of exceptional clique, a subset of a ring such that the difference of any two distinct elements of the subset is invertible. Motivated by applications in cryptography, our main focus is to determine the largest size of an exceptional clique in the ring $Ma{t}_{n\times n}(\mathbb{Z})$ of square $n\times n$ matrices over the integers, for every $n$. We obtain several results for the question above, both in the general case and the ``commutative'' case where we additionally require that the elements in the clique commute with each other. As highlights, we prove that, at least for some values of $n$, the largest exceptional cliques in $Ma{t}_{n\times n}(\mathbb{Z})$ are necessarily non-commutative; we then show that for an infinite family of $n$, there are non-commutative exceptional cliques of size $n^2$, and that for every $n$ there are commutative exceptional cliques of size $\frac{2}{3}n+O(n^{\theta })$, for a constant $\theta >\frac{11}{20}$.