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

Motivated by the theory of bi-singular pseudodifferential operators, we introduce a two dimensional version of the Adler-Manin trace. Our construction is rather general in the sense that it involves a twist afforded by an algebra…

We introduce two families of diagrammatic monoidal supercategories. The first family, depending on an associative superalgebra, generalizes the oriented Brauer category. The second, depending on an involutive superalgebra, generalizes the…

Nottingham algebras are a class of just-infinite-dimensional, modular, $\mathbb{N}$-graded Lie algebras, which includes the graded Lie algebra associated to the Nottingham group with respect to its lower central series. Homogeneous…

Let $G(V,E)$ be a simple, undirected and connected graph. A dominating set $S \subseteq V(G)$ is called a $2$-\textit{secure dominating set} ($2$-SDS) in $G$, if for every pair of distinct vertices $u_1,u_2 \in V(G)$ there exists a pair of…

We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…

Let $G$ be a connected graph with the usual shortest-path metric $d$. The graph $G$ is $\delta$-hyperbolic provided for any vertices $x,y,u,v$ in it, the two larger of the three sums $d(u,v)+d(x,y),d(u,x)+d(v,y)$ and $d(u,y)+d(v,x)$ differ…

A {\em snark} is a cubic cyclically 4-edge connected graph with edge chromatic number four and girth at least five. We say that a graph $G$ is {\em odd 2-factored} if for each 2-factor F of G each cycle of F is odd. In this paper, we…

We construct link invariants using the $D_{2n}$ subfactor planar algebras, and use these to prove new identities relating certain specializations of colored Jones polynomials to specializations of other quantum knot polynomials. These…

We investigate generalisations of 1-factorisations and hyperfactorisations of the complete graph $K_{2n}$. We show that they are special subsets of the association scheme obtained from the Gelfand pair $(S_{2n},S_2 \wr S_n)$. This unifies…

We extend the study of link-irregular graphs to directed graphs (digraphs), where a digraph is link-irregular if no two vertices have isomorphic directed links. We establish that link-irregular digraphs exist on $n$ vertices if and only if…

Given a finite index subfactor, we show that the {\em affine morphisms at zero level} in the affine category over the planar algebra associated to the subfactor is isomorphic to the fusion algebra of the subfactor as a *-algebra. This…

We show that superreflexivity can be characterized in terms of bilipschitz embeddability of word hyperbolic groups. We compare characterizations of superreflexivity in terms of diamond graphs and binary trees. We show that there exist…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbor receive different…

To any complex Hadamard matrix H one associates a spin model commuting square, and therefore a hyperfinite subfactor. The standard invariant of this subfactor captures certain "group-like" symmetries of H. To gain some insight, we compute…

A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-Factor-critical graphs and 2-factor-critical graphs are…

Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with…

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor…