Related papers: Efficient Polynomial Identity Testing Over Nonasso…
We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…
An algebra $A$ with multiplication $A\times A \to A, (a,b)\mapsto a\circ b$, is called right-symmetric, if $a\circ(b\circ c)-(a\circ b)\circ a\circ (c\circ b)-(a\circ c)\circ b,$ for any $a,b,c\in A$. The multiplication of right-symmetric…
We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real…
For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…
Nonassociative algebras satisfying the polynomial identities x(yz)=y(xz) and (xy)z=(xz)y are called bicommutative. We prove the following results: (i) Finitely generated bicommutative algebras are weakly noetherian, i.e., satisfy the…
We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution…
Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…
Some near-optimal polynomial root-finders of 2024-25, based on subdivision iterations, approximate all complex roots of a polynomial or all roots in a fixed Region of Interest in the complex plane. The iterations can be applied to a black…
Let $R$ be an associative algebra over a field $K$ generated by a vector subspace $V$. The polynomial $f(x_1,\ldots,x_n)$ of the free associative algebra $K\langle x_1,x_2,\ldots\rangle$ is a weak polynomial identity for the pair $(R,V)$ if…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
We study deterministic polynomial identity testing (PIT) and reconstruction algorithms for depth-$4$ arithmetic circuits of the form \[ \Sigma^{[r]}\!\wedge^{[d]}\!\Sigma^{[s]}\!\Pi^{[\delta]}. \] This model generalizes Waring…
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad\'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp.…
Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algorithms with good polynomial bound are not computationally…
We consider the following question posted by K.I. Beidar and A.V. Mikhalev in 1995 for an associative ring $R=R_1+R_2$: is it true that if the subrings $R_1$ and $R_2$ satisfy polynomial identities, then $R$ also satisfies a polynomial…
We give deterministic black-box polynomial identity testing algorithms for multilinear read-once oblivious algebraic branching programs (ROABPs), in n^(lg^2 n) time. Further, our algorithm is oblivious to the order of the variables. This is…
It is well known that the integral identity conjecture is of prime importance in Kontsevich-Soibelman's theory of motivic Donaldson-Thomas invariants for non-commutative Calabi-Yau threfolds. In this article we consider its numerical…
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…