Efficient Black-Box Identity Testing for Free Group Algebras

Hrubes and Wigderson [Pavel Hrubes and Avi Wigderson, 2014] initiated the study of noncommutative arithmetic circuits with division computing a noncommutative rational function in the free skew field, and raised the question of rational identity testing. For noncommutative formulas with inverses the problem can be solved in deterministic polynomial time in the white-box model [Ankit Garg et al., 2016; Ivanyos et al., 2018]. It can be solved in randomized polynomial time in the black-box model [Harm Derksen and Visu Makam, 2017], where the running time is polynomial in the size of the formula. The complexity of identity testing of noncommutative rational functions, in general, remains open for noncommutative circuits with inverses. We solve the problem for a natural special case. We consider expressions in the free group algebra F(X,X^{-1}) where X={x_1, x_2, ..., x_n}. Our main results are the following. 1) Given a degree d expression f in F(X,X^{-1}) as a black-box, we obtain a randomized poly(n,d) algorithm to check whether f is an identically zero expression or not. The technical contribution is an Amitsur-Levitzki type theorem [A. S. Amitsur and J. Levitzki, 1950] for F(X, X^{-1}). This also yields a deterministic identity testing algorithm (and even an expression reconstruction algorithm) that is polynomial time in the sparsity of the input expression. 2) Given an expression f in F(X,X^{-1}) of degree D and sparsity s, as black-box, we can check whether f is identically zero or not in randomized poly(n,log s, log D) time. This yields a randomized polynomial-time algorithm when D and s are exponential in n

Complexity spectrum of some discrete dynamical systems

We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $3 \times 3$ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities for all the $9!$ possible birational transformations. These complexities correspond to a spectrum of eighteen algebraic values. We then drastically generalize these results, replacing permutations of the entries by homogeneous polynomial transformations of the entries possibly depending on many parameters. Again it is shown that the associated birational, or even rational, transformations yield algebraic values for their complexities.Comment: 1 LaTex fil

Polynomial Size Analysis of First-Order Shapely Functions

We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely function definitions may be implementations of matrix multiplication and the Cartesian product of two lists. The type system is proved to be sound w.r.t. the operational semantics of the language. The type checking problem is shown to be undecidable in general. We define a natural syntactic restriction such that the type checking becomes decidable, even though size polynomials are not necessarily linear or monotonic. Furthermore, we have shown that the type-inference problem is at least semi-decidable (under this restriction). We have implemented a procedure that combines run-time testing and type-checking to automatically obtain size dependencies. It terminates on total typable function definitions.Comment: 35 pages, 1 figur

Post-critical set and non existence of preserved meromorphic two-forms

We present a family of birational transformations in $CP_2$ depending on two, or three, parameters which does not, generically, preserve meromorphic two-forms. With the introduction of the orbit of the critical set (vanishing condition of the Jacobian), also called ``post-critical set'', we get some new structures, some "non-analytic" two-form which reduce to meromorphic two-forms for particular subvarieties in the parameter space. On these subvarieties, the iterates of the critical set have a polynomial growth in the \emph{degrees of the parameters}, while one has an exponential growth out of these subspaces. The analysis of our birational transformation in $CP_2$ is first carried out using Diller-Favre criterion in order to find the complexity reduction of the mapping. The integrable cases are found. The identification between the complexity growth and the topological entropy is, one more time, verified. We perform plots of the post-critical set, as well as calculations of Lyapunov exponents for many orbits, confirming that generically no meromorphic two-form can be preserved for this mapping. These birational transformations in $CP_2$, which, generically, do not preserve any meromorphic two-form, are extremely similar to other birational transformations we previously studied, which do preserve meromorphic two-forms. We note that these two sets of birational transformations exhibit totally similar results as far as topological complexity is concerned, but drastically different results as far as a more ``probabilistic'' approach of dynamical systems is concerned (Lyapunov exponents). With these examples we see that the existence of a preserved meromorphic two-form explains most of the (numerical) discrepancy between the topological and probabilistic approach of dynamical systems.Comment: 34 pages, 7 figure

The set of realizations of a max-plus linear sequence is semi-polyhedral

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the max-plus minimal realization problem. These results are derived from general facts on rational expressions over idempotent commutative semirings: we show more generally that the set of values of the coefficients of a commutative rational expression in one letter that yield a given max-plus linear sequence is a semi-algebraic set in the max-plus sense. In particular, it is a finite union of polyhedral sets