Related papers: 2-supertransitive subfactors at index $3+\sqrt{5}$

Thin Lie algebras are Lie algebras L, graded over the positive integers, with all homogeneous components of dimension at most two, and satisfying a more stringent but natural narrowness condition modeled on an analogous one for pro-p…

We show that indecomposable weak Kac algebras are free over their Cartan subalgebras and prove a duality theorem for their actions. Using this result, for any biconnected weak Kac algebra we construct a minimal action on the hyperfinite…

For any positive integer $s$, a $[2,2s]$-factor in a graph $G$ is a connected even factor with maximum degree at most $2s$. We prove that if every induced $S(K_{1, 2s+1})$ in a graph $G$ has at least 3 edges in a block of degree at most…

For every parabolic subgroup $P$ of a Lie supergroup $G$, the homogeneous superspace $G/P$ carries a $G$-invariant supergeometry. We address the question whether $\mathfrak{g}=\text{Lie}(G)$ is the maximal supersymmetry of this…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

An $\widetilde A_2$ group $\Gamma$ acts simply transitively on the vertices of an affine building $\triangle$. We study certain subgroups $\Gamma_0 \cong {\Bbb Z}^2$ which act on certain apartments of $\triangle$. If one of these subgroups…

We introduce and study diamonds of GL(2,R)-invariant subvarieties of Abelian and quadratic differentials, which allow us to recover information on an invariant subvariety by simultaneously considering two degenerations, and which provide a…

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the…

This is a report on a failed attempt to construct new graphs that are strongly regular with no triangles. The approach is based on the assumption that the second subconstituent has an equitable partition with four parts. For infinitely many…

Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of $K_5$ and of $K_{3,3}$. Here we study the minimal (under subdigraph containment) strongly-connected digraphs that are…

We study almost inner derivations of $2$-step nilpotent Lie algebras of genus $2$, i.e., having a $2$-dimensional commutator ideal, using matrix pencils. In particular we determine all almost inner derivations of such algebras in terms of…

We state a conjecture for the formulas of the depth 4 low-weight rotational eigenvectors and their corresponding eigenvalues for the $3^G$ subfactor planar algebras. We prove the conjecture in the case when $|G|$ is odd. To do so, we find…

Given two $k$-dicolourings of a digraph $D$, we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while maintaining a dicolouring at any step even for $k=2$ and for…

We study the superconformal indices of 4d theories coming from 6d N=(2,0) theory of type \Gamma on a Riemann surface, with the action of the outer-automorphism \sigma in the trace. We find that the indices are given by the partition…

In this paper, we determine the class of finite 2-arc-transitive bicirculants. We show that a connected $2$-arc-transitive bicirculant is one of the following graphs: $C_{2n}$ where $n\geqslant 2$, $\K_{2n}$ where $n\geqslant 2$, $\K_{n,n}$…

We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…

The 2-domination number $\gamma_2(G)$ of a graph $G$ is the minimum cardinality of a set $ D \subseteq V(G) $ for which every vertex outside $ D $ is adjacent to at least two vertices in $ D $. Clearly, $ \gamma_2(G) $ cannot be smaller…

An account of 2-factors in graphs and their history is presented. We give a direct graph-theoretic proof of the 2-Factor Theorem and a new variant of it, and also a new complete characterisation of the maximal graphs without 2-factors. This…

We summarize the known obstructions to subfactors with principal graphs which begin with a triple point. One is based on Jones's quadratic tangles techniques, although we apply it in a novel way. The other two are based on connections…

A well known generalisation of Dirac's theorem states that if a graph $G$ on $n\ge 4k$ vertices has minimum degree at least $n/2$ then $G$ contains a $2$-factor consisting of exactly $k$ cycles. This is easily seen to be tight in terms of…