Related papers: Partitioned tensor products and their spectra
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Hypergraphs and tensors extend classic graph and matrix theory to account for multiway relationships, which are ubiquitous in engineering, biological, and social systems. While the Kronecker product is a potent tool for analyzing the…
In this article, we consider the tensor product of two simple modules of quanum $GL_2$ over a field of characteristic $p\neq 0$. We show that it can be expressed as a direct sum of indecomposable twisted tilting modules. This problem has…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…
We resolve a conjecture of Cooper-Fenner-Purewal that a certain sequence of combinatorial matrices which can be used to bound small product-Ramsey numbers is positive semidefinite. Because the connection to Ramsey Theory involves solving…
Given a vector-space $~V~$ which is the tensor product of vector-spaces $A$ and $B$, we reconstruct $A$ and $B$ from the family of simple tensors $a{\otimes}b$ within $V$. In an application to quantum mechanics, one would be reconstructing…
We classify $n\times n$-matrix-valued continuous commutativity and spectrum preservers defined on spaces of (a) normal, (b) semisimple and (c) arbitrary $n\times n$ matrices with spectra contained in sufficiently connected subsets…
We prove that graph products of sofic groups are sofic, as are graphs of groups for which vertex groups are sofic and edge groups are amenable.
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and…
We show that every admissible irreducible representation of a product of two locally compact groups is a tensor product of admissible irreducible representations of the factors.
We compute the signed distribution of the eigenvalues/vectors of the complex order-three random tensor by computing a partition function of a four-fermi theory, where signs are from a Hessian determinant associated to each eigenvector. The…
We exhibit finitely generated groups with prescribed Poincar\'e profiles. It can be prescribed for functions between $n/\log n$ and linear, and is sharp for functions at least $n/(\log\log n)$. Those profiles were introduced by Hume, Mackay…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
We define a free product of connected simple graphs that is equivalent to several existing definitions when the graphs are vertex-transitive but differs otherwise. The new definition is designed for the automorphism group of the free…