The freeness problem for products of matrices defined on bounded languages
نویسندگان
چکیده
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2×2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for large enough matrices. The full version of this work was accepted for publication in Information and Computation. It is available online 12 March 2014.
منابع مشابه
The freeness problem over matrix semigroups and bounded languages
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2 × 2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for sufficiently large matrices.
متن کاملScalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
There has been much research into freeness properties of finitely generated matrix semigroups under various constraints, mainly related to the dimensions of the generator matrices and the semiring over which the matrices are defined. A recent paper has also investigated freeness properties of matrices within a bounded language of matrices, which are of the form M1M2 · · ·Mk ⊆ Fn×n for some semi...
متن کاملA brief introduction to quaternion matrices and linear algebra and on bounded groups of quaternion matrices
The division algebra of real quaternions, as the only noncommutative normed division real algebra up to isomorphism of normed algebras, is of great importance. In this note, first we present a brief introduction to quaternion matrices and quaternion linear algebra. This, among other things, will help us present the counterpart of a theorem of Herman Auerbach in the setting of quaternions. More ...
متن کاملThe Context-Freeness Problem Is coNP-Complete for Flat Counter Systems
Bounded languages have recently proved to be an important class of languages for the analysis of Turing-powerful models. For instance, bounded context-free languages are used to under-approximate the behaviors of recursive programs. Ginsburg and Spanier have shown in 1966 that a bounded language L ⊆ a1 · · · ad is context-free if, and only if, its Parikh image is a stratifiable semilinear set. ...
متن کاملPartial Freeness of Random Matrices
We investigate the implications of free probability for random matrices. From rules for calculating all possible joint moments of two free random matrices, we develop a notion of partial freeness which is quantified by the breakdown of these rules. We provide a combinatorial interpretation for partial freeness as the presence of closed paths in Hilbert space defined by particular joint moments....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014