Related papers: Constructions of k-regular maps using finite local…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

We prove the existence of nonconstant harmonic maps of optimal regularity from an arbitrary closed manifold $(M^n,g)$ of dimension $n>2$ to any closed, non-aspherical manifold $N$ containing no stable minimal two-spheres. In particular,…

Contours may be viewed as the 2D outline of the image of an object. This type of data arises in medical imaging as well as in computer vision and can be modeled as data on a manifold and can be studied using statistical shape analysis.…

In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour,…

Both boundary maps in K-theory are expressed in terms of surjections from projective C*-algebras to semiprojective C*-algebras.

In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph $K_{m,n}$, extending a method from de Klerk et al. [SIAM J. Discrete Math. 20…

A stable smooth map $f:N\to M$ is called "$k$-realizable" if its composition with the inclusion $M\subset M\times\Bbb R^k$ is $C^0$-approximable by smooth embeddings; and a "$k$-prem" if the same composition is $C^\infty$-approximable by…

We address the problem proposed by Chartrand, Erd\H{o}s and Oellermann (1988) about the existence of regular $K_3$-irregular graphs. We first establish bounds on the $K_3$-degrees of such graphs and use them to prove that there are no such…

We investigate the set a) of positive, trace preserving maps acting on density matrices of size N, and a sequence of its nested subsets: the sets of maps which are b) decomposable, c) completely positive, d) extended by identity impose…

We prove a couple of results on local continuous extension of proper holomorphic maps $F:D \rightarrow \Omega$, $D, \Omega \varsubsetneq \mathbb{C}^n$, making local assumptions on $\partial{D}$ and $\partial{\Omega}$. The first result…

For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…

Let $Y$ be a Gromov-Hausdorff limit of complete Riemannian n-manifolds with Ricci curvature bounded from below. A point in $Y$ is called $k$-regular, if its tangent is unique and is isometric to an $k$-dimensional Euclidean space. By…

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

Topological quivers generalize the notion of directed graphs in which the sets of vertices and edges are locally compact (second countable) Hausdorff spaces. Associated to a topological quiver $Q$ is a $C^*$-correspondence, and in turn, a…

We develop differential algebraic K-theory of regular arithmetic schemes. Our approach is based on a new construction of a functorial, spectrum level Beilinson regulator using differential forms. We construct a cycle map which represents…

The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of…

Quasiconformal maps in the complex plane are homeomorphisms that satisfy certain geometric distortion inequalities; infinitesimally, they map circles to ellipses with bounded eccentricity. The local distortion properties of these maps give…

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

The well-known Reifenberg theorem states that if a subset of $\mathbb{R}^n$ can be well approximated by $k$-planes at every point and every scale, then it is biH\"older homeomorphic to a $k$-disk. This article concerns a subset $S$ of…