2006
DOI: 10.4064/fm190-0-1
|View full text |Cite
|
Sign up to set email alerts
|

Skein algebras of the solid torus and symmetric spatial graphs

Abstract: Abstract. We use the topological invariant of spatial graphs introduced by S. Yamada to find necessary conditions for a spatial graph to be periodic with a prime period. The proof of the main result is based on computing the Yamada skein algebra of the solid torus and then proving that it injects into the Kauffman bracket skein algebra of the solid torus.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
13
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 11 publications
2
13
0
Order By: Relevance
“…The purpose of this section is to discuss the relationship between the two algebras Y n and τ n . In the case of skein modules of three-manifolds, we defined a homomorphism from the graph skein module to the Kauffman bracket skein module [1,2]. An analogous s of this homomorphism is defined here.…”
Section: )mentioning
confidence: 99%
“…The purpose of this section is to discuss the relationship between the two algebras Y n and τ n . In the case of skein modules of three-manifolds, we defined a homomorphism from the graph skein module to the Kauffman bracket skein module [1,2]. An analogous s of this homomorphism is defined here.…”
Section: )mentioning
confidence: 99%
“…It was proved in [6] that ϕ defines a map Φ from the graph skein module Y(F × I) to the Kauffman bracket skein module K(F × I), where F is any oriented surface. Obviously, Φ is a homomorphism of algebras.…”
Section: The Graph Skein Modulementioning
confidence: 99%
“…By the reduction arguments used in the case of the annulus [6], we can prove that any graph diagram in F 0,3 can be written as a linear combination of finite disjoint unions of bouquets each of which has no contractible cycles. Arguments similar to the ones used to prove Lemma 3.3.2…”
Section: Proof Of Theorem 11mentioning
confidence: 99%
See 2 more Smart Citations