Conference item
Decidability of the membership problem for 2 x 2 integer matrices
- Abstract:
-
The main result of this paper is the decidability of the membership problem for 2 × 2 nonsingular integer matrices. Namely, we will construct the first algorithm that for any nonsingular 2 × 2 integer matrices M1 : : : Mn and M decides whether M belongs to the semigroup generated by fM1 : : : Mng. Our algorithm relies on a translation of nu- merical problems on matrices into combinatorial problems on words. It also makes use of some algebraic properties of well-known subgroups of GL(2; Z) and...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted Manuscript
Actions
Access Document
- Files:
-
-
(pdf, 445.5KB)
-
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Bibliographic Details
- Publisher:
- ACM Publisher's website
- Pages:
- 170-186
- Series:
- 28th Annual ACM-SIAM Symposium on Discrete Algorithms
- Publication date:
- 2017-01-01
- Acceptance date:
- 2016-10-05
- Pubs id:
-
pubs:834451
- URN:
-
uri:3fc02e4a-9c58-4d0d-b167-50ae0f1d438a
- UUID:
-
uuid:3fc02e4a-9c58-4d0d-b167-50ae0f1d438a
- Local pid:
- pubs:834451
- ISBN:
- 9781611974782
Terms of use
- Copyright holder:
- SIAM
- Copyright date:
- 2017
- Notes:
- Copyright © by SIAM. This is the accepted manuscript version of the article. The final version is available online from ACM at: http://dl.acm.org/citation.cfm?id=3039686.3039698
If you are the owner of this record, you can report an update to it here: Report update to this record