Tensor computations in computer algebra systems criteria that must be satisfied by a
computer algebra system dealing with tensors. We briefly overview
Restrictions on the degree spectra of algebraic structuresWe construct the degree b ≤ 0″ admitting no
algebraic structure with degree spectrum {x: x ≰ b
Fields of Algebraic Numbers Computable in Polynomial Time. I of complex
algebraic numbers has an isomorphic presentation
computable in polynomial time. A similar fact
On Calculation of Abelian Differentials in Weierstrass’s lectures. The paper discusses its implementation in the Sage
computer algebra system
On computably enumerable structures by the author at
Algebra Computability and Logic conference in Kazan, June 1–6, 2014. The paper is a new
Symbolic Implementation of Multivector Algebra in Julia Language in the Julia language. It mixes
computer algebra calculations with numerical calculations for better
Using two types of computer algebra systems to solve maxwell optics problems operations, which are adequately supported by
computer algebra systems. In this paper, we distinguish between
A Modular Extension for a Computer Algebra SystemAbstract:
Computer algebra systems are complex software systems that cover a wide range
In Memory of Vladimir Gerdt passing was a great loss to the scientific center and the
computer algebra community. The article provides