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

Trend · papers per month

24487195 · Jun 202019922001200920172026
48 results for plane trees

Counting HCMU sphere components using weighted trees.

problem Counting components of moduli space of HCMU spheres.
method Using weighted plane trees to characterize HCMU spheres with a single integral conical angle, and an explicit counting formula is derived.
result An explicit counting formula for the components of the moduli space of HCMU spheres.

Asymptotic subcone of an unbounded metric space is another metric space, capturing the structure of the original space at infinity. In this paper we define a functional metric space S which is an asymptotic subcone of the hyperbolic plane. This space is a real tree branching at every its point. Moreover, it is a homoge…

1998-06-19abs ↗pdf ↗

Paper introduces clock moves for plane graphs and proves Alexander polynomial properties.

problem Alexander polynomial of plane graphs and unimodality of coefficients.
method Introduces clock moves for plane graphs and develops a spanning tree model of Alexander polynomial.
result Proves unimodal property of Alexander polynomial coefficients and confirms conjectures.

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 ↗

The study proves a conjecture about arborescent links with many twigs.

problem Proving the meridional rank conjecture for arborescent links.
method Using an upper bound on the bridge number in terms of the maximal number of link components of the underlying tree.
result Proves the meridional rank conjecture for arborescent links with specific properties.

Study on inflection points of plane curve shadows with fixed embedded shapes.

problem Minimum number of inflection points in plane curves with fixed embedded shadows.
method Finite coorientation problem on building polygons, dynamic programming, universal lower bound, tree-necklace shadows.
result Exact formula for minimum number of normalized inflections for tree-like shadows.

Let FF be a non-singular foliation on the plane with all leaves being closed subsets, H+(F)H^{+}(F) be the group of homeomorphisms of the plane which maps leaves onto leaves endowed with compact open topology, and H0+(F)H^{+}_{0}(F) be the identity path component of H+(F)H^{+}(F). The quotient $π_0 H^{+}(F) = H^{+}(F)/H^{+}_{0}…

2016-07-14abs ↗pdf ↗

We study periodic wind-tree models, billiards in the plane endowed with Z2\mathbb{Z}^2-periodically located identical connected symmetric right-angled obstacles. We show asymptotic formulas for the number of (isotopy classes of) closed billiard trajectories (up to Z2\mathbb{Z}^2-translations) on the wind-tree billiard.…

2016-04-19abs ↗pdf ↗

Study of circle configurations in the plane, proving aspherical space and computing fundamental groups.

problem Understanding the space of configurations of circles in the plane.
method Proved the space is aspherical and computed fundamental groups of its components.
result Fundamental groups are iterated semidirect products of braid groups, with structure dictated by a finite rooted tree.

