Related papers: Efficient Polynomial Identity Testing Over Nonasso…
Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with…
We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…
We study several questions in the reliable agnostic learning framework of Kalai et al. (2009), which captures learning tasks in which one type of error is costlier than others. A positive reliable classifier is one that makes no false…
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not yet known to belong to either the P or NP-complete…
This is a slightly edited version of my talk on Mathematische Arbeitstagung 2011, Bonn. I present a result relating noncommutative Laurent polynomials with algebraic functions, and show examples of integrability and Laurent phenomenon for…
We study commutative post-Lie algebras $(${\rm CPA}s$)$ from an algebraic point of view. Firstly, we find some new identities in {\rm CPA}, which shows that the commutative multiplication gives a medial and derived commutative associative…
In this paper we consider PI-algebras $A$ over $\R$ or $\C$. It is well known that in general such algebras are not normed algebras. In fact, there is a nilpontent commutative algebra which is not a normed algebra, see [1]. Here we address…
We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…
We consider three classification systems for distributed decision tasks: With unbounded computation and certificates, defined by Balliu, D'Angelo, Fraigniaud, and Olivetti [JCSS'18], and with (two flavors of) polynomially bounded local…
We define a class of "algebraic" random matrices. These are random matrices for which the Stieltjes transform of the limiting eigenvalue distribution function is algebraic, i.e., it satisfies a (bivariate) polynomial equation. The Wigner…
This is a survey on the geometric classification of different varieties of algebras (nilpotent, nil-, associative, commutative associative, cyclic associative, Jordan, Kokoris, standard, noncommutative Jordan, commutative power-associative,…
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…
In the context of dynamical systems, nonlinearity measures quantify the strength of nonlinearity by means of the distance of their input-output behaviour to a set of linear input-output mappings. In this paper, we establish a framework to…
We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
We present a constructive recognition algorithm to decide whether a given black-box group is isomorphic to an alternating or a symmetric group without prior knowledge of the degree. This eliminates the major gap in known algorithms, as they…
Let C be a depth-3 circuit with n variables, degree d and top fanin k (called sps(k,d,n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically…
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…
This is a survey of results obtained jointly with E. Aljadeff and published in Adv. Math. 218 (2008), 1453-1495. We explain how to set up a theory of polynomial identities for comodule algebras over a Hopf algebra, and concentrate on the…
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…