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

Trend · papers per month

72144216288 · Jun 202019922001200920172026
48 results for intersection graphs

I answer an open question left by Gui-Song Li in "On self-intersections of immersed surfaces" (AMS Proceedings, Volume 126, 1998, pp.3721-3726.) The intersection graph M(i)M(i) of a generic surface i:FS3i:F \to S^3 is the set of values which are either singularities or intersections. It is a multigraph whose edges are trans…

2014-12-14abs ↗pdf ↗

We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this characterization to show that the intersection ring obstructs arbitrary three-manifolds from be…

2014-12-12abs ↗pdf ↗

We extend the notion of intersection graphs for knots in the theory of finite type invariants to string links. We use our definition to develop weight systems for string links via the adjacency matrix of the intersection graph, and show that these weight systems are related to the weight systems induced by the Conway a…

2003-12-17abs ↗pdf ↗

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loo…

1998-07-08abs ↗pdf ↗

In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.

2004-05-27abs ↗pdf ↗

We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with the Conway and HOMFLYPT polynomials. We extend these ideas to looking at a space o…

2000-04-12abs ↗pdf ↗

Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study…

2005-08-15abs ↗pdf ↗

We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. The converse statement is easy and well known. We discuss relationship between our results and certain Lie algebr…

2007-04-10abs ↗pdf ↗

Let Sg,pS_{g,p} denote the genus gg orientable surface with p0p \ge 0 punctures, and let ω(g,p)=3g+p4ω(g,p)= 3g+p-4. We prove the existence of infinitely long geodesic rays {v0,v1,v2,...}\left\{v_{0},v_{1}, v_{2}, ...\right\} in the curve graph satisfying the following optimal intersection property: for any natural number kk, the endpoints …

2013-10-17abs ↗pdf ↗

We derive various inequalities involving the intersection number of the curves contained in geodesics and tight geodesics in the curve graph. While there already exist such inequalities on tight geodesics, our method applies in the setting of geodesics. Furthermore, the method gives inequalities with a uniform constant…

2015-02-23abs ↗pdf ↗

Formula for volumes of odd strata of quadratic differentials using graph intersection numbers.

problem Calculating volumes of specific strata of quadratic differentials.
method Expressed volumes as a sum over stable graphs, with coefficients as intersection numbers of psi classes with combinatorial classes.
result Formula for volumes of odd strata of quadratic differentials.

Graph dynamics link combinatorics to geometry, revealing manifold intersections and stability.

problem Understanding the geometry of graph dynamical systems with odd interactions.
method Proved geometry and stability of manifolds governed by graph homology and coverings.
result Derived upper and lower bounds on the dimension of the equilibrium set.

We present an approach of computing the intersection curve C\mathcal{C} of two rational parametric surface §1(u,s)§_1(u,s) and §2(v,t)§_2(v,t), one being projectable and hence can easily be implicitized. Plugging the parametric surface to the implicit surface yields a plane algebraic curve G(v,t)=0G(v,t)=0. By analyzing the topology …

2012-03-02abs ↗pdf ↗

We obtain a coarse relationship between geometric intersection numbers of curves and the sum of their subsurface projection distances with explicit quasi-constants. By using this relationship, we give applications in the studies of the curve graphs and the mapping class groups.

2017-09-10abs ↗pdf ↗

We consider a system of three surfaces, graphs over a bounded domain in R2{\mathbb R}^2, intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to 2π/32π/3.) For the corresponding two-dimensional parabolic free boundary problem we pr…

2008-09-03abs ↗pdf ↗

Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of such curves admitting representatives that intersect at most k times. We prove that…

2019-12-16abs ↗pdf ↗

Study efficient geodesics in curve complex using dot graphs.

problem Characterize efficient geodesics in curve complexes.
method Introduced dot graphs to record intersection patterns and used them to prove existence and properties of efficient geodesics.
result The shape of dot graphs for efficient geodesics is contained within a spindle shape region, controlling curve coordinates.

We prove that on a closed surface of genus gg, the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is g2log(g)\lesssim g^2 \log(g). This bound matches the largest known constructions to within a logarithmic factor. The proof uses a probabilistic argument in graph th…

2018-07-16abs ↗pdf ↗

A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We show that irreducibility is preserved under certain deformations of embedded graphs…

2001-07-02abs ↗pdf ↗

Graph Laplacians adapt to different manifold dimensions, while Dirichlet energies converge to a tensorized Dirichlet energy.

problem Understanding machine learning methods for data with varying intrinsic dimensions.
method Γ-convergence of graph Dirichlet energies and spectral convergence of graph Laplacians on intersecting manifolds of varying dimensions.
result Normalized Dirichlet energy converges to a tensorized Dirichlet energy that adapts to all dimensions simultaneously.

