Walks on Unitary Cayley Graphs and Applications
Elias Cancela, Daniel A. Jaume, Adri\'an Pastine, Denis Videla

TL;DR
This paper derives an explicit formula for counting walks in unitary Cayley graphs of integers modulo n, enabling analysis of sum representations of residue classes as sums of units.
Contribution
It provides a new explicit formula for walks in unitary Cayley graphs and applies it to count representations of residue classes as sums of units.
Findings
Explicit formula for walks in $X_n$
Counts of residue class representations as sums of units
Applications to number theory problems
Abstract
In this paper, we determine an explicit formula for the number of walks in , the unitary Cayley Graphs of order , between any pair of its vertices. With this result, we give the number of representations of a fixed residue class as the sum of units of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · graph theory and CDMA systems · Coding theory and cryptography
