Related papers: Standard pairs for monomial ideals in semigroup ri…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
A semiring is uniserial if its ideals are totally ordered by inclusion. First, we show that a semiring $S$ is uniserial if and only if the matrix semiring $M_n(S)$ is uniserial. As a generalization of valuation semirings, we also…
In this paper, we view the collection of ideals of a commutative principal ideal ring from two perspectives: one as an ordered semigroup I(R) and the other as a category I_R . It is shown that I(R) is a regular ordered semigroup whereas I_R…
In 2019, V. A. Roman'kov introduced the concept of marginal sets for groups. He developed a theory of marginal sets and demonstrated how these sets can be applied to improve some key exchange schemes. In this paper, we extend his ideas and…
It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…
For an arbitrary ideal $I$ in a polynomial ring $R$ we define the notion of initially regular sequences on $R/I$. These sequences share properties with regular sequences. In particular, the length of an initially regular sequence provides a…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
This is a survey paper on applications of mathematics of semirings to numerical analysis and computing. Concepts of universal algorithm and generic program are discussed. Relations between these concepts and mathematics of semirings are…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
Recently, we have endowed various categories of groups with topologies. The purpose of this paper is to introduce on these categories others topologies which are statistically more suitable to study well-known problems in groups theory. We…
We study ideal-theoretic conditions for a monomial ideal to be Golod. For ideals in a polynomial ring in three variables, our criteria give a complete characterization. Over such rings, we show that the product of two monomial ideals is…
Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…
In this paper we extend the characterisation of kernels in semirings as subtractive ideals to general algebras. We then analyse the counterparts of ``subtractive'' and ``ideal'' in several different algebraic settings.
The aim of this work is to study duality of fractional ideals with respect to a fixed ideal and to investigate the relationship between value sets of pairs of dual ideals in admissible rings, a class of rings that contains the local rings…
The well-known expansion of rational integers in an arbitrary integer base different from $0, 1, -1$ is exploited to study relations between numerical monoids and certain subsemigroups of the multiplicative semigroup of nonzero integers.
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and…