SearcharxivSearch

arXiv subjects

Skyler Hudson

Publications and source records attributed to Skyler Hudson.

2 recordsLinked to original sources

Skein Construction of Balanced Tensor Products

The theory of tensor categories has found applications across various fields, including representation theory, quantum field theory (conformal in 2 dimensions, and topological in 3 and 4 dimensions), quantum invariants of low-dimensional objects, topological phases of matter, and topological quantum computation. In essence, it is a categorification of the classical theory of algebras and modules. In this analogy, the Deligne tensor product $\boxtimes$ is to the linear tensor $\otimes_{\mathbb{C}}$ as the balanced tensor product $\boxtimes_C$ is to the tensor over algebra $\otimes_A$, where $\mathbb{C}$ is a field, $A$ is a $\mathbb{C}$-algebra, and $C$ is a tensor category. Before this work, several algebraic constructions for balanced tensor products were known, including categories of modules, internal Hom spaces, and generalized categorical centers. In this paper, we introduce a topological construction based on skein theory that offers a better mix of algebra and topology. This approach not only works for products of multiple module categories, but also provides the missing key to proving that the Turaev-Viro state sum model naturally arises from the 3-functor in the classification of fully extended field theories. Building on this result, we establish this long-anticipated proof in an upcoming work.

math-ph

Frames for signal processing on Cayley graphs

The spectral decomposition of graph adjacency matrices is an essential ingredient in the design of graph signal processing (GSP) techniques. When the adjacency matrix has multi-dimensional eigenspaces, it is desirable to base GSP constructions on a particular eigenbasis that better reflects the graph's symmetries. In this paper, we provide an explicit and detailed representation-theoretic account for the spectral decomposition of the adjacency matrix of a weighted Cayley graph. Our method applies to all weighted Cayley graphs, regardless of whether they are quasi-Abelian, and offers detailed descriptions of eigenvalues and eigenvectors derived from the coefficient functions of the representations of the underlying group. Next, we turn our attention to constructing frames on Cayley graphs. Frames are overcomplete spanning sets that ensure stable and potentially redundant systems for signal reconstruction. We use our proposed eigenbases to build frames that are suitable for developing signal processing on Cayley graphs. These are the Frobenius--Schur frames and Cayley frames, for which we provide a characterization and a practical recipe for their construction.

cs.IT