arXiv research

Polynomial-time algorithm for c-planarity and thickenability.

We prove that the optimal way to enclose and separate four planar regions with equal area using the less possible perimeter requires all regions to be connected. Moreover, the topology of such optimal clusters is uniquely determined.

The paper analyzes the emergence of almost-honeycomb structures in low-energy planar clusters.

We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our a…

Soap bubbles and foams have been extensively studied by scientists, engineers, and mathematicians as models for organisms and materials, with applications ranging from extinguishing fires to mining to baking bread. Here we provide some basic results on the space of planar clusters of n bubbles of fixed topology. We sho…

Geometrically, Legendrian surfaces related by surgery have related skein-valued cluster spaces.

We investigate the planar maximally filtered graphs of the portfolio of the 300 most capitalized stocks traded at the New York Stock Exchange during the time period 2001-2003. Topological properties such as the average length of shortest paths, the betweenness and the degree are computed on different planar maximally f…

We introduce a graph-theoretic approach to extract clusters and hierarchies in complex data-sets in an unsupervised and deterministic manner, without the use of any prior information. This is achieved by building topologically embedded networks containing the subset of most significant links and analyzing the network s…

There is a natural generalization of domino tilings to tilings of a polygon by hexagons, or, dually, configurations of oriented curves that meet in triples. We show exactly when two such tilings can be connected by a series of moves analogous to the domino flip move. The triple diagrams that result have connections to …

New method disentangles shock diffusion on complex networks using graph planarity.

Study links and quivers, proving polynomial equality conjecture.

Several algorithms have been proposed to filter information on a complete graph of correlations across stocks to build a stock-correlation network. Among them the planar maximally filtered graph (PMFG) algorithm uses $3n-6$ edges to build a graph whose features include a high frequency of small cliques and a good clust…

Characterizes minor-minimal separating projective planar graphs and their generalizations.

Persistence diagrams (PDs) are now routinely used to summarize the underlying topology of complex data. Despite several appealing properties, incorporating PDs in learning pipelines can be challenging because their natural geometry is not Hilbertian. Indeed, this was recently exemplified in a string of papers which sho…

Construct locally minimizing $(1,2)$-clusters with prescribed asymptotic geometry.

We construct an isotopy of a planar compactum that is not the restriction of an isotopy of any planar continuum.

Study examines how changing regions affects planar graphs.

In this paper, we introduce the notions of an iterated planar Lefschetz fibration and an iterated planar open book decomposition and prove the Weinstein conjecture for contact manifolds supporting an open book that has iterated planar pages. For $n\geq 1$, we show that a $(2n+1)$-dimensional contact manifold $M$ suppor…

New inequalities for planar convex domains' Laplacian eigenvalues.

Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

Study of higher-dimensional contact manifolds and their properties.

Proves planar graphs' configuration spaces have highest topological complexity.

We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct web-theoretical proof of the Poincaré's theorem: a planar 4-web of maximum rank is lineari…

We characterize those planar Peano continua that are homotopy equivalent to 1-dimensional sets. While many planar Peano continua are not homotopically 1-dimensional, we prove that each has fundamental group that embeds in the fundamental group of a 1-dimensional planar Peano continuum. We leave open the following quest…

Planar multilinks prove rational singularities in surface geometry.

Paper introduces a new invariant for planar knotoids.

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that $G/e$ is planar, as well as the analogues with a universal quantifier: $\forall v$…

Entire area-minimizing surfaces of density 2 are planar or quadratic

The complement of a non-separating planar graph contains a K_n minor.

We define a certain abstract planar algebra by generators and relations, study various aspects of its structure, and then identify it with Jones' spin planar algebra.

Sharp bounds for spanning tree entropy in planar lattices.

Study on planar graph braid groups' second homology.

Paper defines a jellyfish algorithm for a specific subfactor planar algebra.

Compact Special Weingarten surfaces with planar convex boundaries are disks.

In this paper we study lightlike surfaces of Minkowski 3- space such that they have degenerate or non-degenerate planar normal sections. We first show that every lightlike surface of Minkowski $3-$ space has degenerate planar normal sections. Then we study lightlike surfaces with non-degenerate planar normal sections a…

Minimal surfaces with planar curvature lines in the Euclidean space have been studied since the late 19th century. On the other hand, the classification of maximal surfaces with planar curvature lines in the Lorentz-Minkowski space has only recently been given. In this paper, we use an alternative method not only to re…

Determine lens spaces as closures of homology cobordisms over planar surfaces.

We present definitions and properties of conformal Killing, Killing and planarity forms on a Riemannian manifold and determine Tachibana, Killing and planarity numbers as an analog of the well known Betti numbers. We state some set of conditions to characterize these numbers. Moreover, we formulate the main results on …

In a wide variety of situations, anomalies in the behaviour of a complex system, whose health is monitored through the observation of a random vector X = (X1,. .. , X d) valued in R d , correspond to the simultaneous occurrence of extreme values for certain subgroups $α$ $\subset$ {1,. .. , d} of variables Xj. Under th…

Study on planar graphs in Poincare model of hyperbolic geometry.

Study Stein fillings of planar contact 3-manifolds with relative trisection genus 2.

Finite simply connected 2-complexes with nonpositive planar curvature are collapsible.

New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.

In this paper we give two examples of sequences of embedded minimal planar domains in $\mathbb{R}^3$ which converge to singular laminations of $\mathbb{R}^3$. In contrast with the situation for embedded minimal disks, these examples do not arise from complete embedded minimal planar domains and highlight some of the su…

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of …

This paper classifies planar-Rips complexes and their unit disk graphs up to homotopy.

We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle…

We prove that every homomorphism from the fundamental group of a planar Peano continuum to the fundamental group of a planar or one-dimensional Peano continuum is induced by a continuous map up to conjugation. This is then used to provide a family of uncountable many planar Peano continua with pairwise non-isomorphic f…