Solvability of orbit-finite systems of linear equations
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 38 references that are in the map. First posted on arXiv 22 Jan 2022.
Builds on
9 of 38 references.
References · 9
- 2014Automata theory in nominal setscited by 5
- 2021The Reachability Problem for Petri Nets is Not Primitive Recursivecited by 5
- 2015Demystifying Reachability in Vector Addition Systemscited by 4
- 2021Reachability in Vector Addition Systems is Ackermann-completecited by 4
- 2018Linear Equations with Ordered Datacited by 2
- 2021Improved Ackermannian lower bound for the Petri nets reachability problemcited by 2
- 2015Reachability analysis of first-order definable pushdown systemscited by 1
- 2016Linear Combinations of Unordered Data Vectorscited by 1
- 2021Parikh's theorem for infinite alphabetscited by 1
Built on by
Not cited yet.