In this paper we study the semigroups of matrices over a commutative semiring. We prove that a semigroup of matrices over a tropical semiring satisfies a combinatorial property called weak permutation property. We consider an application of this result to the Burnside problem for groups
We introduce the notion of diagonal ranks of semigroups,which are numerical characteristics of semig...
AbstractThe functor Z in question associates to every semigroup S the semigroup ring Z(S) where Z is...
Finitely generated linear semigroups over a field K that have intermediate growth are considered. N...
AbstractWe show that the strong Burnside problem has an affirmative answer for semigroups of finite ...
We show that the answer to the Burnside problem is positive for semigroups of matrices with entries ...
13 pagesWe prove the conjecture that, for any $n$, the monoid of all $n \times n$ tropical matrices ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractIn this paper, nilpotent subsemigroups in the matrix semigroup over a commutative antiring a...
We give here an effective decision procedure for the finiteness of a linear semigroup over a commuta...
In semigroup theory there are certain kinds of band decompositions, which are very useful in the stu...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
The present article continues the investigation of constructions essential for applications of combi...
AbstractFinite semigroups of n by n matrices over the naturals are characterized both by algebraic a...
A semigroup S satisfies PPn, the permutation property of degree n (n≥2) if every product of n elemen...
Abstract: A semigroup S is a regular semigroup if for every x ∈ S, x = xyx for some y ∈ S, and a sem...
We introduce the notion of diagonal ranks of semigroups,which are numerical characteristics of semig...
AbstractThe functor Z in question associates to every semigroup S the semigroup ring Z(S) where Z is...
Finitely generated linear semigroups over a field K that have intermediate growth are considered. N...
AbstractWe show that the strong Burnside problem has an affirmative answer for semigroups of finite ...
We show that the answer to the Burnside problem is positive for semigroups of matrices with entries ...
13 pagesWe prove the conjecture that, for any $n$, the monoid of all $n \times n$ tropical matrices ...
Computational semigroup theory is concerned with developing and implementing algorithms for determin...
AbstractIn this paper, nilpotent subsemigroups in the matrix semigroup over a commutative antiring a...
We give here an effective decision procedure for the finiteness of a linear semigroup over a commuta...
In semigroup theory there are certain kinds of band decompositions, which are very useful in the stu...
summary:Research on combinatorial properties of sequences in groups and semigroups originates from B...
The present article continues the investigation of constructions essential for applications of combi...
AbstractFinite semigroups of n by n matrices over the naturals are characterized both by algebraic a...
A semigroup S satisfies PPn, the permutation property of degree n (n≥2) if every product of n elemen...
Abstract: A semigroup S is a regular semigroup if for every x ∈ S, x = xyx for some y ∈ S, and a sem...
We introduce the notion of diagonal ranks of semigroups,which are numerical characteristics of semig...
AbstractThe functor Z in question associates to every semigroup S the semigroup ring Z(S) where Z is...
Finitely generated linear semigroups over a field K that have intermediate growth are considered. N...
DOI
Add to ORKG