Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

481216 · May 202619922001200920172026
48 results for planar

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 n1n\geq 1, we show that a (2n+1)(2n+1)-dimensional contact manifold MM suppor…

2017-10-20abs ↗pdf ↗

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

problem Quasi-transitive graphs quasi-isometric to planar graphs need to be upgraded to Cayley graphs.
method Upgrading a planar graph to a Cayley graph.
result Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.

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…

2006-05-04abs ↗pdf ↗

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…

2006-03-03abs ↗pdf ↗

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

2016-08-05abs ↗pdf ↗

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

problem Characterizing the structure of complements of planar graphs.
method Analyzing the structure of complements of non-separating planar graphs and using examples to illustrate hypotheses.
result The order 2n-3 is the lowest possible for a non-separating planar graph whose complement contains a K_n minor.

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

problem Diagrammatic presentation of generators and relations for E7E_7 subfactor planar algebra.
method Diagrammatic presentation and proof of well-definedness of jellyfish algorithm.
result Jellyfish algorithm is a well-defined surjection onto C for E7E_7 subfactor planar algebra.

Compact Special Weingarten surfaces with planar convex boundaries are disks.

problem Characterizing Special Weingarten surfaces with specific boundary conditions.
method Proved a Ros-Rosenberg theorem in the context of Special Weingarten surfaces.
result Compact Special Weingarten surfaces with planar convex boundaries are topological 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 33- space has degenerate planar normal sections. Then we study lightlike surfaces with non-degenerate planar normal sections a…

2013-01-24abs ↗pdf ↗

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

problem Classify Stein fillings of planar contact 3-manifolds under constraints on their relative trisections.
method Partial classification of diffeomorphism types of fillings with relative trisections of genus at most 2.
result Partially classify the diffeomorphism types of Stein fillings with relative trisections of genus at most 2.

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

problem Understanding the collapsibility of 2-complexes with specific curvature properties.
method Analyzing the fundamental groups and sectional curvatures of 2-complexes.
result 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.

problem Understanding linkability and knotability of graph complements.
method Using maximal non-separating planar graphs to construct examples of maximal linkless and knotless graphs, and analyzing their Colin de Verdière invariant.
result The Colin de Verdière invariant of the complement of a maximal non-separating planar graph satisfies μ(cG) ≤ n-4, and equality holds.

In this paper we give two examples of sequences of embedded minimal planar domains in R3\mathbb{R}^3 which converge to singular laminations of R3\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…

2011-07-19abs ↗pdf ↗

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 …

2015-02-03abs ↗pdf ↗

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

problem Classifying planar-Rips complexes and their unit disk graphs.
method Simplicial classification, homotopy equivalence, and hereditary properties.
result Classification of planar-Rips complexes and 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…

2019-02-04abs ↗pdf ↗

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…

2013-05-18abs ↗pdf ↗

In his 1930 paper, Kuratowksi categorized planar graphs, proving that a finite graph ΓΓ is planar if and only if it does not contain a subgraph that is homeomorphic to K5K_5, the complete graph on 5 vertices, or K3,3K_{3,3}, the complete bipartite graph on six vertices. In their 2001 paper, Davis and Okun point out that…

2011-10-05abs ↗pdf ↗

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 …

2010-11-15abs ↗pdf ↗

Spatial embeddings of planar graphs can have higher unknotting numbers than crossing numbers.

problem Understanding the relationship between unknotting numbers and crossing numbers of spatial embeddings of planar graphs.
method Analyzing specific examples of planar graphs and their spatial embeddings to find counterexamples.
result There exist planar graphs and their spatial embeddings where the unknotting number is greater than half the crossing number.

The study extends Tutte's conflict graph concept to nonplanar graphs.

problem Understanding the structure of nonplanar graphs through conflict graphs.
method Defining a signed conflict graph for maximally planar subgraphs and analyzing their balance.
result For graphs with a flat embedding, every maximal planar subgraph has unbalanced conflict graphs if and only if the graph is intrinsically linked.

We define a computable topological invariant μ(γ)μ(γ) for generic closed planar regular curves γγ, which gives an effective lower bound for the number of inflection points on a given generic closed planar curve. Using it, we classify the topological types of locally convex curves (i.e. closed planar regular curves witho…

2011-03-17abs ↗pdf ↗

New method for sensing non-planar surfaces using ERT.

problem Limited computational techniques for planar surfaces in ERT-based sensing skins.
method Generalized ERT to non-planar surfaces using Riemannian geometry.
result Feasibility and applicability of ERT-based sensing skins for non-planar geometries demonstrated.