On restricted unitary Cayley graphs and symplectic transformations modulo \(n\)
The electronic journal of combinatorics, Tome 17 (2010)
We present some observations on a restricted variant of unitary Cayley graphs modulo $n$, and implications for a decomposition of elements of symplectic operators over the integers modulo $n$. We define quadratic unitary Cayley graphs $G_n$, whose vertex set is the ring ${\Bbb Z}_n$, and where residues $a,b$ modulo $n$ are adjacent if and only if their difference is a quadratic residue. By bounding the diameter of such graphs, we show an upper bound on the number of elementary operations (symplectic scalar multiplications, symplectic row swaps, and row additions or subtractions) required to decompose a symplectic matrix over ${\Bbb Z}_n$. We also characterize the conditions on $n$ for $G_n$ to be a perfect graph.
@article{10_37236_341,
author = {Niel de Beaudrap},
title = {On restricted unitary {Cayley} graphs and symplectic transformations modulo \(n\)},
journal = {The electronic journal of combinatorics},
year = {2010},
volume = {17},
doi = {10.37236/341},
zbl = {1214.05020},
url = {http://geodesic.mathdoc.fr/articles/10.37236/341/}
}
Niel de Beaudrap. On restricted unitary Cayley graphs and symplectic transformations modulo \(n\). The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/341
Cité par Sources :