On restricted unitary Cayley graphs and symplectic transformations modulo n

Details On restricted unitary Cayley graphs and symplectic transformations modulo n On restricted unitary Cayley graphs and symplectic transformations modulo n

2010-02-03

arxiv.org/abs/1002.0713v2

Electronic J. Combinatorics v17 (R69), 2010

Mathematics

Combinatorics

27 pages, 1 appendix. This revision corrects a significant (but removable) error from the proof of Theorem 12

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On restricted unitary Cayley graphs and symplectic transformations modulo n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On restricted unitary Cayley graphs and symplectic transformations modulo n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On restricted unitary Cayley graphs and symplectic transformations modulo n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601981