Related papers: 2-supertransitive subfactors at index $3+\sqrt{5}$
In this paper we compute the superconformal index of 2d (2,2) supersymmetric gauge theories. The 2d superconformal index, a.k.a. flavored elliptic genus, is computed by a unitary matrix integral much like the matrix integral that computes…
We present a purely planar algebraic proof of the main result of a paper of Guionnet-Jones-Shlaykhtenko which constructs an extremal subfactor from a subfactor planar algebra whose standard invariant is given by that planar algebra.
The diamond cone is a combinatorial description for a basis of an indecomposable module for the nilpotent factor $\mathfrak n$ of a semi simple Lie algebra. After N. J. Wildberger who introduced this notion, this description was achevied…
Let D be a directed graph with vertex set V and order n. An anti-directed hamiltonian cycle H in D is a hamiltonian cycle in the graph underlying D such that no pair of consecutive arcs in H form a directed path in D. An anti-directed…
Let $1\leq m \leq n$ be integers with $m|n$ and $\cat{Alg}_{n,m}$ the class of central simple algebras of degree $n$ and exponent dividing $m$. In this paper, we find new, improved upper bounds for the essential dimension and 2-dimension of…
A connected graph $\Gamma=(V,E)$ of valency at least $3$ is called a basic $2$-arc-transitive graph if its full automorphism group has a subgroup $G$ with the following properties: (i) $G$ acts transitively on the set of $2$-arcs of…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…
Most known examples of subfactors occur in families, coming from algebraic objects such as groups, quantum groups and rational conformal field theories. The Haagerup subfactor is the smallest index finite-depth subfactor which does not…
The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…
The distinguishing index of a simple graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of $G$ not preserved by any non-trivial automorphism. It was conjectured by Pil\'sniak (2015) that for any 2-connected…
A pseudo 2-factor of a graph is a spanning subgraph such that each component is $K_1$, $K_2$, or a cycle. This notion was introduced by Bekkai and Kouider in 2009, where they showed that every graph $G$ has a pseudo 2-factor with at most…
We construct new hyperfinite subfactors with Temperley-Lieb-Jones (TLJ) standard invariant and Jones indices between $4$ and $3 + \sqrt{5}$. Our subfactors occur at all indices between $4$ and $5$ at which finite depth, hyperfinite…
One major obstacle in extending the classification of small index subfactors beyond 3+\sqrt{3} is the appearance of infinite families of candidate principal graphs with 4-valent vertices (in particular, the "weeds" Q and Q' from Part 1…
A 2-nearly Platonic graph of type (k|d) is a k-regular planar graph with f faces, f-2 of which are of degree d and the remaining two are of degrees m_1;m_2, both different from d. Such a graph is called balanced if m_1=m_2. We show that all…
A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…
A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…
In this paper, we give the following result: If $D$ is a digraph of order $n$, and if $d_{D}^{+}(u) + d_{D}^{-}(v) \ge n$ for every two distinct vertices $u$ and $v$ with $(u, v) \notin A(D)$, then $D$ has a directed $2$-factor with exactly…
In this paper, we consider the embedding of a complete $d$-uniform geometric hypergraph with $n$ vertices in general position in $\mathbb{R}^d$, where each hyperedge is represented as a $(d-1)$-simplex, and a pair of hyperedges is defined…
We consider noncommuting pairs P,Q of intermediate subfactors of an irreducible, finite-index inclusion N in M of II_1 factors such that P and Q are supertransitive with Jones index less than 4 over N. We show that up to isomorphism of the…
If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…