An algorithm for detecting intrinsically knotted graphs, yielding many new minor minimal IK graphs. Ramin Naimi Occidental College We describe an algorithm that detects seemingly most (and possibly all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. We have used this algorithm, implemented as a Mathematica program, to find many new minor min...

We present a further extension of the HYPERDIRE project, which is devoted to the creation of a set of Mathematica-based program packages for manipulations with Horn-type hypergeometric functions on the basis of differential equations. Specifically, we present the implementation of the differential reduction for the Lauricella function FC of three variables. E-mail: [email protected] E-mail: kniehl@de...

Symbolic computation in algebraic categories provides computer implementations for modern algebra theories. The present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Mathematica implementation of Buchberger’s algorithms for determining the Gröbner basis. These implementa...

Using Mathematica 3.0, the Schrödinger equation for bound states is solved. The method of solution is based on a numerical integration procedure together with convexity arguments and the nodal theorem for wave functions. The interaction potential has to be spherically symmetric. The solving procedure is simply defined as some Mathematica function. The output is the energy eigenvalue and the red...