Related papers: Compatible rewriting of noncommutative polynomials…
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that…
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
Using ideas from automata theory we design a new efficient (deterministic) identity test for the \emph{noncommutative} polynomial identity testing problem (first introduced and studied in \cite{RS05,BW05}). We also apply this idea to the…
We prove an inequality for polynomials applied in a symmetric way to non-commuting operators.
Motivated by the pivotal role played by linear operators, many years ago Rota proposed to determine algebraic operator identities satisfied by linear operators on associative algebras, later called Rota's program on algebraic operators.…
For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
In this paper we present a deterministic polynomial time algorithm for testing if a symbolic matrix in non-commuting variables over $\mathbb{Q}$ is invertible or not. The analogous question for commuting variables is the celebrated…
Three kinds of identities involving non-commutating operators and Euler and Bernoulli polynomials are studied. The first identity, as given by Bender and Bettencourt, expresses the nested commutator of the Hamiltonian and momentum operators…
Representations by linear integral operators on $L_p$ spaces over measure spaces are investigated for the polynomial covariance type commutation relations and more general two-sided generalizations of covariance commutation relations…
We obtain a criterion on the commutativity of polynomials in the enveloping algebra of a Lie algebra in terms of an involution condition with respect to the Berezin bracket. As an application, it is shown that the commutativity requirement…
We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices.…
We investigate decidability of equivalence of register transducers, also called copyful Streaming String Transducers in case of string input, extended with an operation of substituting a register for all occurrences of a given letter in…
In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.
In this paper we consider several problems of joint similarity to tuples of bounded linear operators in noncommutative polydomains and varieties associated with sets of noncommutative polynomials. We obtain analogues of classical results…
An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying known techniques is that a noncommutative circuit of size…
We introduce a framework for proving statements about linear operators by verification of ideal membership in a free algebra. More specifically, arbitrary first-order statements about identities of morphisms in preadditive semicategories…
In the last decades many authors have become interested in the study of multilinear and polynomial generalizations of families of operator ideals (such as, for instance, the ideal of absolutely summing operators). However, these…