Related papers: You Can See the Arrows in a Quiver Operator Algebr…
We prove that two dual operator spaces $X$ and $Y$ are stably isomorphic if and only if there exist completely isometric normal representations $\phi$ and $\psi$ of $X$ and $Y$, respectively, and ternary rings of operators $M_1, M_2$ such…
In the $(G,H)$-isomorphism game, a verifier interacts with two non-communicating players (called provers) by privately sending each of them a random vertex from either $G$ or $H$, whose aim is to convince the verifier that two graphs $G$…
We present a construction of 2-step nilpotent Lie algebras using labeled directed simple graphs, which allows us to give a criterion to detect certain ideals and subalgebras by finding special subgraphs. We prove that if a label occurs only…
In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we…
We consider a series of questions that grew out of determining when two quantum planes are isomorphic. In particular, we consider a similar question for quantum matrix algebras and certain ambiskew polynomial rings. Additionally, we modify…
The graph groupoids of directed graphs are topologically isomorphic if and only if there is a diagonal-preserving ring *-isomorphism between the Leavitt path algebras.
We define and investigate properties of universal operator algebras of directed graphs. Results include free products decomposition and continuity of the construction with respect to direct limits. Lastly we prove some K-theoretic results…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…
To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…
We prove that for a bijective, unital, linear map between absolute order unit spaces is an isometry if, and only if, it is absolute value preserving. We deduce that, on (unital) $JB$-algebras, such maps are precisely Jordan isomorphisms.…
We define a solvable extension of the graph 2-step nilpotent Lie algebras of [5] by adding elements corresponding to the 3-cliques of the graph. We study some of their basic properties and we prove that two such Lie algebras are isomorphic…
We study the question when for a given *-algebra $\mathcal{A}$ a sequence of cones $C_n\in M_n(\mathcal{A})$ can be realized as cones of positive operators in a faithful *-representation of $\mathcal{A}$ on a Hilbert space. A…
Given a simply connected space $X$, there are several, a priori different, algebraic groups whose groups of $\mathbb Q$-points are isomorphic to the group of homotopy classes of homotopy automorphisms of the rationalization of $X$. We will…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
The Mapper algorithm is a popular tool for visualization and data exploration in topological data analysis. We investigate an inverse problem for the Mapper algorithm: Given a dataset $X$ and a graph $G$, does there exist a set of Mapper…
We study the connection between two combinatorial notions associated to a quiver: the quiver algebra and the path coalgebra. We show that the quiver coalgebra can be recovered from the quiver algebra as a certain type of finite dual, and we…