Spectral Theory of Cayley Graphs of Finite Groups

dc.contributor.advisorBHAGWAT, CHANDRASHEELen_US
dc.contributor.authorK S, MALAVIKAen_US
dc.contributor.departmentDept. of Mathematicsen_US
dc.contributor.registration20201039en_US
dc.date.accessioned2025-05-16T06:51:40Z
dc.date.available2025-05-16T06:51:40Z
dc.date.issued2025-05en_US
dc.description.abstractThis thesis explores the spectral properties of Cayley graphs and their connections to representation theory. Spectral graph theory studies the eigenvalues of adjacency and Laplacian matrices, which reveal structural properties of graphs. When a group acts transitively on a graph, its adjacency and Laplacian spectra are closely related and can often be analyzed through group representations. The Cayley graph of a group, defined with respect to a generating set, provides a natural framework for studying spectral properties using character theory. Key results on Markov chain theory by J. R. Norris and those of Diaconis, Bayer, and Aldous on card shuffling are examined in this context. Additionally, Lov´asz’s work on the eigenvalues of graphs in terms of character theory is discussed. The thesis concludes with explicit calculations of the spectra of the Cayley graphs of dihedral groups and S 4 , using these theoretical insights.en_US
dc.description.embargoNo Embargoen_US
dc.identifier.citation90en_US
dc.identifier.urihttp://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/9899
dc.language.isoenen_US
dc.subjectSpectral Graph Theoryen_US
dc.subjectCayley Graphsen_US
dc.subjectGroup Theoryen_US
dc.subjectMarkov Chainsen_US
dc.subjectShuffling of Cardsen_US
dc.titleSpectral Theory of Cayley Graphs of Finite Groupsen_US
dc.typeThesisen_US
dc.type.degreeBS-MSen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
20201039_Malavika_KS_Thesis.pdf
Size:
2.28 MB
Format:
Adobe Portable Document Format
Description:
MS Thesis

Collections