Related papers: Computational Methods for the Construction of a Cl…
Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuation-based systems theories. It was designed to construct multidimensional models (in the framework of…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…
This is a contribution to the theory of atoms in abelian categories recently developed in a series of papers by Kanda. We present a method that enables one to explicitly compute the atom spectrum of the module category over a wide range of…
A Rota--Baxter operator is an algebraic abstraction of integration, which is the typical example of a weight zero Rota-Baxter operator. We show that studying the modules over the polynomial Rota--Baxter algebra $(k[x],P)$ is equivalent to…
We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…
We give a general method to construct a complete set of linearly independent Casimir operators of a Lie algebra with rank N. For a Casimir operator of degree p, this will be provided by an explicit calculation of its symmetric coefficients…
The nature of so-called differential-algebraic operators and their approximations is constitutive for the direct treatment of higher-index differential-algebraic equations. We treat first-order differential-algebraic operators in detail and…
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.
A Rota-Baxter operator defined on the polynomial algebra is called monomial if it maps each monomial to a monomial with some coefficient. We classify monomial Rota-Baxter operators defined on the algebra of polynomials in one variable…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…
We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…
We give algorithms for the computation of the algebraic de Rham cohomology of open and closed algebraic sets inside projective space or other smooth complex toric varieties. The methods, which are based on Gr\"obner basis computations in…
We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.