arXiv research

Anisotropic curvature flow studied for planar networks.

The article analyzes the stability of a curve shortening flow for planar networks.

Uniqueness of nondegenerate blowups for planar networks shown.

We prove that the curvature flow of an embedded planar network of three curves connected through a triple junction, with fixed endpoints on the boundary of a given strictly convex domain, exists smooth until the lengths of the three curves stay far from zero. If this is the case for all times, then the evolution exists…

Deep learning approximates geometric measures of planar curves.

We prove the existence of the flow by curvature of regular planar networks starting from an initial network which is non-regular. The proof relies on a monotonicity formula for expanding solutions and a local regularity result for the network flow in the spirit of B. White's local regularity theorem for mean curvature …

Learning image transformations is essential to the idea of mental simulation as a method of cognitive inference. We take a connectionist modeling approach, using planar neural networks to learn fundamental imagery transformations, like translation, rotation, and scaling, from perceptual experiences in the form of image…

We study the curvature flow of planar nonconvex lens-shaped domains, considered as special symmetric networks with two triple junctions. We show that the evolving domain becomes convex in finite time; then it shrinks homothetically to a point. Our theorem is the analog of the result of Grayson for curvature flow of clo…

In this work, we introduce the Global Planar Convolution module as a building-block for fully-convolutional networks that aggregates global information and, therefore, enhances the context perception capabilities of segmentation networks in the context of brain tumor segmentation. We implement two baseline architecture…

Classifies pinned $p$-elasticae and finds unique optimality exponents.

We present a collection of results on the evolution by curvature of networks of planar curves. We discuss in particular the existence of a solution and the analysis of singularities.

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

We prove the existence of self-similar expanding solutions of the curvature flow on planar networks where the initial configuration is any number of half-lines meeting at the origin. This generalizes recent work by Schnürer and Schulze which treats the case of three half-lines. There are multiple solutions, and these a…

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

We consider planar networks of three curves that meet at two junctions with prescribed equal angles, minimizing a combination of the elastic energy and the length functional. We prove existence and regularity of minimizers, and we show some properties of the minimal configurations.

The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…

We introduce a graphical calculus for computing morphism spaces between the categorified spin networks of Cooper and Krushkal. The calculus, phrased in terms of planar compositions of categorified Jones-Wenzl projectors and their duals, is then used to study the module structure of spin networks over the colored unknot…

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.

The paper proves stability and convergence of minimal networks under curvature motion.

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…

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one, implies that the perfect matching is even and therefore the graph is 4-face color…

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 …

Study on planar graphs in Poincare model of hyperbolic geometry.

The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks are included.

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 …

The effectiveness of Convolutional Neural Networks stems in large part from their ability to exploit the translation invariance that is inherent in many learning problems. Recently, it was shown that CNNs can exploit other invariances, such as rotation invariance, by using group convolutions instead of planar convoluti…