Virtual knots with same writhe polynomial have equivalent intersection graphs.
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.
Trend · papers per month
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 of a generic surface is the set of values which are either singularities or intersections. It is a multigraph whose edges are trans…
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…
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…
Study properties of self-similar continua with finite intersection property.
New method for efficient graph learning on large graphs.
We study graphs of (generalized) joins and intersections of finitely generated subgroups of a free group. We show how to disprove a lemma of Imrich and Müller on these graphs and how to repair this lemma.
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…
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.
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…
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…
Classifies certain graph 2-braid groups up to quasi-isometry.
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…
The purpose of this article is to point out a mistake in the published paper "Graphs of hyperbolic groups and limit set intersection theorem- Proc AMS, vol 146, no 5, pp 1859--1871, which subsequently weakens the main theorem of that paper. We state and prove a weaker result in this note.
Let denote the genus orientable surface with punctures, and let . We prove the existence of infinitely long geodesic rays in the curve graph satisfying the following optimal intersection property: for any natural number , the endpoints …
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…
Formula for volumes of odd strata of quadratic differentials using graph intersection numbers.
New graphs show hierarchical hyperbolic properties, extending previous work.
Graph dynamics link combinatorics to geometry, revealing manifold intersections and stability.
We present an approach of computing the intersection curve of two rational parametric surface and , one being projectable and hence can easily be implicitized. Plugging the parametric surface to the implicit surface yields a plane algebraic curve . By analyzing the topology …
We give upper bounds, linear in rank, to the topological dimensions of the Gromov boundaries of the intersection graph, the free factor graph and the cyclic splitting graph of a finitely generated free group.
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.
We consider a system of three surfaces, graphs over a bounded domain in , intersecting along a time-dependent curve and moving by mean curvature while preserving the pairwise angles at the curve of intersection (equal to .) For the corresponding two-dimensional parabolic free boundary problem we pr…
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…
Study efficient geodesics in curve complex using dot graphs.
We prove that on a closed surface of genus , the cardinality of a set of simple closed curves in which any two are non-homotopic and intersect at most once is . This bound matches the largest known constructions to within a logarithmic factor. The proof uses a probabilistic argument in graph th…
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…
Minor changes in the exposition and small corrections on the previous version.
Graphs of multicurves are hyperbolic, relatively hyperbolic, or thick.
Graph Laplacians adapt to different manifold dimensions, while Dirichlet energies converge to a tensorized Dirichlet energy.
The paper provides conditions for realizing graphs and polytopes with specified edge lengths.
We construct examples of smooth submanifolds in and 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…
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…
Study quasi-isometry invariants of square complexes and their applications.
Defines quantum intersection number on pants decompositions and relates it to hyperbolic geometry.
Automorphisms of fine 1-curve graph linked to surface homeomorphisms.
Geometric approach clusters intersecting manifolds with high probability.
SL(3,Z) contains subgroups whose intersection 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…
We introduce a new series , , of integer valued weight systems. The value of the weight system on a chord diagram is a signed number of cycles of even length in the intersection graph of the diagram. We show that this value depends on the intersection graph only. We check that for small o…
Polynomial-time algorithm finds short non-orientable loops intersecting graph edges up to 30 times.
Sharp upper bound for minimal graph area in unit ball established.
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…
Study graph-based algorithms for multi-manifold clustering with sufficient conditions.
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 …
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 and on a given 3-manifold , each containing a surface that is either essential or a Heegaard surface. We show how a …
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…
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 -injective. By extending it on the maps of some 3-dimensional -manifolds into 4-manifolds, we prove that any homotopy equivalence of 4-dimensio…