Related papers: Efficient Black-Box Identity Testing over Free Gro…

The goal of this paper is to prove operator identities using equalities between noncommutative polynomials. In general, a polynomial expression is not valid in terms of operators, since it may not be compatible with domains and codomains of…

Consider a tuple $(Y_1,\dots,Y_d)$ of normal operators in a tracial operator algebra setting with prescribed sizes of the eigenspaces for each $Y_i$. We address the question what one can say about the sizes of the eigenspaces for any…

The Tits alternative states that a finitely generated matrix group either contains a nonabelian free subgroup $F_2$, or it is virtually solvable. This paper considers two decision problems in virtually solvable matrix groups: the Identity…

One of the main applications of free probability is to show that for appropriately chosen independent copies of $d$ random matrix models, any noncommutative polynomial in these $d$ variables has a spectral distribution that converges…

We consider the generalised root identities introduced in [1] for simple functions, and also for \Gamma(z+1) and \zeta(s). In this paper, unlike [1], we focus on the case of noninteger \mu. For the simplest function f(z)=z, and hence for…

We prove that the F-signature of an affine semigroup ring of positive characteristic is always a rational number, and describe a method for computing this number. We use this method to determine the F-signature of Segre products of…

Testing efficiently whether a finite set with a binary operation over it, given as an oracle, is a group is a well-known open problem in the field of property testing. Recently, Friedl, Ivanyos and Santha have made a significant step in the…

Automatic theorem proving with deep learning methods has attracted attentions recently. In this paper, we construct an automatic proof system for trigonometric identities. We define the normalized form of trigonometric identities, design a…

It is well known that an element of the algebra of noncommutative *-polynomials is positive in all *-representations if and only if it is a sum of squares. This provides an effective way to determine if a given *-polynomial is positive, by…

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

Equations in free groups have become prominent recently in connection with the solution to the well known Tarski Conjecture. Results of Makanin and Rasborov show that solvability of systems of equations is decidable and there is a method…

Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…

We derive some Positivstellensatz\"e for noncommutative rational expressions from the Positivstellensatz\"e for noncommutative polynomials. Specifically, we show that if a noncommutative rational expression is positive on a polynomially…

Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Let $D$ be a noncommutative division ring. In a recent paper, Lee and Lin proved that if $\text{char}\, D\ne 2$, the only solution of additive maps $f, g$ on $D$ satisfying the identity $f(x) = x^n g(x^{-1})$ on $D\setminus \{0\}$ with…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

This article studies the categorical setting of Abramsky, Haghverdi, and Scott's untyped linear combinatory algebras, and relates this to more recent work of Abramsky and Heunen on Frobenius algebras in the infinitary setting. The key to…

Powerful skew arithmetic circuits are introduced. These are skew arithmetic circuits with variables, where input gates can be labelled with powers $x^n$ for binary encoded numbers $n$. It is shown that polynomial identity testing for…

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…