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,786 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Dec 199319922001200920172026
48 results for planar points

In this paper we prove a universal inequality describing the asymptotic behavior of support points for planar continuous curves. As corollaries we get an analogous result for tangent points of differentiable planar curves and some (partially known) assertions on the asymptotic of the mean value points for various class…

2010-07-01abs ↗pdf ↗

Analyzes branch points of area-minimizing currents with non-2 planar frequency.

problem Understanding the structure of area-minimizing currents near branch points.
method Intrinsic frequency function and geometric arguments avoiding center manifolds.
result Establishes higher order asymptotics and topological control near branch points.

Fix a finite set of points in Euclidean nn-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an easily-computed but high-dimensional approximation to the homotopy type of DD. …

2007-12-03abs ↗pdf ↗

Study of pursuit-evasion game on sphere and its relation to planar Apollonius circle.

problem Analyzing pursuit-evasion game on a sphere and its properties.
method Extending classical planar pursuit-evasion game to spherical geometry, studying equilibrium intercept points and their relation to Apollonius domain.
result Condition for intercept point to belong to Apollonius domain on sphere, analogous to planar game.

We consider the solid angle that a planar compact subset subtends at a point in a level set of height h and study two extremal problems for the solid angle. One of the variables is a point in such a plane, that is, we study the properties of the solid angle maximizer. The other is the pair of a planar compact subset an…

2011-03-09abs ↗pdf ↗

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 ↗

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 ↗

A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space to the 2-space. In this paper we show that if a generic immersion of a planar g…

2008-08-29abs ↗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 introduce two invariants called sl(3) Khovanov module and pointed sl(3) Khovanov homology for spatial webs (bipartite trivalent graphs). Those invariants are related to Kronheimer-Mrowka's instanton invariants JJ^\sharp and II^\sharp for spatial webs by two spectral sequences. As an application of the spectral seq…

2018-09-13abs ↗pdf ↗

The paper classifies vertices in planar polygons formed by convex domains.

problem Classifying vertices in planar polygons formed by convex domains.
method Analyzing polygons formed by homothets and translates of a convex domain.
result The number of singular boundary points in a CC-polygon is between nn and 2(n1)+m2(n-1)+m for a strictly convex domain with mm singular boundary points.

Minimal surfaces with planar curvature lines are classical geometric objects, having been studied since the late 19th century. In this paper, we revisit the subject from a different point of view. After calculating their metric functions using an analytical method, we recover the Weierstrass data, and give clean parame…

2016-06-06abs ↗pdf ↗

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…

2009-05-31abs ↗pdf ↗

The secant caustic of a planar curve MM is the image of the singular set of the secant map of MM. We analyse the geometrical properties of the secant caustic of a planar curve, i.e. the number of branches of the secant caustic, the parity of the number of cusps and the number of inflexion points in each branch of thi…

2018-02-28abs ↗pdf ↗

In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In addition, in the appendix by K. Sackel the F(q)-rational points of its graded a…

2017-05-02abs ↗pdf ↗

Gronwall conjecture states that a planar 3-web which admits more than one distinct linearization is locally equivalent to an algebraic web. We give a partial answer to the conjecture in the affirmative for the class of planar 3-webs with the web curvature that vanishes to order three at a point. The differential relati…

2011-02-01abs ↗pdf ↗

The self intersection of an immersion i : S^2 \to R^3 dissects S^2 into pieces which are planar surfaces (unless i is an embedding). In this work we determine what collections of planar surfaces may be obtained in this way. In particular, for every n we construct an immersion i : S^2 \to R^3 with 2n triple points, for …

2006-12-27abs ↗pdf ↗

The oriented area function AA is (generically) a Morse function on the space of planar configurations of a polygonal linkage. We are lucky to have an easy description of its critical points as cyclic polygons and a simple formula for the Morse index of a critical point. However, for planar polygons, the function AA i…

2012-01-02abs ↗pdf ↗

This paper defines ribbons and ribbon complexes in CW spaces and analyzes their topological properties.

problem Characterizing and analyzing topological structures in CW spaces.
method Introducing planar ribbons, ribbon complexes, and ribbon nerves in Alexandroff-Hopf-Whitehead CW spaces, and studying their topological properties.
result Characterization of ribbons and ribbon nerves by Betti numbers and homotopy types.

The paper introduces a θ-family of spacelike minimal surfaces in R^4_1.

problem Tackles the construction and properties of spacelike minimal surfaces in R^4_1.
method Introduces a θ-family of surfaces based on holomorphic functions and studies their curvature.
result Proves that the existence of planar points corresponds to solutions of |a_w(w)|^2 =0 and that surfaces cannot be complete.

Using Chebyshev polynomials combined with some mild combinatorics, we provide a new formula for the analytical planar limit of a random matrix model with a one-cut potential VV. For potentials V(x)=x2/2n1anxn/nV(x)=x^{2}/2-\sum_{n\ge1}a_{n}x^{n}/n, as a power series in all ana_{n}, the formal Taylor expansion of the analytic planar …

2010-10-05abs ↗pdf ↗

Study on singularities of area-minimizing currents, focusing on frequency and branch points.

problem Understanding the nature of singular points in area-minimizing currents.
method Intrinsic frequency function and decomposition theorem for singular set.
result Established properties of the planar frequency function and decomposition of singular set.

We give a simple, combinatorial construction of a unital, spherical, non-degenerate \ast-planar algebra over the ring Z[q1/2,q1/2]\mathbb{Z}[q^{1/2},q^{-1/2}]. This planar algebra is similar in spirit to the Temperley-Lieb planar algebra, but computations show that they are different. The construction comes from the combinator…

2014-01-21abs ↗pdf ↗

In this paper we solve the following problem in the affirmative: Let ZZ be a continuum in the plane $\complex$ and suppose that $h:Z\times [0,1]\to\complex$ is an isotopy starting at the identity. Can hh be extended to an isotopy of the plane? We will provide a new characterization of an accessible point in a planar …

2008-11-03abs ↗pdf ↗

Uniqueness of nondegenerate blowups for planar networks shown.

problem Uniqueness of nondegenerate blowups for the motion by curvature of planar networks.
method Proof based on Lojasiewicz-Simon gradient inequality applied to stability properties of critical points of the length functional.
result Uniqueness of nondegenerate compact blowups for the motion by curvature of planar networks.

We discuss discretization of Koenigs nets (conjugate nets with equal Laplace invariants) and of isothermic surfaces. Our discretization is based on the notion of dual quadrilaterals: two planar quadrilaterals are called dual, if their corresponding sides are parallel, and their non-corresponding diagonals are parallel.…

2007-09-21abs ↗pdf ↗

We study the Orchard relation for generic configurations of points in the plane (also called order types). We introduce infinitesimally-close points and analyse the relation of this notion with the Orchard relation. The second part of the paper deals with monochromatic configurations (for the Orchard relation). We give…

2002-10-03abs ↗pdf ↗

New method realizes planar graphs as Reeb graphs of algebraic functions.

problem Realizing planar graphs as Reeb graphs of algebraic functions.
method Generic embedding and elementary procedures.
result Generically embedded planar graphs are homeomorphic to Reeb graphs of algebraic functions.

We give a criterion when a planar tree-like curve, i.e. a generic immersed plane curve each double point of which cuts it into two disjoint parts, can be send by a diffeomorphism of the plane onto a curve with no inflection points. We also present some upper and lower bounds for the minimal number of inflection points …

1997-08-12abs ↗pdf ↗