Related papers: Partitioned tensor products and their spectra
The graphs $D(k,q)$ have connected components $CD(k,q)$ giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite…
For a connected semisimple algebraic group $G$, we consider some special infinite series of tensor products of simple $G$-modules whose $G$-fixed point spaces are at most one-dimensional. We prove that their existence is closely related to…
We investigate the algebraic complexity of tensor calulus. We consider a generalization of iterated matrix product to tensors and show that the resulting formulas exactly capture VP, the class of polynomial families efficiently computable…
We classify thick tensor ideals of finite objects in the category of rational torus-equivariant spectra, showing that they are completely determined by geometric isotropy. This is essentially equivalent to showing that the Balmer spectrum…
This paper introduces the notion of tubular eigenvalues of third-order tensors with respect to T-products of tensors and analyzes their properties. A focus of the paper is to discuss relations between tubular eigenvalues and two alternative…
We show that, under fairly general conditions, many elements of a p-adic group can be well approximated by a product whose factors have properties that are helpful in performing explicit character computations.
We prove an explicit formula for the tensor product with itself of an irreducible complex representation of the symmetric group defined by a rectangle of height two. We also describe part of the decomposition for the tensor product of…
Eigenvalue distributions are important dynamical quantities in matrix models, and it is an interesting challenge to study corresponding quantities in tensor models. We study real tensor eigenvalue/vector distributions for real symmetric…
We compute the the Balmer spectra of compact objects of tensor triangulated categories whose objects are filtered or graded objects of (or sheaves valued in) another tensor triangulated category. Notable examples include the filtered…
We describe the (bigraded) Hochschild cohomology of graded gentle algebras along with the Gerstenhaber bracket and cup product. In particular, this yields a description of the Hochschild cohomology of partially wrapped Fukaya categories of…
We consider signed graphs, i.e, graphs with positive or negative signs on their edges. We construct some families of bipartite signed graphs with only two distinct eigenvalues. This leads to constructing infinite families of regular…
In this article we introduce a definition of k-uniform thresholds hypergraphs through a binary sequence, a natural extension of the classical definition for thresholds graphs. We characterize some of its eigenvalues and multiplicities by…
Pencils of Hankel matrices whose elements have a joint Gaussian distribution with nonzero mean and not identical covariance are considered. An approximation to the distribution of the squared modulus of their determinant is computed which…
The relationships between eigenvalues and eigenvectors of a product graph and those of its factor graphs have been known for the standard products, while characterization of Laplacian eigenvalues and eigenvectors of the Kronecker product of…
A graph $G$ is factored into graphs $H$ and $K$ via a matrix product if there exist adjacency matrices $A$, $B$, and $C$ of $G$, $H$, and $K$, respectively, such that $A = BC$. In this paper, we study the spectral aspects of the matrix…
For every simple graph $G$, a class of multiple clique cluster-whiskered graphs $G^{md}$ is introduced, and it is shown that all graphs $G^{md}$ are vertex decomposable, thus the independence simplicial complex ${\rm Ind}\,G^{md}$ is…
We consider the algebra M_k(C) of k-by-k matrices over the complex numbers and view it as a crossed product with a group G of order k by embedding G in the symmetric group S_k via the regular representation and embedding S_k in M_k(C) in…
We show that the twisted Grassmann graphs introduced by Van Dam and Koolen are obtained by Godsil-McKay switching applied to the Grassmann graphs. The partition for the switching is constructed by a polarity of a hyperplane.
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…