2011
DOI: 10.1090/s0077-1554-2012-00188-5
|View full text |Cite
|
Sign up to set email alerts
|

Parity, free knots, groups, and invariants of finite type

Abstract: Abstract. In this paper, on the basis of the notion of parity introduced recently by the author, for each positive integer m we construct invariants of long virtual knots with values in some simply defined group G m ; conjugacy classes of this group play a role as invariants of compact virtual knots. By construction, each of the invariants is unaltered by the move of virtualization. Factorization of the group algebra of the corresponding group leads to invariants of finite order of (long) virtual knots that do… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(17 citation statements)
references
References 20 publications
0
17
0
Order By: Relevance
“…The new invariants demonstrated the existence of nontrivial free knots as well as nontrivial cobordism classes of free knots [7].…”
Section: Fig 1 Parity Axiomsmentioning
confidence: 93%
See 1 more Smart Citation
“…The new invariants demonstrated the existence of nontrivial free knots as well as nontrivial cobordism classes of free knots [7].…”
Section: Fig 1 Parity Axiomsmentioning
confidence: 93%
“…Additional information, which is introduced into knot diagrams with parity, allows one to strengthen knot invariants [1,[5][6][7][8][9][10][11][12]. The new invariants demonstrated the existence of nontrivial free knots as well as nontrivial cobordism classes of free knots [7].…”
Section: Fig 1 Parity Axiomsmentioning
confidence: 99%
“…Theorem 3.2 (cf. [4][5][6][9][10][11][12][13][14][15][16][17][18][19]). Let G be a leading term of [[L]](f ) j .…”
Section: The Parity-biquandle Bracket and Minimalitymentioning
confidence: 99%
“…The bracket [·] is a diagram-valued invariant of (virtual, free) knots [4][5][6][9][10][11][12][13][14][15][16][17][18][19]. It is important for us to know that One of the simplest knot invariants is the colouring invariant: one colours edges of a knot diagram by colours from a given palette and counts some colourings which are called admissible.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation