On restricted unitary Cayley graphs and symplectic transformations modulo n

MaRDI QIDQ976722zbMATH OpenFDO

Authors Niel de Beaudrap

Publication date 16 June 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.0713, https://eudml.org/doc/227919, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r69.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Distance in graphs (05C12) Perfect graphs (05C17) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

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.

Review text

Summary: 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 \(\mathbb 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 \(\mathbb Z_n\). We also characterize the conditions on \(n\) for \(G_n\) to be a perfect graph.

Recommendations

• On the quadratic unitary Cayley graphs
• Symplectic graphs modulo pq
• scientific article; zbMATH DE number 798645
• On the unitary Cayley graph of a finite ring
• On the unitary Cayley graphs of matrix algebras

Cited in

(10)

• On the quadratic unitary Cayley graphs
• Eigenvalues of Cayley graphs
• Quadratic unitary Cayley graphs of finite commutative rings
• Subconstituents of symplectic graphs modulo \(p^n\)
• The maximal energy of classes of integral circulant graphs
• Spectrum of Graphs over Rings: A Survey
• Waring numbers over finite commutative local rings
• Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs
• Number of cliques of Paley-type graphs over finite commutative local rings
• State transfer in Grover walks on unitary and quadratic unitary Cayley graphs over finite commutative rings

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)