Solvability of orbit-finite systems of linear equations
Ghosh, Arka, Hofman, Piotr, Lasota, Sławomir
–arXiv.org Artificial Intelligence
We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under mild effectiveness assumptions, and reduces a given orbit-finite system to a number of finite ones: exponentially many in general, but polynomially many when atom dimension of input systems is fixed. Towards obtaining the procedure we push further the theory of vector spaces generated by orbit-finite sets, and show that each such vector space admits an orbit-finite basis. This fundamental property is a key tool in our development, but should be also of wider interest.
arXiv.org Artificial Intelligence
Jun-10-2022
- Country:
- North America > United States
- New York > New York County > New York City (0.04)
- Europe
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- Poland > Masovia Province
- Warsaw (0.04)
- United Kingdom > England
- Asia > Middle East
- Israel > Haifa District > Haifa (0.06)
- North America > United States
- Genre:
- Research Report (0.50)
- Technology: