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

The main purpose of this paper is to classify exchange relation planar algebras with 4 dimensional 2-boxes. Besides its skein theory, we emphasize the positivity of subfactor planar algebras based on the Schur product theorem. We will…

Let $k$, $m$ and $r$ be three integers such that $2\leq k\leq m\leq r$. Let $G$ be a $2r$-regular, $2m$-edge-connected graph of odd order. We obtain some sufficient conditions, which guarantee $G-v$ contains a $k$-factor for all $v\in…

We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one infinite component, and a 2-walk is a spanning walk using every…

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

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…

Let $L$ be a Lie superalgebra over a field of characteristic different from $2,3$ and write $\mathrm{ID}^{*}(L)$ for the Lie superalgebra consisting of superderivations mapping $L$ to $L^{2}$ and the central elements to zero. In this paper…

A 2-edge-coloured graph $G$ is {\bf supereulerian} if $G$ contains a spanning closed trail in which the edges alternate in colours. An {\bf eulerian factor} of a 2-edge-coloured graph is a collection of vertex disjoint induced subgraphs…

A digraph is {\em $d$-dominating} if every set of at most $d$ vertices has a common out-neighbor. For all integers $d\geq 2$, let $f(d)$ be the smallest integer such that the vertices of every 2-edge-colored (finite or infinite) complete…

The first two authors classified subfactor planar algebra generated by a non-trivial 2-box subject to the condition that the dimension of 3-boxes is at most 12 in Part I; 13 in Part II of this series. They are the group planar algebra for…

Let $R$ be a ring with unity. The \emph{idempotent graph} $G_{\text{Id}}(R)$ of a ring $R$ is an undirected simple graph whose vertices are the set of all the elements of ring $R$ and two vertices $x$ and $y$ are adjacent if and only if…

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…

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.

Let $D=(V,A)$ be a digraph. For an integer $k\geq 1$, a $k$-arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$-arc-connected. The first main result of this paper introduces…

We study possible values of the global dimension of endomorphism algebras of 2-term silting complexes. We show that for any algebra $A$ whose global dimension $\mathop{\rm gl. dim}\nolimits A\leq 2$ and any 2-term silting complex…

We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian…

In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…

In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $\gamma_{\times 2}(G)$ is…

In 1956, Tutte proved the celebrated theorem that every 4-connected planar graph is hamiltonian. This result implies that every more than $\frac{3}{2}$-tough planar graph on at least three vertices is hamiltonian and so has a 2-factor.…

We explain a direct topological proof for the multiplicativity of Duflo isomorphism for arbitrary finite dimensional Lie algebras, and derive the explicit formula for the Duflo map. The proof follows a series of implications, starting with…

A graph admitting an automorphism with two orbits of the same length is called a bicirculant. Recently, Jajcay et al. initiated the investigation of the edge-transitive bicirculants with the properties that one of the subgraphs induced by…