Related papers: Studying Wythoff and Zometool Constructions using …
We describe Maple packages for the automatic generation of generating functions(and series expansions) for counting lattice animals(fixed polyominoes), in the two-dimensional hexagonal lattice, of bounded but arbitrary width. Our Maple…
Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…
The possibility of interaction between Maple and numeric compiled languages in performing extensive numeric calculations is exemplified by the Ndynamics package, a tool for studying the (chaotic) behavior of dynamical systems. Programming…
Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…
We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…
Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem…
We are developing a Maple package of functions related to Rota's Umbral Calculus. A Mathematica version of this package is being developed in parallel.
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…
We show how to translate the task of computing the multiplicative structure of a Chow ring of a projective homogeneous variety into an easily understandable combinatorial task of calculating in the corresponding polynomial ring. The…
We offer a Maple package SL\_2\_Inv\_Ker for calculating of minimal generating sets for the algebras of joint invariants/semi-invariants of binary forms and for calculations of the kernels of Weitzenb\"ock derivations.
This article presents some aspects and experience in the use of algebraic manipulation software applied to general relativity. Some years ago certain results were reported using computer algebra platforms, but the growing popularity of…
This manual describes the basic objectives, functionalities and uses of the toolbox for Maple (Maplesoft^TM) called Quantavo. It is intended to facilitate calculations both symbolically and numerically related to Quantum Optics. In…
We introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.
Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which…
Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…
This is a pdf print of the homonymous Maple file, freely available at http://www.maplesoft.com/applications/view.aspx?SID=127621, providing procedures which are able to produce the toric data associated with a (polarized) weighted…
Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…
We provide conditions and algorithmic tools so as to classify and construct the smallest possible determinantal formulae for multihomogeneous resultants arising from Weyman complexes associated to line bundles in products of projective…