Related papers: Automorphisms of the bipartite graph planar algebr…
A hyperfinite $II_1$ subfactor may be obtained from a symmetric commuting square via iteration of the basic construction. For certain commuting squares constructed from Hadamard matrices, we describe this subfactor as a group-type inclusion…
In this paper, we construct a bialgebraic and further a Hopf algebraic structure on top of subgraphs of a given graph. Further, we give the dual structure of this Hopf algebraic structure. We study the algebra morphisms induced by graph…
We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…
We canonically associate to any planar algebra two type II_{\infty} factors M_{+} and M_{-}. The subfactors constructed previously by the authors in a previous paper are isomorphic to compressions of M_{+} and M_{-} to finite projections.…
It is shown that the fixed point subalgebra of an EALA under a finite order automorphism (satisfying certain properties) is a sum of EALA's, an abelian subalgebra, and a subspace which is contained in the centralizer of the core.
The extremal eigenvalues including maximum eigenvalues and the minimum eigenvalues about outerplanar graphs are investigated in this paper. Some structural characterizations about the (edge) maximal bipartite outerplanar graphs are…
A 2-factor of a graph is a 2-regular spanning subgraph. For a graph $G$ and an independent set $I$ of $G$, let $\delta_G(I)$ denote the minimum degree of vertices contained in $I$. We show that (1) if every independent set $I$ of $G$…
Using an analogue of the Guionnet-Jones-Shlaykhtenko construction for graphs we show that their construction applied to any subfactor planar algebra of finite depth yields an inclusion of interpolated free group factors with finite…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite…
Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…
Given a variety of universal algebras. A method is suggested for describing automorphisms of a category of free algebras of this variety. Applying this general method all automorphisms of such categories are found in two cases: 1) for the…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…
We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…
In this paper we describe graded automorphisms and antiautomorphisms of finite order on matrix algebras endowed with a group gradings by a finite abelian group over an arbitrary algebraically closed field of charcteristic different from 2.