Cellular reductions of the Pommaret-Seiler resolution for Quasi-stable ideals

Involutive bases were introduced in [6] as a type of Gröbner bases with additional combinatorial properties. Pommaret bases are a particular kind of involutive bases with strong relations to commutative algebra and algebraic geometry[11, 12].

Algorithms for quadratic forms over global function fields of odd characteristic

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in [4] to global function fields of odd characteristics. First, we present algorithm for checking if a given non-degenerate quadratic form is isotropic or hyperbolic. Next we devise a method for computing the dimension of the anisotropic part of a quadratic form. Finally we present algorithms computing two field invariants: the level and the Pythagoras number.

Approximate greatest common divisor of several polynomials from Hankel matrices

This paper is devoted to present a new method for computing the approximate Greatest Common Divisor (GCD) of several polynomials (not pairwise) from the generalized Hankel matrix. Our approach based on the calculation of cofactors is tested for several sets of polynomials.

Computing the ideals of sumset semigroups

We introduce an algorithm for computing the ideals associated with some sumset semigroups. Our results allow us to study some additive properties of sumsets.

Large final polynomials from integer programming

We introduce a new method for finding a non-realizability certificate of a simplicial sphere Σ. It enables us to prove for the first time the non-realizability of a balanced 2-neighborly 3-sphere by Zheng, a family of highly neighborly centrally symmetric spheres by Novik and Zheng, and several combinatorial prismatoids introduced by Criado and Santos. The method, implemented in the polymake framework, uses integer programming to find a monomial combination of classical 3-term Plücker relations that must be positive in any realization of Σ; but since this combination should also vanish identically, the realization cannot exist. Previous approaches by Firsching, implemented using SCIP, and by Gouveia, Macchia and Wiebe, implemented using Singular and Macaulay2, are not able to process these examples.

High-performance symbolic-numerics via multiple dispatch

As mathematical computing becomes more democratized in high-level languages, high-performance symbolic-numeric systems are necessary for domain scientists and engineers to get the best performance out of their machine without deep knowledge of code optimization. Naturally, users need different term types either to have different algebraic properties for them, or to use efficient data structures. To this end, we developed Symbolics.jl, an extendable symbolic system which uses dynamic multiple dispatch to change behavior depending on the domain needs. In this work we detail an underlying abstract term interface which allows for speed without sacrificing generality. We show that by formalizing a generic API on actions independent of implementation, we can retroactively add optimized data structures to our system without changing the pre-existing term rewriters. We showcase how this can be used to optimize term construction and give a 113x acceleration on general symbolic transformations. Further, we show that such a generic API allows for complementary term-rewriting implementations. Exploiting this feature, we demonstrate the ability to swap between classical term-rewriting simplifiers and e-graph-based term-rewriting simplifiers. We illustrate how this symbolic system improves numerical computing tasks by showcasing an e-graph ruleset which minimizes the number of CPU cycles during expression evaluation, and demonstrate how it simplifies a real-world reaction-network simulation to halve the runtime. Additionally, we show a reaction-diffusion partial differential equation solver which is able to be automatically converted into symbolic expressions via multiple dispatch tracing, which is subsequently accelerated and parallelized to give a 157x simulation speedup. Together, this presents Symbolics.jl as a next-generation symbolic-numeric computing environment geared towards modeling and simulation.

Abstracts of recent doctoral dissertations in computer algebra

Each quarter we are pleased to present abstracts of recent doctoral dissertations in Computer Algebra and Symbolic Computation. We encourage all recent Ph.D. graduates who have defended in the past two years (and their supervisors), to submit their abstracts for publication in CCA.

Constructing new spectral systems from simplicial fibrations

In this work we present an ongoing project on the development and study of new spectral systems which combine filtrations associated to Serre and Eilenberg-Moore spectral sequences of different fibrations. Our new spectral systems are part of a new module for the Kenzo system and can be useful to deduce new relations on the initial spectral sequences and to obtain information about different filtrations of the homology groups of the fiber and the base space of the fibrations.

A call to build a publicly accessible library of lecture recordings in computer algebra

Because of the pandemic, most of us have been teaching online. Some of us have taught courses in computer algebra and some of us recorded those lectures. Now is a good time to assemble a library of computer algebra lectures on various topics. This will be of benefit to us and to future students, faculty and practitioners. Over time the quality of the lectures should improve and the number of topics covered will grow. In this note I describe such a library based on my own computer algebra lectures from this last semester that I have made public. I invite others to contribute.