SPATIAL GRAPH EXTERIORS REALIZING GIVEN JSJ DECOMPOSITION GRAPHS

2013 ◽  
Vol 22 (05) ◽  
pp. 1350020
Author(s):  
TORU IKEDA
Keyword(s):  
Connected Graph ◽  
Finite Graph ◽  
Jsj Decomposition ◽  
Spatial Graph ◽  
Spatial Graphs ◽  
Incompressible Boundary ◽  
Jsj Decompositions

If the exterior E(G) of a spatial graph G in a closed orientable 3-manifold is an irreducible 3-manifold with incompressible boundary, there is a unique finite graph Γ associated to the JSJ decomposition of E(G). This paper provides a method for constructing spatial graphs such that a given finite connected graph is associated to the JSJ decompositions of their exteriors.

Robot navigation algorithms using learned spatial graphs

Robotica ◽  
1986 ◽  
Vol 4 (2) ◽  
pp. 93-100 ◽  
Author(s):  
S. S. Iyengar ◽  
C. C. Jorgensen ◽  
S. V. N. Rao ◽  
C. R. Weisbin
Keyword(s):  
Robot Navigation ◽  
Sensor Data ◽  
Two Dimensional ◽  
Continuous Transition ◽  
Spatial Graph ◽  
Spatial Graphs ◽  
Navigation Algorithms ◽  
Sensor Information ◽  
Navigation Planning ◽  
Available Information

SUMMARYFinding optimal paths for robot navigation in a known terrain has been studied for some time but, in many important situations, a robot would be required to navigate in completely new or partially explored terrain. We propose a method of robot navigation which requires no pre-learned model, makes maximal use of available information, records and synthesizes information from multiple journeys, and contains concepts of learning that allow for continuous transition from local to global path optimality. The model of the terrain consists of a spatial graph and a Voronoi diagram. Using acquired sensor data, polygonal boundaries containing perceived obstacles shrink to approximate the actual obstacles surfaces, free space for transit is correspondingly enlarged, and additional nodes and edges are recorded based on path intersections and stop points. Navigation planning is gradually accelerated with experience since improved global map information minimizes the need for further sensor data acquisition. Our method currently assumes obstacle locations are unchanging, navigation can be successfully conducted using two-dimensional projections, and sensor information is precise.

scholarly journals QUASI-ISOMETRIES, BOUNDARIES AND JSJ-DECOMPOSITIONS OF RELATIVELY HYPERBOLIC GROUPS

2013 ◽  
Vol 05 (04) ◽  
pp. 451-475 ◽  
Author(s):  
BRADLEY W. GROFF
Keyword(s):  
Hyperbolic Groups ◽  
Isometry Groups ◽  
Geometric Structures ◽  
Relatively Hyperbolic Groups ◽  
Jsj Decomposition ◽  
Outer Automorphisms ◽  
Jsj Decompositions ◽  
Relatively Hyperbolic

We demonstrate the quasi-isometry invariance of two important geometric structures for relatively hyperbolic groups: the coned space and the cusped space. As applications, we produce a JSJ-decomposition for relatively hyperbolic groups which is invariant under quasi-isometries and outer automorphisms, as well as a related splitting of the quasi-isometry groups of relatively hyperbolic groups.

scholarly journals Discrete Schrödinger operators on a graph

1992 ◽  
Vol 125 ◽  
pp. 141-150 ◽  
Author(s):  
Polly Wee Sy ◽  
Toshikazu Sunada
Keyword(s):  
Riemannian Manifold ◽  
Automorphism Group ◽  
Connected Graph ◽  
Spectral Properties ◽  
Orbit Space ◽  
Finite Graph ◽  
Discrete Analogue ◽  
Discrete Laplacian ◽  
Locally Finite ◽  
Discrete Schrödinger Operators

In this paper, we study some spectral properties of the discrete Schrödinger operator = Δ + q defined on a locally finite connected graph with an automorphism group whose orbit space is a finite graph.The discrete Laplacian and its generalization have been explored from many different viewpoints (for instance, see [2] [4]). Our paper discusses the discrete analogue of the results on the bottom of the spectrum established by T. Kobayashi, K. Ono and T. Sunada [3] in the Riemannian-manifold-setting.

Every finite group action on a compact 3-manifold preserves infinitely many hyperbolic spatial graphs

2014 ◽  
Vol 23 (06) ◽  
pp. 1450034 ◽  
Author(s):  
Toru Ikeda
Keyword(s):  
Finite Group ◽  
Group Action ◽  
Group Actions ◽  
Infinite Family ◽  
Finite Group Action ◽  
Finite Group Actions ◽  
Spatial Graph ◽  
Cell Decompositions ◽  
Spatial Graphs ◽  
Ideal Triangulations

We consider symmetries of spatial graphs in compact 3-manifolds described by smooth finite group actions. This paper provides a method for constructing an infinite family of hyperbolic spatial graphs with given symmetry by connecting spatial graph versions of hyperbolic tangles in 3-cells of polyhedral cell decompositions induced from triangulations of the 3-manifolds. This method is applicable also to the case of ideal triangulations.

A CHARACTERIZATION OF KNOTS IN A SPATIAL GRAPH

