Related papers: Multivariate Bernstein-type Polynomials of Finitel…
In Commutative Algebra structure results on minimal free resolutions of Gorenstein modules are of classical interest. We define Gorenstein modules of finite length over the weighted polynomial ring via symmetric matrices in divided powers.…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…
This text consists of five relatively systematic notes on Gr\"obner bases and free resolutions of modules over solvable polynomial algebras.
We introduce a class of orthogonal polynomials in two variables which generalizes the disc polynomials and the 2-$D$ Hermite polynomials. We identify certain interesting members of this class including a one variable generalization of the…
In this paper we generalise the notion of Drinfeld modular form for the group $\Gamma$ := GL2(Fq[$\theta$]) to a vector-valued setting, where the target spaces are certain modules over positive characteristic Banach algebras over which are…
Exploiting symmetry in Groebner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
We collect here elementary properties of differentiation matrices for univariate polynomials expressed in various bases, including orthogonal polynomial bases and non-degree-graded bases such as Bernstein bases and Lagrange \& Hermite…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
Let X be an algebraic curve. We study the problem of parametrizing geometric data over X, which is only generically defined. E.g., parametrizing generically defined (aka rational) maps from X to a fixed target scheme Y. There are three…
In this paper, we consider the problem of formulating the subresultant polynomials for several univariate polynomials in Newton basis. It is required that the resulting subresultant polynomials be expressed in the same Newton basis as that…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We prove that certain classical groups $G\subseteq {\rm GL}(d,\mathbb{R}^d)$ serve to characterize ordinary polynomials in $d$ real variables as elements of finite-dimensional subspaces of $C(\mathbb{R}^d)$ that are invariant by changes of…
We formalize, at the level of D-modules, the notion that A-hypergeometric systems are equivariant versions of the classical hypergeometric equations. For this purpose, we construct a functor on a suitable category of torus equivariant…
(Partial) Gorenstein silting modules are introduced and investigated. It is shown that for finite dimensional algebras of finite CM-type, partial Gorenstein silting modules are in bijection with {\tau}_G-rigid modules; Gorenstein silting…
We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We overview numerous algorithms in computational $D$-module theory together with the theoretical background as well as the implementation in the computer algebra system \textsc{Singular}. We discuss new approaches to the computation of…
Formulations of some Grassmann-valued systems of ordinary differential equations invariant under (infinitesimal) supersymmetry transformations, including $N$-superspace extended types, are reviewed and discussed, with use of superfields.…