20 citations · 46 across the 10 of their papers we have counts for
4 papers · 1 filter
Complex Golay Pairs up to Length 28: A Search via Computer Algebra and Programmatic SAT
Curtis Bright, Ilias Kotsireas, Albert Heinle +1
We use techniques from the fields of computer algebra and satisfiability checking to develop a new algorithm to search for complex Golay pairs. We implement this algorithm and use…
Factoring Differential Operators in n Variables
Mark Giesbrecht, Albert Heinle, Viktor Levandovskyy
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n…
SymbolicData:SDEval - Benchmarking for Everyone
Albert Heinle, Viktor Levandovskyy, Andreas Nareike
In this paper we will present SDeval, a software project that contains tools for creating and running benchmarks with a focus on problems in computer algebra. It is built on top of…
Factorization of Z-homogeneous polynomials in the First (q)-Weyl Algebra
Albert Heinle, Viktor Levandovskyy
We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and -Weyl algebra, which are both viewed as a -graded rings. We…