Conference item
Decidability of membership problems for flat rational subsets of GL (2, Q) and singular matrices
- Abstract:
-
This work relates numerical problems on matrices over the rationals to symbolic algorithms on words and finite automata. Using exact algebraic algorithms and symbolic computation, we prove new decidability results for 2 × 2 matrices over Q. Namely, we introduce a notion of flat rational sets: if M is a monoid and N ≤ M is its submonoid, then flat rational sets of M relative to N are finite unions of the form L0g1L1 ··· gtLt where all Lis are rational subsets of N and gi ∈ M. We give quite ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Authors
Funding
Bibliographic Details
- Publisher:
- Association for Computing Machinery Publisher's website
- Host title:
- ISSAC '20: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
- Pages:
- 122–129
- Publication date:
- 2020-07-20
- Acceptance date:
- 2020-06-01
- Event title:
- International Symposium on Symbolic and Algebraic Computation (ISSAC 2020)
- Event location:
- Kalamata, Greece
- Event website:
- https://www.issac-conference.org/2020/
- Event start date:
- 2020-07-20
- Event end date:
- 2020-07-23
- DOI:
- ISBN:
- 9781450371001
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
1116416
- Local pid:
- pubs:1116416
- Deposit date:
- 2020-07-04
Terms of use
- Copyright holder:
- Association for Computing Machinery.
- Copyright date:
- 2020
- Rights statement:
- © 2020 Association for Computing Machinery.
- Notes:
- This paper was presented at the International Symposium on Symbolic and Algebraic Computation (ISSAC 2020), Kalamata, Greece, July 2020. This is the accepted manuscript version of the paper. The final version is available online from the Association for Computing Machinery at: https://doi.org/10.1145/3373207.3404038
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record