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

An out-(in-)branching B_s^+ (B_s^-) rooted at s in a digraph D is a connected spanning subdigraph of D in which every vertex x != s has precisely one arc entering (leaving) it and s has no arcs entering (leaving) it. We settle the…

We show that 2D periodic operators with local and perpendicular defects form an algebra. We provide an algorithm of finding spectrum for such operators. While the continuous spectral components can be computed by simple algebraic operations…

Let G be a simple balanced bipartite graph on $2n$ vertices, $\delta = \delta(G)/n$, and $\rho={\delta + \sqrt{2 \delta -1} \over 2}$. If $\delta > 1/2$ then it has a $\lfloor \rho n \rfloor$-regular spanning subgraph. The statement is…

Associated to a Lie groupoid, there are two $C^*$-algebras: the full and the reduced one. The associated order $0$ pseudodifferential calculus gives rise to multiplier algebras of both. We prove that both associated corona algebras are…

Guionnet et al. gave a construction of a II_1 factor associated to a subfactor planar algebra. In this paper we define an unshaded planar algebra. To any unshaded planar algebra P we associate a finite von Neumann algebra M_P. We prove that…

The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs…

A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…

We study the class of all finite directed graphs up to primitive positive constructability. The resulting order has a unique greatest element, namely the graph $P_1$ with one vertex and no edges. The graph $P_1$ has a unique greatest lower…

We prove that every $n$-vertex directed graph $G$ with the minimum outdegree $\delta^+(G) = d$ contains a subgraph $H$ satisfying \[ \min\left\{\delta^+(H), \delta^-(H) \right\} \ge \frac{d(d+1)}{2n} \,.\] We also show that if $d = o(n)$…

Over the past 10 years, there has been considerable interest in exploring questions connecting dimension for posets with graph theoretic properties of their cover graphs and order diagrams, especially with the concepts of planarity and…

A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adjacent to at least one vertex in $D$. A dominating set $D$ is paired if the subgraph induced by its vertices has a perfect matching, and…

Symmetrically self-similar graphs are an important type of fractal graph. Their Green functions satisfy order one iterative functional equations. We show when the branching number of a generating cell is two, either the graph is a star…

I will report on a top-down approach relating N=2, D=4 pure supergravity with non-trivial boundary behavior to a (2+1)-dimensional analog model which is able to describe the electronic properties of graphene-like materials. This is…

Given a set $P$ of $n$ points in the plane, we solve the problems of constructing a geometric planar graph spanning $P$ 1) of minimum degree 2, and 2) which is 2-edge connected, respectively, and has max edge length bounded by a factor of 2…

We propose an extension of the su(2,2|4) superalgebra to incorporate the $F1/D1$ string charges in type IIB string theory on the $AdS_{5} \times S^{5}$ background, or the electro-magnetic charges in the dual super Yang-Mills theory. With…

We prove that every finite arc-transitive graph of valency twice a prime admits a nontrivial semiregular automorphism, that is, a non-identity automorphism whose cycles all have the same length. This is a special case of the Polycirculant…

We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…

$2$-stratifolds are a generalization of $2$-manifolds that occur as objects in applications such as in TDA. These spaces can be described by an associated bicoloured labelled graph. In previous papers we obtained a classification of…

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let $G$ be a graph on $n$ vertices. A 2-lift of $G$ is a graph $H$ on $2n$ vertices,…