On the problem of freeness of multiplicative matrix semigroups (Q2268869): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084612393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mortality problem for matrices of low dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examples of undecidable problems for 2-generator matrix semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decidability of semigroup freeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems on integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS / rank
 
Normal rank

Latest revision as of 13:25, 2 July 2024

scientific article
Language Label Description Also known as
English
On the problem of freeness of multiplicative matrix semigroups
scientific article

    Statements

    On the problem of freeness of multiplicative matrix semigroups (English)
    0 references
    9 March 2010
    0 references
    The authors consider the freeness of multiplicative matrix semigroups generated by triangular integer matrices of order \(2\) being nonsingular. The problem is reduced to verify if equations involving powers of such matrices, where the sum of powers match, are satisfied. Considering that the matrices are noncommutative, otherwise the problem is trivial, the only possible different is the element \((1,2)\) of the product. A scalar algorithm is developed to test the equality of that element in both sides of the equation.
    0 references
    0 references
    matrix semigroups
    0 references
    freeness
    0 references
    numerical algorithm
    0 references
    triangular integer matrices
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references