Our main results show that Munn semirings over idempotent semifields possess\ud more convenient properties than the Munn rings over fields. First, we describe all\ud centroid sets that can be generated as ideals of the largest weight in Munn semirings\ud over idempotent semifields. Second, we handle the more general case of all onesided\ud ideals too. The multiplication in the Munn semirings is not commutative and\ud the family of arbitrary one-sided ideals is larger than that of two-sided ideals. It is essential to consider all ideals not only in order\ud to develop theoretical foundations, but also since the larger set of ideals may lead\ud to design of classification and clustering systems with better properties. Our main\ud theorem desc...
summary:Semirings are modifications of unitary rings where the additive reduct does not form a group...
In this paper, we introduce the notion of k-ideal, m−k ideal, prime ideal, maximal ideal, filter, ir...
We consider the incidence semirings of graphs and prove that every incidence semiring has convenient...
Our main results show that Munn semirings over idempotent semifields possess more convenient proper...
This paper is devoted to a combinatorial problem for incidence semirings, which can be viewed as set...
We introduce a new construction based on directed graphs. It provides a common generalization of the...
Abstract. This paper is devoted to a combinatorial problem for incidence semirings, which can be vie...
The max-plus algebra is well known and has useful applications in the investigation of discrete even...
Max-plus algebras and more general semirings have many useful applications and have been actively in...
This article continues the investigation of matrix constructions motivated by their applications to ...
The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over...
The present article continues the investigation of constructions essential for applications of combi...
The max-plus algebra is well known and has useful applications in the investigation of discrete even...
We consider the incidence semirings of graphs and prove that every incidence semiring has convenient...
Recent research has motivated the investigation of the weights of ideals in semiring constructions b...
summary:Semirings are modifications of unitary rings where the additive reduct does not form a group...
In this paper, we introduce the notion of k-ideal, m−k ideal, prime ideal, maximal ideal, filter, ir...
We consider the incidence semirings of graphs and prove that every incidence semiring has convenient...
Our main results show that Munn semirings over idempotent semifields possess more convenient proper...
This paper is devoted to a combinatorial problem for incidence semirings, which can be viewed as set...
We introduce a new construction based on directed graphs. It provides a common generalization of the...
Abstract. This paper is devoted to a combinatorial problem for incidence semirings, which can be vie...
The max-plus algebra is well known and has useful applications in the investigation of discrete even...
Max-plus algebras and more general semirings have many useful applications and have been actively in...
This article continues the investigation of matrix constructions motivated by their applications to ...
The aim of this paper is to prove that, for every balanced digraph, in every incidence semiring over...
The present article continues the investigation of constructions essential for applications of combi...
The max-plus algebra is well known and has useful applications in the investigation of discrete even...
We consider the incidence semirings of graphs and prove that every incidence semiring has convenient...
Recent research has motivated the investigation of the weights of ideals in semiring constructions b...
summary:Semirings are modifications of unitary rings where the additive reduct does not form a group...
In this paper, we introduce the notion of k-ideal, m−k ideal, prime ideal, maximal ideal, filter, ir...
We consider the incidence semirings of graphs and prove that every incidence semiring has convenient...