2001
DOI: 10.12921/cmst.2001.07.01.41-54
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial Structures in Spin Models: Algorithms for Generation of Operator Matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2002
2002
2002
2002

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 3 publications
0
1
0
Order By: Relevance
“…The last one consists in efficient implementation of proposed algorithms, working-out methods of storing of configuration etc. These problems have been recently presented elsewhere, 31,39,40 so they are left out in the present paper. The second and third steps are slightly modified standard procedures known since the famous paper of Bonner and Fisher 41 and reused lately in many articles, for example by Waldmann in Ref.…”
Section: Classification Of States By Means Of Algebraic Combinatoricsmentioning
confidence: 99%
“…The last one consists in efficient implementation of proposed algorithms, working-out methods of storing of configuration etc. These problems have been recently presented elsewhere, 31,39,40 so they are left out in the present paper. The second and third steps are slightly modified standard procedures known since the famous paper of Bonner and Fisher 41 and reused lately in many articles, for example by Waldmann in Ref.…”
Section: Classification Of States By Means Of Algebraic Combinatoricsmentioning
confidence: 99%