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

73146218291 · Jun 202019922001200920172026
48 results for complement graph

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.

Graphs and their complements are intrinsically knotted.

problem Characterizing maximal linklessly embeddable graphs and their complements.
method Analyzing maximal linklessly embeddable graphs, deriving connected domination numbers, and proving intrinsic knotting properties.
result Complements of maximal linklessly embeddable graphs of order 12 and 15 are intrinsically knotted.

We show that given a trivalent graph in S3S^3, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of Thompson to graphs. It follows that any graph complement always contains a useful p…

2008-07-17abs ↗pdf ↗

For a finite simplicial graph ΓΓ, let A(Γ)A(Γ) denote the right-angled Artin group on ΓΓ. Recently Kim and Koberda introduced the extension graph ΓeΓ^e for ΓΓ, and established the Extension Graph Theorem: for finite simplicial graphs Γ1Γ_1 and Γ2Γ_2 if Γ1Γ_1 embeds into Γ2eΓ_2^e as an induced subgraph then A(Γ1)A(Γ_1) emb…

2017-06-30abs ↗pdf ↗

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.

A new method for efficient portfolio optimization using graph structures.

problem Optimizing portfolio weights while reducing computational complexity.
method Hierarchical graph structures and Schur complement method.
result Optimal portfolio weights can be computed efficiently by inverting small submatrices.

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the complement of the graph bounds the graph distance of the bridge surface. We use this r…

2017-06-01abs ↗pdf ↗

Circle graph automorphisms match circle's and are strongly universal.

problem Identifying the automorphism group of the circle.
method Proving the circle graph's automorphism group coincides with the circle's and showing the circle graph's rational chords form a strongly universal element.
result The circle graph's automorphism group is strongly universal.

A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an initial classification of such manifolds has been obtained up to 8 vertices of th…

2016-09-08abs ↗pdf ↗

We study the fibration of augmented link complements. Given the diagram of an augmented link we associate a spanning surface and a graph. We then show that this surface is a fiber for the link complement if and only if the associated graph is a tree. We further show that fibration is preserved under Dehn filling on cer…

2011-09-14abs ↗pdf ↗

This paper is a survey of some of the most elementary consequences of the JSJ-decomposition and geometrization for knot and link complements in the 3-sphere. Formulated in the language of graphs, the result is the construction of a bijective correspondence between the isotopy classes of links in S3S^3 and a class of ve…

2005-06-25abs ↗pdf ↗

Let TT be a graph in a compact, orientable 3--manifold MM and let ΓΓ be a subgraph. TT can be placed in bridge position with respect to a Heegaard surface HH. We show that if HH is what we call (T,Γ)(T,Γ)-c-weakly reducible in the complement of TT then either a "degenerate" situation occurs or HH can be untelescop…

2009-10-17abs ↗pdf ↗

We study the gordian graph of all knots in R3\R^3: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement of any finite subset is connected.

2005-03-08abs ↗pdf ↗

Let FgF_g denote a closed oriented surface of genus gg. A set of simple closed curves is called a filling of FgF_g if its complement is a disjoint union of discs. The mapping class group Mod(Fg)\text{Mod}(F_g) of genus gg acts on the set of fillings of FgF_g. The union of the curves in a filling forms a graph on the surfa…

2015-03-16abs ↗pdf ↗

This paper is devoted to the study of convergence of sequences of solutions to the constant mean curvature H equation. The convergence domain is defined. The main Theorem characterizes the complement of this convergence domain: it shows that circle arcs of curvature 2H compose this complement. We then give results whic…

2005-09-21abs ↗pdf ↗

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 ↗

This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study of knot polynomial invariants (A- or B-adequacy), we prove that the growth of the…

2011-08-16abs ↗pdf ↗

New curvature tensor and matrices for connection graphs derived from Bakry-Émery curvature.

problem Deriving Buser-type bounds on eigenvalues of connection Laplacians.
method Reformulation of Bakry-Émery curvature through curvature matrices and tensor representations.
result Extension of curvature matrices to connection graphs, addressing eigenfunction challenges.

