相关论文: Partitioned tensor products and their spectra
Motivated by some results in classical differential geometry, we give a constructive procedure for building up a connection over a (twisted) tensor product of two algebras, starting from connections defined on the factors. The curvature for…
We study right exact tensor products on the category of finitely presented functors. As our main technical tool, we use a multilinear version of the universal property of so-called Freyd categories. Furthermore, we compare our constructions…
A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…
We present an index-based tensorial formulation for computing eigenvalues of charge operators acting on arbitrary tensor representations of unitary gauge groups. The construction follows directly from the action of Cartan generators on…
We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.
We show that in contrast to the Rado graph, the Henson graphs are not computably indivisible.
Chandler-Wilde, Chonchaiya and Lindner conjectured that the set of eigenvalues of finite tridiagonal sign matrices ($\pm 1$ on the first sub- and superdiagonal, $0$ everywhere else) is dense in the set of spectra of periodic tridiagonal…
Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles. We show here that such relations in a natural way…
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.
For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…
We determine the necessary and sufficient combinatorial conditions for which the tensor product of two irreducible polynomial representations of $GL(n,\mathbb{C})$ is isomorphic to another. As a consequence we discover families of…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
We describe the algebraic ingredients of a proof of the conjecture of Frenkel and Ip that the category of positive representations $\mathcal{P}_\lambda$ of the quantum group $U_q(\mathfrak{sl}_{n+1})$ is closed under tensor products. Our…
Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…
Let A(G) be the adjacency tensor (hypermatrix) of uniform hypergraph G. The maximum modulus of the eigenvalues of A(G) is called the spectral radius of G. In this paper, the conjecture of Fan et al. in [5] related to compare the spectral…
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical language makes it easy to describe and…
We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…
The spectral decomposition of a symmetric, second-order tensor is widely adopted in many fields of Computational Mechanics. As an example, in elasto-plasticity under large strain and rotations, given the Cauchy deformation tensor, it is a…
The space of invariants of a tensor product of representations of SL(n) is provided with the basis parametrized by wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris, named here L-tris.
For each valued quiver $Q$ of Dynkin type, we construct a valued ice quiver $\Delta_Q^2$. Let $G$ be a simple connected Lie group with Dynkin diagram the underlying valued graph of $Q$. The upper cluster algebra of $\Delta_Q^2$ is graded by…