Page 1 Next

## Displaying 1 – 20 of 185

Showing per page

### A. C. Clarke's Space Odyssey and Newton's law of gravity

Programs and Algorithms of Numerical Mathematics

In his famous tetralogy, Space Odyssey, A. C. Clarke called the calculation of a motion of a mass point in the gravitational field of the massive cuboid a classical problem of gravitational mechanics. This article presents a proposal for a solution to this problem in terms of Newton's theory of gravity. First we discuss and generalize Newton's law of gravitation. We then compare the gravitational field created by the cuboid -- monolith, with the gravitational field of the homogeneous sphere. This...

### A computation of positive one-peak posets that are Tits-sincere

Colloquium Mathematicae

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix $A\in ₙ\left(ℤ\right)$ is ℤ-congruent to its transpose ${A}^{tr}$ is also discussed. An affirmative answer is given for the incidence matrices ${C}_{I}$ and the Tits matrices $C{̂}_{I}$ of positive one-peak posets I.

### A Computer Algebra Application to Determination of Lie Symmetries of Partial Differential Equations

Serdica Journal of Computing

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006A MATHEMATICA package for finding Lie symmetries of partial differential equations is presented. The package is designed to create and solve the associated determining system of equations, the full set of solutions of which generates the widest permissible local Lie group of point symmetry transformations. Examples illustrating the functionality of the package's tools...

### A generalization of Gosper's algorithm to bibasic hypergeometric summation.

The Electronic Journal of Combinatorics [electronic only]

### A Macsyma implementation of Zeilberger's fast algorithm.

Séminaire Lotharingien de Combinatoire [electronic only]

### A new interpretor for PARI/GP

Journal de Théorie des Nombres de Bordeaux

When Henri Cohen and his coworkers set out to write PARI twenty years ago, GP was an afterthought. While GP has become the most commonly used interface to the PARI library by a large margin, both the gp interpretor and the GP language are primitive in design. Paradoxically, while gp allows to handle very high-level objects, GP itself is a low-level language coming straight from the seventies.We rewrote GP as a compiler/evaluator pair, implementing several high-level features (statically scoped variables,...

### A New Method for Computing Polynomial Greatest Common Divisors and Polynomial Remainder Sequences.

Numerische Mathematik

### A non-deteministic time hierarchy over the reals.

Extracta Mathematicae

### A Non-Recursive Algorithm for Polygon Triangulation

The Yugoslav Journal of Operations Research

### A note on the minimality problem in indefinite summation of rational functions.

Séminaire Lotharingien de Combinatoire [electronic only]

### A package for symbolic solution of real functional equations of real variables.

Aequationes mathematicae

### A parenthesis machine for string manipulation

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

### A ring to describe symbolic expressions.

Extracta Mathematicae

### A terminal area topology-independent GB-based conflict detection system for A-SMGCS.

RACSAM

A module for conflict detection in A-SMGCS is presented. It supervises the operations that the ground controller has to perform. It doesn?t depend on the topology of the terminal area. The system guarantees the safety of the proposed situation, that is, the impossibility that a conflict arises among aircrafts (and also road vehicles) obeying the signaling. We suppose that the terminal area has stop bars (or semaphores) controlling all intersections and accesses between runways, taxiways, exits,...

### About the computation of the signature of surface singularities z N + g(x, y) = 0

Open Mathematics

In this article we describe our experiences with a parallel Singular implementation of the signature of a surface singularity defined by z N + g(x; y) = 0.

### Accelerated series for universal constants, by the WZ method.

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

### ALBERT---Software for scientific computations and applications.

Acta Mathematica Universitatis Comenianae. New Series

### Algorithm for the Gröbner region of a principal ideal.

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

### Algorithmes d'élimination des quantificateurs

Publications mathématiques et informatique de Rennes

### Algorithmische Aspekte zur Theorie der Gröbner-Basen

Beiträge zur Algebra und Geometrie = Contributions to algebra and geometry

Page 1 Next