Revisiting the Equivalence Problem for Finite Multitape Automata

The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhum\"{a}ki in the early 1990s. Their proof of decidability yields a co_NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follows the basic strategy of Harju and Karhumaki but replaces their use of group theory with results on matrix algebras. From our proof we obtain a simple randomised algorithm for deciding language equivalence of deterministic multitape automata and, more generally, multiplicity equivalence of nondeterministic multitape automata. The algorithm involves only matrix exponentiation and runs in polynomial time for each fixed number of tapes. If the two input automata are inequivalent then the algorithm outputs a word on which they differ

A local-global principle for linear dependence of noncommutative polynomials

A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly dependent set of polynomials is linearly dependent. In this short note an alternative proof based on the theory of polynomial identities is given. The method of the proof yields generalizations to directional local linear dependence and evaluations in general algebras over fields of arbitrary characteristic. A main feature of the proof is that it makes it possible to deduce bounds on the size of the matrices where the (directional) local linear dependence needs to be tested in order to establish linear dependence.Comment: 8 page

Generalized Jacobi identities and ball-box theorem for horizontally regular vector fields

We consider a family of vector fields and we assume a horizontal regularity on their derivatives. We discuss the notion of commutator showing that different definitions agree. We apply our results to the proof of a ball-box theorem and Poincar\'e inequality for nonsmooth H\"ormander vector fields.Comment: arXiv admin note: material from arXiv:1106.2410v1, now three separate articles arXiv:1106.2410v2, arXiv:1201.5228, arXiv:1201.520

Open Problems on Central Simple Algebras

We provide a survey of past research and a list of open problems regarding central simple algebras and the Brauer group over a field, intended both for experts and for beginners.Comment: v2 has some small revisions to the text. Some items are re-numbered, compared to v

Branch Rings, Thinned Rings, Tree Enveloping Rings

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting on trees. In particular, for every field k we construct a k-algebra K which (1) is finitely generated and infinite-dimensional, but has only finite-dimensional quotients; (2) has a subalgebra of finite codimension, isomorphic to $M_2(K)$; (3) is prime; (4) has quadratic growth, and therefore Gelfand-Kirillov dimension 2; (5) is recursively presented; (6) satisfies no identity; (7) contains a transcendental, invertible element; (8) is semiprimitive if k has characteristic $\neq2$; (9) is graded if k has characteristic 2; (10) is primitive if k is a non-algebraic extension of GF(2); (11) is graded nil and Jacobson radical if k is an algebraic extension of GF(2).Comment: 35 pages; small changes wrt previous versio

On a conjecture of Goodearl: Jacobson radical non-nil algebras of Gelfand-Kirillov dimension 2

For an arbitrary countable field, we construct an associative algebra that is graded, generated by finitely many degree-1 elements, is Jacobson radical, is not nil, is prime, is not PI, and has Gelfand-Kirillov dimension two. This refutes a conjecture attributed to Goodearl

How to obtain lattices from (f,σ,δ)-codes via a generalization of Construction A

We show how cyclic (f,σ,δ)-codes over finite rings canonically induce a Z-lattice in RN by using certain quotients of orders in nonassociative division algebras defined using the skew polynomial f. This construction generalizes the one using certain σ-constacyclic codes by Ducoat and Oggier, which used quotients of orders in non-commutative associative division algebras defined by f, and can be viewed as a generalization of the classical Construction A for lattices from linear codes. It has the potential to be applied to coset coding, in particular to wire-tap coding. Previous results by Ducoat and Oggier are obtained as special cases

tRNA structural and functional changes induced by oxidative stress

Oxidatively damaged biomolecules impair cellular functions and contribute to the pathology of a variety of diseases. RNA is also attacked by reactive oxygen species, and oxidized RNA is increasingly recognized as an important contributor to neurodegenerative complications in humans. Recently, evidence has accumulated supporting the notion that tRNA is involved in cellular responses to various stress conditions. This review focuses on the intriguing consequences of oxidative modification of tRNA at the structural and functional level