The paper provides conditions for realizing graphs and polytopes with specified edge lengths.

problem Proving the existence of planar embeddings or polyhedra with specified edge lengths.
method Practical sufficient conditions and software verification for non-self-intersecting perturbations of initial realizations.
result Existence of planar embeddings and polyhedra with specified edge lengths.

We construct examples of CC^\infty smooth submanifolds in Cn{\Bbb C}^n and Rn{\Bbb R}^n of codimension 2 and 1, which intersect every complex, respectively real, analytic curve in a discrete set. The examples are realized either as compact tori or as properly imbedded Euclidean spaces, and are the graphs of quasianaly…

2004-02-23abs ↗pdf ↗

We show that under reasonable conditions, the spines of the handlebodies of a strongly irreducible Heegaard splitting will intersect a closed ball in a graph which is isotopic into the boundary of the ball. This is in some sense a generalization of the results by Scharlemann on how a strongly irreducible Heegaard split…

2004-11-03abs ↗pdf ↗

Study quasi-isometry invariants of square complexes and their applications.

problem Classifying quasi-isometry types of 2D right-angled Artin groups and graph 2-braid groups.
method Define and analyze intersection complexes for universal covers of weakly special square complexes.
result Discover new quasi-isometric relationships between graph 2-braid groups and right-angled Artin groups.

Defines quantum intersection number on pants decompositions and relates it to hyperbolic geometry.

problem Quantum and geometric intersection numbers on surfaces and 3-manifolds.
method Using asymptotic expansions of curve operators in skein theory, we define quantum intersection numbers and relate them to geometric intersection numbers and Teichmüller geometry.
result The pants graph equipped with a metric derived from quantum intersection numbers is quasi-isometric to the Teichmüller space with the Weil-Petersson metric.

SL(3,Z) contains subgroups whose intersection is not finitely generated.

problem Identifying subgroups of SL(3,Z) whose intersection is not finitely generated.
method Explicit construction of subgroups H and K, using Schreier graph of an affine action of a free group on Z^2.
result Intersection of two 2-generated subgroups H and K in SL(3,Z) is not finitely generated.

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeis…

2008-08-25abs ↗pdf ↗

We introduce a new series RkR_k, k=2,3,4,k=2,3,4,\dots, of integer valued weight systems. The value of the weight system RkR_k on a chord diagram is a signed number of cycles of even length 2k2k in the intersection graph of the diagram. We show that this value depends on the intersection graph only. We check that for small o…

2013-07-18abs ↗pdf ↗

Polynomial-time algorithm finds short non-orientable loops intersecting graph edges up to 30 times.

problem Finding short non-orientable loops intersecting graph edges efficiently.
method Combining computational biology techniques with recent graph theory results.
result Existence of short canonical non-orientable systems of loops.

We study arc graphs and curve graphs for surfaces of infinite topological type. First, we define an arc graph relative to a finite number of (isolated) punctures and prove that it is a connected, uniformly hyperbolic graph of infinite diameter; this extends a recent result of J. Bavard to a large class of punctured sur…

2015-10-27abs ↗pdf ↗

Study graph-based algorithms for multi-manifold clustering with sufficient conditions.

problem Clustering data from a union of manifolds with different dimensions and intersections.
method Investigate sufficient conditions for similarity graphs to capture geometric information.
result High probability error bounds for spectral approximation of tensorized Laplacian.

A planar graph is inscribable if it is combinatorial equivalent to the skeleton of a polyhedra which is inscribed in a sphere. For an inscribable graph, in its combinatorial equivalent class, if we could always find polyhedra inscribed in any given convex surface which is sufficiently close to the sphere, then we call …

2014-12-15abs ↗pdf ↗

This is an expository paper, in which we give a summary of some of the joint work of John Luecke and the author on Dehn surgery. We consider the situation where we have two Dehn fillings M(α)M(α) and M(β)M(β) on a given 3-manifold MM, each containing a surface that is either essential or a Heegaard surface. We show how a …

1997-04-17abs ↗pdf ↗

We show that there are minimal graphs in R^{n+1} whose intersection with the portion of the horizontal hyperplane contained in the unit ball has any prescribed geometry, up to a small deformation. The proof hinges on the construction of minimal graphs that are almost flat but have small oscillations whose geometry we c…

2016-02-16abs ↗pdf ↗

A standard fact about two incompressible surfaces in an irreducible 3-manifold is that one can move one of them by isotopy so that their intersection becomes π1π_1-injective. By extending it on the maps of some 3-dimensional Zn\mathbb{Z}_n-manifolds into 4-manifolds, we prove that any homotopy equivalence of 4-dimensio…

2005-04-12abs ↗pdf ↗