English
Related papers

Related papers: The little desert? Some subfactors with index in t…

200 papers

In this series of papers we show that there are exactly ten subfactors, other than $A_\infty$ subfactors, of index between 4 and 5. Previously this classification was known up to index $3+\sqrt{3}$. In the first paper we give an analogue of…

Operator Algebras · Mathematics 2015-09-03 Scott Morrison , Noah Snyder

This article proves the existence and uniqueness of a subfactor planar algebra with principal graph consisting of a diamond with arms of length 2 at opposite sides, which we call 2D2. We also prove the uniqueness of the subfactor planar…

Operator Algebras · Mathematics 2015-09-03 Scott Morrison , David Penneys

Subfactor standard invariants encode quantum symmetries. The small index subfactor classification program has been a rich source of interesting quantum symmetries. We give the complete classification of subfactor standard invariants to…

Operator Algebras · Mathematics 2015-09-02 Narjess Afzaly , Scott Morrison , David Penneys

A subfactor is an inclusion $N \subset M$ of von Neumann algebras with trivial centers. The simplest example comes from the fixed points of a group action $M^G \subset M$, and subfactors can be thought of as fixed points of more general…

Operator Algebras · Mathematics 2015-09-03 Vaughan F. R. Jones , Scott Morrison , Noah Snyder

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…

Operator Algebras · Mathematics 2015-09-03 Masaki Izumi , Vaughan F. R. Jones , Scott Morrison , Noah Snyder

We give the classification of subfactor planar algebras at index exactly 5. All the examples arise as standard invariants of subgroup subfactors. Some of the requisite uniqueness results come from work of Izumi in preparation. The…

Operator Algebras · Mathematics 2015-09-03 Masaki Izumi , Scott Morrison , David Penneys , Emily Peters , Noah Snyder

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…

Operator Algebras · Mathematics 2025-10-23 Dietmar Bisch , Julio Cáceres

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…

Operator Algebras · Mathematics 2012-03-13 Scott Morrison , David Penneys , Emily Peters , Noah Snyder

We give two different proofs of the existence of the $AH+2$ subfactor, which is a $3$-supertransitive self-dual subfactor with index $\frac{9+\sqrt{17}}{2} $. The first proof is a direct construction using connections on graphs and…

Operator Algebras · Mathematics 2015-12-09 Pinhas Grossman

We prove existence of subfactors of finite depth of the hyperfinite II_1 factor with indices (5+sqrt{13})/2= 4.302... and (5+sqrt{17})/2=4.561.... The existence of the former was announced by the second named author in 1993 and that of the…

Operator Algebras · Mathematics 2009-10-31 M. Asaeda , U. Haagerup

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…

Quantum Physics · Physics 2009-11-13 Hari Krovi , Todd A. Brun

We eliminate 38 infinite families of possible principal graphs as part of the classification of subfactors up to index 5. A number-theoretic result of Calegari-Morrison-Snyder, generalizing Asaeda-Yasuda, reduces each infinite family to a…

Operator Algebras · Mathematics 2016-11-11 David Penneys , James E. Tener

We investigate connected cubic vertex-transitive graphs whose edge sets admit a partition into a $2$-factor $\mathcal{C}$ and a $1$-factor that is invariant under a vertex-transitive subgroup of the automorphism group of the graph and where…

Combinatorics · Mathematics 2026-01-19 Brian Alspach , Primoz Sparl

Dimensions of objects in fusion categories are cyclotomic integers, hence number theoretic results have implications in the study of fusion categories and finite depth subfactors. We give two such applications. The first application is…

Number Theory · Mathematics 2011-04-12 Frank Calegari , Scott Morrison , Noah Snyder

We develop an equivariant theory of graphs with respect to quantum symmetries and present a detailed exposition of various examples. We portray unitary tensor categories as a unifying framework encompassing all finite classical simple…

Operator Algebras · Mathematics 2026-01-06 Michael Brannan , Roberto Hernández Palomares

Let $F$ be a connected graph with $\ell$ vertices. The existence of a subgraph isomorphic to $F$ can be defined in first-order logic with quantifier depth no better than $\ell$, simply because no first-order formula of smaller quantifier…

Computational Complexity · Computer Science 2017-09-12 Oleg Verbitsky , Maksim Zhukovskii

We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.

Operator Algebras · Mathematics 2015-09-03 Scott Morrison

We construct irreducible hyperfinite subfactors of index 6 with a prescribed fundamental group from a large family containing all countable and many uncountable subgroups of R_+. We also prove that there are unclassifiably many irreducible…

Operator Algebras · Mathematics 2016-07-25 Arnaud Brothier , Stefaan Vaes

Let $\delta$ and $\Delta$ be the minimum and the maximum degree of the vertices of a simple connected graph $G$, respectively. The distinguishing index of a graph $G$, denoted by $D'(G)$, is the least number of labels in an edge labeling of…

Combinatorics · Mathematics 2017-05-17 Saeid Alikhani , Samaneh Soltani

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

Group Theory · Mathematics 2022-10-27 Sandeep Dalal , Sanjay Mukherjee , Kamal Lochan Patra
‹ Prev 1 2 3 10 Next ›