Related papers: Standard pairs for monomial ideals in semigroup ri…
A generic computation of a subset A of the natural numbers consists of a a computation that correctly computes most of the bits of A, and which never incorrectly computes any bits of A, but which does not necessarily give an answer for…
The notion of $\Gamma$-semirings was introduced by Murali Krishna Rao \cite{Rao} as a generalization of the notion of $\Gamma$-rings as well as of semirings. We have known that the notion of $\Gamma$-semirings is a generalization of the…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…
We continue the study of intersection algebras $\mathcal B = \mathcal B_R(I, J)$ of two ideals $I, J$ in a commutative Noetherian ring $R$. In particular, we exploit the semigroup ring and toric structures in order to calculate various…
Consideration of certain properties of group rings and their ideals search
The set of idempotents of a regular semigroup is given an abstract characterization as a regular biordered set in [2], and in [4] it is shown how a biordered set can be associated with a complemented modular lattice. Von Neumann has shown…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
Bifurcations of classical orbits introduce divergences into semiclassical spectra which have to be smoothed with the help of uniform approximations. We develop a technique to extract individual energy levels from semiclassical spectra…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
The aim of this work is to compare symbolic and ordinary powers of monomial ideals using commutative algebra and combinatorics. Monomial ideals whose symbolic and ordinary powers coincide are called Simis ideals. Weighted monomial ideals…
Clustering evaluation measures are frequently used to evaluate the performance of algorithms. However, most measures are not properly normalized and ignore some information in the inherent structure of clusterings. We model the relation…
An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…
There has arisen in recent years a substantial theory of "multiplier ideals'' in commutative rings. These are integrally closed ideals with properties that lend themselves to highly interesting applications. But how special are they among…
Semi-standard graded rings are a generalized notion of standard graded rings. In this paper, we compare generalized notions of the Gorenstein property in semi-standard graded rings. We discuss the commonalities between standard graded rings…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
We present new results and an algorithm for standard basis computations of a 0-dimensional ideal I in a power series ring or in the localization of a polynomial ring in finitely many variables over a field K. The algorithm provides a…
A number of spectrum constructions have been devised to extract topological spaces from algebraic data. Prominent examples include the Zariski spectrum of a commutative ring, the Stone spectrum of a bounded distributive lattice, the Gelfand…