Related papers: You Can See the Arrows in a Quiver Operator Algebr…

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

Let V be a vertex operator algebra and g an automorphism of order T. We construct a sequence of associative algebras A_{g,n}(V) with n\in\frac{1}{T}\Z nonnegative such that A_{g,n}(V) is a quotient of A_{g,n+1/T}(V) and a pair of functors…

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

We prove the conjectures on dimensions and characters of some quadratic algebras stated by B$.$L$.$Feigin. It turns out that these algebras are naturally isomorphic to the duals of the components of the bihamiltonian operad.

We give a homological interpretation of the coefficients of the Hilbert series for an algebra associated with a directed graph and its dual algebra. This allows us to obtain necessary conditions for Koszulity of such algebras in terms of…

We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.

Two geometric interpretations of the bar automorphism in the positive part of a quantized enveloping algebra are given. The first is in terms of numbers of rational points over finite fields of quiver analogues of orbital varieties; the…

Let $A$ be a split finite-dimensional associative unital algebra over a field. The first main result of this note shows that if the Ext-quiver of $A$ is a simple directed graph, then $HH^1(A)$ is a solvable Lie algebra. The second main…

A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

We prove that two chains of linear mappings are topologically isomorphic if and only if they are linearly isomorphic.

We study graph $C^*$-algebras equipped with generalised gauge actions, and characterise in terms of groupoids and groupoid cocycles when two graph $C^*$-algebras are isomorphic by a diagonal-preserving isomorphism that intertwines the…

In this paper, we introduce the notion of bigraft algebra, generalizing the notions of left and right graft algebras. We give a combinatorial description of the free bigraft algebra generated by one generator and we endow this algebra with…

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

We define nonselfadjoint operator algebras with generators $L_{e_1},..., L_{e_n}, L_{f_1},...,L_{f_m}$ subject to the unitary commutation relations of the form \[ L_{e_i}L_{f_j} = \sum_{k,l} u_{i,j,k,l} L_{f_l}L_{e_k}\] where $u=…

This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…

In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

In Quantum Mechanics operators must be hermitian and, in a direct product space, symmetric. These properties are saved by Lie algebra operators but not by those of quantum algebras. A possible correspondence between observables and quantum…