On restricted unitary Cayley graphs and symplectic transformations modulo n
From MaRDI portal
Publication:976722
zbMATH Open1214.05020arXiv1002.0713MaRDI QIDQ976722FDOQ976722
Publication date: 16 June 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We present some observations on a restricted variant of unitary Cayley graphs modulo n, and the 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 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 Z_n. We also characterize the conditions on n for G_n to be a perfect graph.
Full work available at URL: https://arxiv.org/abs/1002.0713
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Perfect graphs (05C17)
Cited In (7)
- Waring numbers over finite commutative local rings
- Eigenvalues of Cayley graphs
- Quadratic unitary Cayley graphs of finite commutative rings
- The maximal energy of classes of integral circulant graphs
- Spectrum of Graphs over Rings: A Survey
- Subconstituents of symplectic graphs modulo \(p^n\)
- On the quadratic unitary Cayley graphs
This page was built for publication: On restricted unitary Cayley graphs and symplectic transformations modulo \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976722)
