Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2987198

An algorithm for calculating Jones polynomials

Author
EL-MISIERY, A. E. M1 ; EL-HORBATY, E.-S
[1] El-Mansoura univ., fac. sci., dep. mathematics, Domieta, Egypt
Source

Applied mathematics and computation. 1996, Vol 74, Num 2-3, pp 249-259 ; ref : 7 ref

CODEN
AMHCBQ
ISSN
0096-3003
Scientific domain
Control theory, operational research; Computer science; Mathematics
Publisher
Elsevier, New York, NY
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Algorithme récursif Calcul formel Fonction deux variables Noeud topologique Polynôme Relation récurrence Groupe tresses Invariant polynomial Mathematica Polynôme Jones
Keyword (en)
Recursive algorithm Computer algebra Two variables function Knot Polynomial Recurrence relation Braid group Jones polynomial
Keyword (es)
Algoritmo recursivo Cálculo formal Función dos variables Nudo topológico Polinomio Relación recurrencia
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I02 Methods of scientific computing (including symbolic computation, algebraic computation)

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
2987198

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web