Some codes in symmetric and linear groups (Q2185896): Difference between revisions

If \(G\) is a finite group and let \(X\) and \(Y\) be subsets of \(G,\) then \(Y\) is called a code if \(\left[xy\mid x\in X, y\in Y\right]\) covers the elements of \(G\) exactly \(\lambda\in \mathbb{Z}^{+}\) times. If \(\lambda=1,\) then \(Y\) is a perfect code in the Cayley graph of \(G\) and \(X.\) The authors give two main theorems in the paper. They give the value of \(\lambda\) for codes in the symmetric group and in the special linear group. For both theorems, the authors conjecture a more general statement (Conjecture 2.3 and Conjecture 3.2).