The paper extends Heegaard Floer homology to spatial graphs.
problem Tackling the homology of transverse spatial graphs.
method Defining graph grid diagrams and proving their equivalence under moves, constructing chain complexes and showing invariance.
result Alexander-type polynomials and torsion invariants for transverse spatial graphs.
New τ invariant for balanced spatial graphs, extending knot concordance invariant.
problem Defining a concordance invariant for spatial graphs.
method Combinatorial definition and Heegaard Floer homology theory.
result Well-defined τ invariant for balanced spatial graphs and links.
Grid homology properties for MOY graphs studied.
problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.
New Alexander polynomial defined for transverse graphs.
problem Defining a polynomial invariant for transverse graphs.
method Rotation number extension and multi-variable Alexander polynomial.
result Invariant coincides with Uq(gl(1∣1))-Alexander polynomial. Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
Survey of recent spatial graph theory results.
problem Understanding knotting and symmetries in spatial graphs.
method Analyzes recent results in spatial graph theory.
result Highlights recent findings on knotting and symmetries.
New invariants distinguish spatial graphs not previously possible.
problem Distinguishing spatial graphs using Dehn colorings.
method Developed vertex-weight invariants based on Dehn colorings.
result Found spatial graphs distinguishable by vertex-weight invariants.
Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
Grid homology theory for spatial graphs extends skein sequence.
problem No specific problem stated; focuses on extending a sequence.
method Defined grid homology theory for spatial graphs and extended skein sequence.
result Skein exact sequence extended to grid homology for spatial graphs.
Formulae for Yamada polynomial of spatial graphs are derived from edge replacements.
problem Computing Yamada polynomial for spatial graphs formed by edge replacements.
method Formulae derived from edge replacements of plane graphs.
result Zeros of Yamada polynomials of certain spatial graphs are dense in a complex plane region.
Review of invariants for spatial graphs.
problem No specific problem stated; review of existing invariants.
method Combinatorial and polynomial invariants of spatial graphs.
result Overview of Alexander polynomial, fundamental quandle, and Yamada polynomial.
Defines concordance for spatial graphs and proves sliceness equivalence.
problem Understanding concordance and sliceness for spatial graphs.
method Smooth definitions and linking number conditions.
result Sliceness of a spatial graph is equivalent to a condition on linking numbers and a link.
Spatial graphs can be unknotted with region crossing changes.
problem Unknotted spatial graphs composed of theta-curves.
method Region crossing changes on regions of theta-curves.
result Spatial graphs of theta-curves can be unknotted.
New method reduces spatial graphs while preserving their topological features.
problem Finding a smaller spatial graph with the same structure.
method Topological spatial graph coarsening approach based on triangle-aware graph filtration.
result Significant reduction in graph size while preserving topological information.
Survey on spatial graphs with few vertices and edges.
problem Topology of spatial graphs with limited vertices and edges.
method Survey and focus on Brunnian θ-graphs.
result Survey reveals insights into spatial graphs.
Algorithm determines spatial graph isomorphism with vertex, edge colorings and orientations.
problem Algorithmic recognition of spatial graphs with various colorings and orientations.
method Proved existence of an algorithm for isomorphic spatial graphs, decomposed into canonical blocks, and applied Haken and Matveev's result.
result Algorithmic recognition of spatial graphs with colorings and orientations.
New results on splitting tangles and spatial graphs.
problem Issues with previous splitting results about tangles and spatial graphs.
method Generalization of Menasco's result to other classes of links, tangles, and spatial graphs.
result New more general results for tangles and spatial graphs.
Spatial graphs study tangle replacement with equivalence classes.
problem Differentiating spatial graphs and their properties.
method Tangle replacement on spatial graphs, focusing on handcuff graphs.
result One-to-one correspondence between neighborhood equivalence classes and tangles.
Study of Poincaré-Reeb graphs for algebraic domains.
problem Characterizing geometric shapes of algebraic domains.
method Collapsing vertical segments to form Poincaré-Reeb graphs and analyzing their properties.
result Any transversal graph with specific properties can be realized as a Poincaré-Reeb graph.
Spatial graphs are decomposed into planar forests and braids.
problem Understanding the structure of spatial graphs in 3-space.
method Decomposition of spatial graphs into planar forests and braids.
result Every finite spatial graph is a connected sum of a planar graph and a braid.
We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of the graph contains a non-splittable 2-component link. We also show that there exis…
The paper classifies palettes of Dehn colorings for spatial graphs.
problem Classifying spatial graph diagrams using Dehn colorings.
method Examining vertex conditions and palettes for spatial graphs.
result Spatial graphs can be distinguished by the number of Dehn colorings with specific palettes.
The paper explores colorings, determinants, and Alexander polynomials for spatial graphs.
problem Analyzing colorings, determinants, and Alexander polynomials for spatial graphs.
method Using Alexander modules and polynomials, the paper defines colorings and representations of fundamental groups.
result The determinant of a spatial graph determines which p it is p-colorable, and a p-coloring corresponds to a specific group representation. Study on spatial graphs and their constituent knots, linking polynomial invariants.
problem Understanding the polynomial invariants of spatial graphs and their constituent knots.
method Analyzing spatial K4 graphs, constructing band surfaces, and relating polynomials. result Relations between Yamada/Jaeger polynomials and Jones polynomials of constituent knots and associated links.
Extends knot concordance invariant to balanced spatial graphs using grid homology.
problem Defining a concordance invariant for balanced spatial graphs.
method Using grid homology to extend the invariant from knots to spatial graphs.
result The combinatorial Υ invariant is a concordance invariant for balanced spatial graphs. Study shows dense roots of Yamada polynomial for certain graphs.
problem Understanding the roots of Yamada polynomials for spatial graphs.
method Construction and analysis of Yamada polynomial for spatial graphs.
result Found an infinite family of graphs with dense roots of Yamada polynomials.
Paper generalizes Yamada polynomial to virtual spatial graphs.
problem Generalizing classical knot theory to virtual spatial graphs.
method Topological definition and combinatorial approach for virtual spatial graphs.
result Generalized Yamada polynomial defined and proven invariant.
Study on projections of 2-bouquet graphs, calculating knotting and trivializing numbers.
problem Extending knot theory concepts to spatial graphs and 2-bouquet graphs.
method Calculating knotting and trivializing numbers for projections and pseudodiagrams of 2-bouquet spatial graphs based on precrossings and their placement.
result Determined knotting and trivializing numbers for 2-bouquet spatial graphs.
Develops BASGCN for graph classification with improved feature learning.
problem Graph classification with information loss and imprecise representation.
method Transforms graphs into grid structures and defines a new spatial graph convolution operation.
result Reduces information loss and improves feature representation compared to existing models.
Classifies spatial graphs with finite N-quandles.
problem Determining isomorphism of spatial graphs' N-quandles.
method Generalized N-quandles to spatial graphs, proving basic results and conjecturing a classification.
result Verifies conjecture in several cases, presents a possible counterexample.
New formulas for spatial 2-bouquet graphs discovered.
problem Finding formulas for Vassiliev invariants of spatial 2-bouquet graphs.
method Introducing new Gauss diagram formulas for flat vertex isotopy classes of spatial 2-bouquet graphs.
result First simple example of a Gauss diagram formula for spatial 2-bouquet graphs.
We define braid presentation of edge-oriented spatial graphs as a natural generalization of braid presentation of oriented links. We show that every spatial graph has a braid presentation. For an oriented link it is known that the braid index is equal to the minimal number of Seifert circles. We show that an analogy do…
GCNs model complex spatial patterns of POI check-ins.
problem Capturing complex spatial patterns in irregular data.
method Graph Convolutional Neural Networks (GCNs) for semi-supervised prediction.
result Demonstrates feasibility of GCNs for complex geographic data.
Complete classification of links and spatial graphs with finite N-quandles.
problem Classifying links and spatial graphs with finite N-quandles.
method Extending fundamental quandle relationships to N-quandles of links and spatial graphs.
result Complete list of links and partial list of spatial graphs with finite N-quandles.
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
For leveled spatial graphs, we find a surface embedding that allows cellular embedding.
problem Finding a surface embedding for general spatial graphs is not always possible.
method Define leveled property, decompose graph into subgraphs, and construct surface.
result For leveled spatial graphs with a small number of levels, a surface can always be found.
Forecaster uses graph Transformers to forecast spatial and time-dependent data.
problem Complex spatial and temporal dependencies in data.
method Graph Transformer architecture with sparsification for spatial and temporal dependencies.
result Forecaster significantly outperforms state-of-the-art baselines in taxi demand forecasting.
The paper introduces a test to distinguish spatial graphs based on their knot diagrams.
problem Distinguishing isotopic spatial graphs from diagrams.
method Using the writhe of knot diagrams from cycles in the graph.
result A necessary condition for distinguishing isotopic spatial graphs.
Paper generalizes pretzel links using spatial graphs.
problem Classical pretzel links need a generalization.
method Introduces graph-pretzel links based on spatial graph projections.
result Constructs an infinite family of distinct ribbon knots.
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in this paper. This enable us to show that certain classes of knots can yield hyperb…
The paper studies grid homology for spatial graphs and proves a Künneth formula for connected sums.
problem Understanding grid homology for spatial graphs with various types of edges.
method Developed grid homology for spatial graphs with cut edges and applied it to prove a Künneth formula for connected sums.
result A Künneth formula for knot Floer homology of connected sums is proven using grid homology.
Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the classical case. Unlike previous attempts at generalizing link homotopy to spatial…
In this paper, we compute the graph skein algebra of the punctured disk with two holes. Then, we apply the graph skein techniques developed here to establish necessary conditions for a spatial graph to have a symmetry of order p, where p is a prime. The obstruction criteria introduced here extend some results obtai…
Graph WaveNet models spatial-temporal graphs by learning hidden dependencies and long sequences.
problem Capturing hidden spatial dependencies and long-range temporal sequences in graphs.
method Graph WaveNet integrates adaptive dependency matrix learning and stacked dilated 1D convolution.
result Graph WaveNet outperforms existing methods on public traffic network datasets.
New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.
problem Calculating bridge indices for spatial graphs efficiently.
method Extending Wirtinger number to spatial graphs, implementing Python algorithm, combining algebraic structures and clasping techniques.
result Exact bridge indices for almost unknotted graphs of large bridge index.
Edge-homotopy and vertex-homotopy are equivalence relations on spatial graphs which are generalizations of Milnor's link-homotopy. We introduce some edge (resp. vertex)-homotopy invariants of spatial graphs by applying the Sato-Levine invariant for the 2-component constituent algebraically split links and show examples…
Proposes SGCN for spatially structured data.
problem Lack of node neighbor ordering in GCNs.
method Uses spatial features to learn from graphs with spatial positions.
result Empirically outperforms state-of-the-art methods.
In this paper we construct some invariants of spatial graphs by disk-summing the constituent knots and show the delta edge-homotopy invariance of them. As an application, we show that there exist infinitely many slice spatial embeddings of a planar graph up to delta edge-homotopy, and there exist infinitely many bounda…