An absolute value equation system is an algebraic problem that involves solving the n-by-n system \(Ax+|x|=b\) . This problem is known to be NP-hard, and its solution set can have a complicated structure. So far, the research has primarily focused on the unique solvability cases. However, the system can possess up to \(2^n\) solutions, provided there are finitely many of them. In this paper, we completely characterize this case, analysing which matrices A and vectors b allow for this situation. We also examine the computational complexity of the problem and present novel sufficient conditions. Eventually, we provide remarks regarding possible extensions to the system of the form \(Ax+B|x|=b\) .
