Related papers: Computational Methods for the Construction of a Cl…
In a formally unmixed Noetherian local ring, if the colength and multiplicity of an integrally closed ideal agree, then $R$ is regular. We deduce this using the relationship between multiplicity and various ideal closure operations.
This paper presents a means with time complexity of at worst O(n^3) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
We describe algorithms for computing various functors for algebraic D-modules, i.e. systems of linear partial differential equations with polynomial coefficients. We will give algorithms for restriction, tensor product, localization, and…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We describe a Lohner-type algorithm for the computation of rigorous upper bounds for reachable set for control systems, solutions of ordinary differential inclusions and perturbations of ODEs.
Given a non-zero polynomial $f$ in a polynomial ring $R$ with coefficients in a finite field of prime characteristic $p$, we present an algorithm to compute a differential operator $\delta$ which raises $1/f$ to its $p$th power. For some…
An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…
We introduce the notion of numerical functors to generalise Eilenberg & MacLane's polynomial functors to modules over a binomial base ring. After shewing how these functors are encoded by modules over a certain ring, we record a precise…
We construct some inverse-closed algebras of bounded integral operators with operator-valued kernels, acting in spaces of vector-valued functions on locally compact groups. To this end we make systematic use of covariance algebras…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…
The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…
We describe quantizations on monoidal categories of modules over finite groups. They are given by quantizers which are elements of a group algebra. Over the complex numbers we find these explicitly. For modules over S3 and A4 we are given…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
Recently, tilting and cotilting classes over commutative noetherian rings have been classified in arXiv:1203.0907. We proceed and, for each n-cotilting class C, construct an n-cotilting module inducing C by an iteration of injective…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…