Among all torus links, we characterise those arising as links of simple plane curve singularities by the property that their fibre surfaces admit only a finite number of cutting arcs that preserve fibredness. The same property allows a characterisation of Coxeter-Dynkin trees (i.e., AnA_n, DnD_n, E6E_6, E7E_7 and E8E_8

2014-09-02abs ↗pdf ↗

To every tree we associate a filtered cochain complex. Its cohomology and the corresponding spectral sequence have clear combinatorial description. If a tree is the Dynkin diagram of a simple plane curve singularity, the graded Euler characteristic of this complex coincides with the Alexander polynomial of the link. In…

2009-01-09abs ↗pdf ↗

We deduce from a rooted tree in the disk a slalom divide and a slalom knot. A slalom knot is either the local link of a simple plane curve singularity of type A_2n, E_6, E_8 or a fibered hyperbolic knot with very special monodromy.

1999-06-13abs ↗pdf ↗

We introduce a new spatial data structure for high dimensional data called the \emph{approximate principal direction tree} (APD tree) that adapts to the intrinsic dimension of the data. Our algorithm ensures vector-quantization accuracy similar to that of computationally-expensive PCA trees with similar time-complexity…

2012-06-18abs ↗pdf ↗

This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…

2010-11-16abs ↗pdf ↗

Let SS be a projective plane with 33 holes. We prove that there is an exhaustion of the curve complex C(S)\mathcal{C}(S) by a sequence of finite rigid sets. As a corollary, we obtain that the group of simplicial automorphisms of C(S)\mathcal{C}(S) is isomorphic to the mapping class group Mod(S)\mathrm{Mod}(S). We also prove …

2019-07-21abs ↗pdf ↗

We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly dd are of the same color. The problem depends on dd and, following a strategy of Kloeckner, we show…

2017-01-30abs ↗pdf ↗

New system studies trapped light paths in Euclidean space.

problem Trapping of light paths in Euclidean space with negative refractive index.
method Introduces wind-tree tiling billiards system to study trajectories of rays in Euclidean space with rectangular obstacles.
result Almost every configuration of the system traps trajectories with initial vertical direction in an infinite strip.

Classifies pseudo-Anosov flows on 3-manifolds up to orbit equivalence.

problem Classifying pseudo-Anosov flows on 3-manifolds up to orbit equivalence.
method Generalized Anosov-like actions on bifoliated planes, ideal boundary analysis.
result Pseudo-Anosov flows on 3-manifolds are determined up to orbit equivalence by their ideal boundary actions.

New connection found between complex polynomials and surface homeomorphisms.

problem Investigating the existence of generalized pseudo-Anosov maps from quadratic polynomials.
method Developed a new connection between dynamics of quadratic polynomials and surface homeomorphisms, focusing on Hubbard trees.
result Identified conditions for constructing generalized pseudo-Anosov maps from quadratic polynomials.

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally oriented. There are many natural classes of examples: links of singularities; links at…

2004-11-05abs ↗pdf ↗

We describe in this paper a geometric construction in the projective p-adic plane that gives, together with a suitable notion of p-adic convexity, some open subsets of P 2 .Q p / naturally endowed with a "Hilbert" distance and a transitive action of PGL.2; Q p / by isometries. ese open sets are natural analogues of the…

2016-10-04abs ↗pdf ↗

We associate an open book with any connected plane checkerboard graph, thus providing a common extension of the classes of prime positive braid links and positive tree-like Hopf plumbings. As an application, we prove that the link type of a prime positive braid closure is determined by the linking graph associated with…

2017-06-28abs ↗pdf ↗

We introduce an efficient method for training the linear ranking support vector machine. The method combines cutting plane optimization with red-black tree based approach to subgradient calculations, and has O(m*s+m*log(m)) time complexity, where m is the number of training examples, and s the average number of non-zer…

2010-05-06abs ↗pdf ↗

Researchers create a new compactification of character varieties using geometric and algebraic methods.

problem Compactifying character varieties of finitely generated groups in PSL2(R)\mathrm{PSL}_2(\mathbb{R}).
method Geometric interpretation of elements of the real spectrum compactification as Γ-actions on R\mathbb{R}-trees, endowed with an orientation.
result Continuous surjection from real spectrum compactification to oriented Gromov equivariant compactification.

The goal of this paper is to measure the non-convexity of compact and smooth connected components of real algebraic plane curves. We study these curves first in a general setting and then in an asymptotic one. In particular, we consider sufficiently small levels of a real bivariate polynomial in a small enough neighbou…

2019-07-19abs ↗pdf ↗

We introduce the notion of strip complex. A strip complex is a special type of complex obtained by gluing "strips" along their natural boundaries according to a given graph structure. The most familiar example is the one dimensional complex classically associated with a graph, in which case the strips are simply copies…

2009-03-20abs ↗pdf ↗

We give a complete list of the cobounded actions of solvable Baumslag-Solitar groups on hyperbolic metric spaces up to a natural equivalence relation. The set of equivalence classes carries a natural partial order first introduced by Abbott-Balasubramanya-Osin, and we describe the resulting poset completely. There are …

2019-06-10abs ↗pdf ↗

Space partitioning methods such as random forests and the Mondrian process are powerful machine learning methods for multi-dimensional and relational data, and are based on recursively cutting a domain. The flexibility of these methods is often limited by the requirement that the cuts be axis aligned. The Ostomachion p…

2019-06-13abs ↗pdf ↗

Random hyperbolic surfaces with punctures converge to the Brownian sphere.

problem Understanding the geometry of random hyperbolic surfaces with punctures.
method Rescaling and encoding via plane trees with continuous labels.
result Rescaled random hyperbolic surfaces converge to the Brownian sphere.

We characterize those unions of embedded disjoint circles in the 2-sphere which can be the multiple point set of a generic immersion of the 2-sphere into 3-dimensional space in terms of the interlacement of the given circles. Our result is the one higher dimensional analogue of Rosenstiehl's characterization of words b…

2017-04-19abs ↗pdf ↗

Improved linear upper bound for ribbonlength of knots.

problem Estimating the ribbonlength of knots and links.
method Using four-page open book decompositions and spanning trees of checkerboard graphs, constructing a four-page presentation with at most 2c(K) arcs.
result Proved that ribbonlength is bounded above by the four-page index, leading to the linear bound Rib(K) ≤ 2c(K).

New spectral conditions ensure graph rigidity and global rigidity in the Euclidean plane.

problem Ensuring graph rigidity and global rigidity in the Euclidean plane.
method Improving algebraic connectivity bounds for graph rigidity and global rigidity.
result Every 6-connected graph is rigid and globally rigid if its algebraic connectivity exceeds specific thresholds.