Related papers: Finite planar emulators for K_{4,5} - 4K_2 and K_{…

We show that a subfactor planar algebra of finite depth $k$ is generated by a single $s$-box, for $s \leq min\{k+4,2k\}$.

A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…

It is an important question whether it is possible to put a geometry on a given manifold or not. It is well known that any simply connected closed manifold admitting a real projective structure must be a sphere. Therefore, any simply…

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…

A complex algebraic surface $S$ is a $\mathbb{Q}$-homology plane if $H_{i}(S,\mathbb{Q})=0$ for $i>0$. The Negativity Conjecture of Palka asserts that $\kappa(K_{X}+\tfrac{1}{2}D)=-\infty$, where $(X,D)$ is a log smooth completion of $S$.…

A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures,…

In the spirit of noncommutative geometry we construct all inequivalent vector bundles over the $(2,2)$-dimensional supersphere $S^{2,2}$ by means of global projectors $p$ via equivariant maps. Each projector determines the projective module…

This research report outlines work, partially joint with Jeremy Kahn and Kevin Pilgrim, which gives parallel theories of elastic graphs and conformal surfaces with boundary. One one hand, this lets us tell when one rubber band network is…

We study vertex sparsification for distances, in the setting of planar graphs with distortion: Given a planar graph $G$ (with edge weights) and a subset of $k$ terminal vertices, the goal is to construct an $\varepsilon$-emulator, which is…

We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…

In this paper we describe the notion of an annular end of a Riemann surface being of finite type with respect to some harmonic function and prove some theoretical results relating the conformal structure of such an annular end to the level…

We show that extending an embedding of a graph $\Gamma$ in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of $\Gamma$, Hamiltonian extensions must exist.

In \emph{smooth orthogonal layouts} of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal…

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…

A k-regular planar graph G is nearly Platonic when all faces but one are of the same degree while the remaining face is of a different degree. We show that no such graphs with connectivity one can exist. This complements a recent result by…

We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a…

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs…

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…