The splitting number is effective to distinguish the embedded topology of plane curves, and it is not determined by the fundamental group of the complement of the plane curve. In this paper, we give a generalization of the splitting number, called the splitting graph. By using the splitting graph, we classify the embed…

2018-03-06abs ↗pdf ↗

In this paper, we study on knots and closed incompressible surfaces in the 3-sphere via Morse functions. We show that both of knots and closed incompressible surfaces can be isotoped into a "related Morse position" simultaneously. As an application, we have following results. *Smallness of Montesinos tangles with lengt…

2005-03-18abs ↗pdf ↗

We prove that the expectation value of the index function i(x) over a probability space of injective function f on any finite simple graph G=(V,E) is equal to the curvature K(x) at the vertex x. This result complements and links Gauss-Bonnet sum K(x) = chi(G) and Poincare-Hopf sum i(x) = chi(G) which both hold for arbi…

2012-02-21abs ↗pdf ↗

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

2015-06-19abs ↗pdf ↗

This note is about the geometry of the pants graph P(S), a natural simplicial graph associated to a finite type topological surface S where vertices represents pants decompositions. The main result in this note ascserts that for a multicurve Q whose complement is a number of subsurfaces of complexity at most 1. We prov…

2013-06-13abs ↗pdf ↗

New metrics improve uncertainty estimation on graph data.

problem Current GNNs focus only on nodewise scores, limiting uncertainty estimation.
method Proposed edgewise metrics for uncertainty estimation on graphs.
result GNN models with structured prediction perform better in uncertainty estimation.

We present a graph manifold analog of the Jankins-Neumann classification of Seifert fibered spaces over S2S^2 admitting taut foliations, providing a finite recursive formula to compute the L-space Dehn-filling interval for any graph manifold with torus boundary. As an application of a generalization of this result to F…

2015-11-13abs ↗pdf ↗

We give a short proof of the following theorem of Sang-hyun Kim: if A(Γ)A(Γ) is a right-angled Artin group with defining graph ΓΓ, then A(Γ)A(Γ) contains a hyperbolic surface subgroup if ΓΓ contains an induced subgraph Cˉn\bar{C}_n for some n5n \geq 5, where Cˉn\bar{C}_n denotes the complement graph of an nn-cycle. Furthe…

2010-12-19abs ↗pdf ↗

New method shows pseudo-Anosov flows on graph manifolds can be simplified.

problem Understanding pseudo-Anosov flows on graph manifolds.
method Constructing a partial Birkhoff section with genus one components that misses finitely many closed orbits.
result Every pseudo-Anosov flow on a graph manifold is almost equivalent to a totally periodic flow or a suspension Anosov flow.

The generalized volume conjecture and the AJ conjecture (a.k.a. the quantum volume conjecture) are extended to $U_q(\fraksl_2)$ colored quantum invariants of the theta and tetrahedron graph. The $\SL(2,\bC)$ character variety of the fundamental group of the complement of a trivalent graph with EE edges in S3S^3 is a L…

2014-04-21abs ↗pdf ↗

Proposes a graph pooling method leveraging node proximity for hierarchical graph representation learning.

problem Efficiently exploiting the geometry of graph data for hierarchical representation learning.
method Combines node proximity with kernel representation of topology and node features for adaptive node signal similarities evaluation.
result Achieves state-of-the-art performance on graph classification benchmark datasets.

We consider compact 3-manifolds M having a submersion h to R in which each generic point inverse is a planar surface. The standard height function on a submanifold of the 3-sphere is a motivating example. To (M, h) we associate a connectivity graph G. For M in the 3-sphere, G is a tree if and only if there is a Fox rei…

2003-04-19abs ↗pdf ↗

In this article, we determine the function (Sg,p)\ell(S_{g, p}) such that the right-angled Artin group G(Pm)G(P_{m}) is embedded in the mapping class group Mod(Sg,p)\mathrm{Mod}(S_{g, p}) if and only if mm is not more than (Sg,p)\ell(S_{g, p}). Using this function and Birman--Hilden theory, we prove that Mod(S0,p)\mathrm{Mod}(S_{0, p}) is vir…

2018-04-10abs ↗pdf ↗