We study the \emph{noncommutative rank} problem, $\NCRANK$, of computing the rank of matrices with linear entries in $n$ noncommuting variables and the problem of \emph{noncommutative Rational Identity Testing}, $\RIT$, which is to decide if a given rational formula in $n$ noncommuting variables is zero on its domain of definition.
... more >>>
The rational identity testing problem, RIT, asks whether an input \emph{rational circuit}, i.e.\ a noncommutative arithmetic circuit that has inversion gates, computes the zero element of the free skew field. For rational \emph{formulas} the problem is known to be in deterministic polynomial time \cite{GGOW20}, \cite{IQS18}. For rational circuits of ... more >>>