Search arXiv⌕ Search

arXiv · 2610.14373

Transposition Cayley Spectra and Subgraph Counts

Abstract

Let $G$ be a finite simple graph on the vertex set $[n]$, and let $Γ(G)$ be the Cayley graph of the symmetric group $S_n$ generated by the transpositions corresponding to the edges of $G$. We study the inverse spectral problem for the assignment $G\mapsto Γ(G)$ through the group-algebra operator $A_G=\sum_{\{i,j\}\in E(G)}(ij)$ and its regular spectral moments $M_k(G)=\operatorname{tr}(A_G^k)$. The moments admit two all-order forms: a universal support expansion in non-induced subgraph counts of $G$, and a representation-theoretic expansion over the irreducible representations of $S_n$. We compute the first nontrivial moments through order six. In particular, the fourth moment already contains the Coxeter triangle relation and determines the signed local invariant $6N_{K_3}(G)-N_{P_3}(G)$, rather than $N_{P_3}(G)$ alone. Consequently, for triangle-free graphs the spectrum determines the second moment of the degree sequence. We also give a simplified sixth-moment formula for triangle-free graphs, showing that in this class the spectrum determines $5N_{K_{1,3}}(G)+2N_{P_4}(G)+12N_{C_4}(G)$. Further structural consequences include bipartiteness and spectral symmetry of $Γ(G)$, a precise connectedness test, and the identification of the standard irreducible component with the shifted graph Laplacian $mI-L_G$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Boris Shapiro. 2026-10-09. Transposition Cayley Spectra and Subgraph Counts. https://arxiv.org/abs/2610.14373

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The finite volume method on Sierpiński simplices

In the sequel, we extend the Strichartz average approach for the Laplacian, which uses average values of a function over basic sets, rather than pointwise ones as classically done in the literature, and goes back to the seminal work of~S.~Kusuoka and~X.~Y.~Zhou, to Sierpiński Simplices. To our knowledge, the finite volume method had not been applied before to fractals themselves, with their intrinsic Laplacian. We build the finite volume scheme for the heat equation with Dirichlet boundary conditions, give its consistency error, a stability condition of Courant-Friedrichs-Lewy type, obtained by means of an inclusion between the spectrum of the finite volume matrix and the one of the graph Laplacian, and prove the convergence of the scheme. Numerical results are given in the case of the Sierpiński Gasket and Tetrahedron, and compared with the finite difference method.

math.CO↗

Absolute incidence theorems and tilings

We give a precise definition of incidence theorems in plane projective geometry and introduce the notion of absolute incidence theorems, which hold over any ring. Fomin and Pylyavskyy describe how to obtain incidence theorems from tilings of an orientable surface; they call this result the master theorem. Instances of the master theorem are always absolute incidence theorems. As most classically known incidence theorems are instances of the master theorem, they are absolute incidence theorems. We give an explicit example of an incidence theorem involving 13 points that is not an absolute incidence theorem, and therefore is not an instance of the master theorem.

math.CO↗

Cyclic sieving phenomena for trees and tree-rooted maps

We prove cyclic sieving phenomena satisfied by corner-rooted plane trees (alias ordered trees). The sets of rooted plane trees that we consider are: (1) all trees with $n$ nodes; (2) all trees with $n$ nodes and $k$ leaves; (3) all trees with a given degree distribution of the nodes. Moreover, we consider four different cyclic group actions: (1) the root is moved to the next corner along a tour of the tree; (2) only trees in which the root is at a leaf are considered, and the action moves the root to the next leaf; (3) only trees in which the root is at a non-leaf are considered, and the action moves the root to the next non-leaf corner; (4) only trees in which the root is at a node of degree $δ$ are considered, for a fixed $δ$, and the action moves the root to the next corner of this type. We prove a cyclic sieving phenomenon for each meaningful combination of these sets and actions. As a bonus, we also establish corresponding cyclic sieving phenomena for tree-rooted planar maps.

math.CO↗