Related papers: Automorphisms of the bipartite graph planar algebr…

Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…

Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

We present more planar algebraic construction of subfactors than those of Guionet-Jones-Shlyakhtenko-Walker and Kodiyalam-Sunder which start from a subfactor planar algebra and give in a direct way a subfactor of the same standard invariant…

We classify trivalent vertex-transitive graphs whose edge sets have a partition into a 2-factor composed of two cycles and a 1-factor that is invariant under the action of the automorphism group.

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on…

We determine the quantum automorphism groups of finite graphs. These are quantum subgroups of the quantum permutation groups defined by Wang. The quantum automorphism group is a stronger invariant for finite graphs than the usual one. We…

For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…

Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…

By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.

We give upper bounds on the order of the automorphism group of a simple graph

We describe the subfactor planar algebra of an intermediate subfactor $N\subset Q \subset M$ of an extremal subfactor $N\subset M$ of finite Jones index which is not necessarily irreducible.

We consider the natural Lie algebra structure on the (associative) group algebra of a finite group $G$, and show that the Lie subalgebras associated to natural involutive antiautomorphisms of this group algebra are reductive ones. We give a…

For a real semisimple Lie algebra, we consider its automorphism group quotient by its identity component. This is known as the outer automorphism group. In this article, we compute the outer automorphism groups of all real semisimple Lie…

In this paper, we explicitly work out the subfactor planar algebra $P^{(N \subset Q)}$ for an intermediate subfactor $N \subset Q \subset M$ of an irreducible subfactor $N \subset M$ of finite index. We do this in terms of the subfactor…

We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…

Every indefinite binary form occurs as the Picard lattice of some K3-surface. The group of its isometries, or automorphs, coincides with the automorphism group of the K3-surface, but only up to finite groups. The classical theory of…