2000 ◽  
Vol 09 (08) ◽  
pp. 1069-1084 ◽  
Author(s):  
KAZUKO ONDA
Keyword(s):  
Finite Graph ◽  
Restriction Map ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Spatial Graph ◽  
Necessary And Sufficient

For a finite graph G, let Γ(G) be the set of all cycles of G. Suppose that for each γ∈Γ(G), an embedding ϕγ:γ→S3 is given. A set {ϕγ|γ∈Γ(G)} of embeddings is said to be realizable if there is an embedding f:G→S3 such that the restriction map f|γ is ambient isotopic to ϕγ for any γ∈Γ(G). In this paper on seven specified graphs G, we give a necessary and sufficient condition for the set {ϕγ|γ∈Γ(G)} to be realizable by using the second coefficients of Conway polynomials of knots.

COMPLETELY DISTINGUISHABLE PROJECTIONS OF SPATIAL GRAPHS

2006 ◽  
Vol 15 (01) ◽  
pp. 11-19 ◽  
Author(s):  
RYO NIKKUNI
Keyword(s):  
Bipartite Graph ◽  
Complete Graph ◽  
Planar Graphs ◽  
Double Point ◽  
Complete Bipartite Graph ◽  
Finite Graph ◽  
Double Points ◽  
Spatial Graphs ◽  
Generic Immersion

A generic immersion of a finite graph into the 2-space with p double points is said to be completely distinguishable if any two of the 2p embeddings of the graph into the 3-space obtained from the immersion by giving over/under information to each double point are not ambient isotopic in the 3-space. We show that only non-trivializable graphs and non-planar graphs have a non-trivial completely distinguishable immersion. We give examples of non-trivial completely distinguishable immersions of several non-trivializable graphs, the complete graph on n vertices and the complete bipartite graph on m + n vertices.

The Yamada polynomial of lens spatial graphs

2015 ◽  
Vol 08 (02) ◽  
pp. 1550029 ◽  
Author(s):  
Nafaa Chbili
Keyword(s):  
Braid Group ◽  
Lens Space ◽  
Spatial Graph ◽  
Spatial Graphs ◽  
Combinatorial Representation

Let [Formula: see text] be a spatial graph in the 3-sphere which covers a graph in the lens space. We introduce a combinatorial representation of [Formula: see text] which reflects the symmetry of the spatial graph. This representation involves a ribbon n-graph and the generator of the center of the n-braid group. We apply this result to study the Yamada polynomial of a class of lens spatial graphs.

scholarly journals Colorings, determinants and Alexander polynomials for spatial graphs

2016 ◽  
Vol 25 (04) ◽  
pp. 1650019
Author(s):  
Blake Mellor ◽  
Terry Kong ◽  
Alec Lewald ◽  
Vadim Pigrish
Keyword(s):  
Fundamental Group ◽  
Alexander Polynomial ◽  
Metacyclic Group ◽  
Alexander Polynomials ◽  
Spatial Graph ◽  
Spatial Graphs ◽  
Integer Weight

A 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 S. Kinoshita, Alexander polynomials as isotopy invariants I, Osaka Math. J. 10 (1958) 263–271.), and examine their behavior under some common operations on the graph. We use the Alexander module to define the determinant and [Formula: see text]-colorings of a balanced spatial graph, and provide examples. We show that the determinant of a spatial graph determines for which [Formula: see text] the graph is [Formula: see text]-colorable, and that a [Formula: see text]-coloring of a graph corresponds to a representation of the fundamental group of its complement into a metacyclic group [Formula: see text]. We finish by proving some properties of the Alexander polynomial.

scholarly journals A study of projections of 2-bouquet graphs

2017 ◽  
Vol 26 (05) ◽  
pp. 1750025
Author(s):  
Elaina Aceves
Keyword(s):  
Spatial Graph ◽  
Spatial Graphs

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet spatial graphs based on the number of precrossings and the placement of the precrossings in the pseudodiagram of the spatial graph.

scholarly journals Stick number of spatial graphs

2017 ◽  
Vol 26 (14) ◽  
pp. 1750100 ◽  
Author(s):  
Minjung Lee ◽  
Sungjong No ◽  
Seungsang Oh
Keyword(s):  
Research Program ◽  
Upper Bound ◽  
Upper Bounds ◽  
Crossing Number ◽  
Index Formula ◽  
Spatial Graph ◽  
Spatial Graphs ◽  
Number Formula ◽  
Arc Index

For a nontrivial knot [Formula: see text], Negami found an upper bound on the stick number [Formula: see text] in terms of its crossing number [Formula: see text] which is [Formula: see text]. Later, Huh and Oh utilized the arc index [Formula: see text] to present a more precise upper bound [Formula: see text]. Furthermore, Kim, No and Oh found an upper bound on the equilateral stick number [Formula: see text] as follows; [Formula: see text]. As a sequel to this research program, we similarly define the stick number [Formula: see text] and the equilateral stick number [Formula: see text] of a spatial graph [Formula: see text], and present their upper bounds as follows; [Formula: see text] [Formula: see text] where [Formula: see text] and [Formula: see text] are the number of edges and vertices of [Formula: see text], respectively, [Formula: see text] is the number of bouquet cut-components, and [Formula: see text] is the number of non-splittable components.

Sign in / Sign up

Export Citation Format

Share Document