نتایج جستجو برای: mathematica

تعداد نتایج: 2323  

2017
YU I. MANIN

© Foundation Compositio Mathematica, 1993, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier ...

2017
GARRETT BIRKHOFF Garrett Birkhoff

© Foundation Compositio Mathematica, 1936, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier ...

2002
G. Szekeres Esther Klein

© Foundation Compositio Mathematica, 1935, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier ...

Journal: :Experimental Mathematics 2014
Jonathan Miller Ramin Naimi

We describe an algorithm that recognizes seemingly most — possibly all — intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used in [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted att...

1973
JANOS BOLYAI P. ERDOS

For any infinite cardinal K define a family .F of sets to be a Kalmost-disjoint family (K-ADF) iff U y has cardinality K, each member of .F has cardinality K, and the intersection of any two distinct members of F has cardinality strictly less than K . Define such a family to be a K-maximal almost-disjoint family (K-MADF) iff for every set S c U 'F of cardinality K there exists a set FEE JF* who...

2015
J. L. ARAGÓN

The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main ideas of Clifford algebra, with the main goal to develop a package for Clifford algebra calculations for the computer algebra program Mathematica∗. The Cliffor...

Journal: :Bulletin of the American Mathematical Society 1933

Journal: :Computer Physics Communications 2006

Journal: :Computer Physics Communications 2007

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید