Related papers: Efficient Polynomial Identity Testing Over Nonasso…

Three symbolic algorithms for testing the integrability of polynomial systems of partial differential and differential-difference equations are presented. The first algorithm is the well-known Painlev\'e test, which is applicable to…

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares…

We consider the cyclotomic identity testing (CIT) problem: given a polynomial $f(x_1,\ldots,x_k)$, decide whether $f(\zeta_n^{e_1},\ldots,\zeta_n^{e_k})$ is zero, where $\zeta_n = e^{2\pi i/n}$ is a primitive complex $n$-th root of unity…

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

Mulmuley recently gave an explicit version of Noether's Normalization lemma for ring of invariants of matrices under simultaneous conjugation, under the conjecture that there are deterministic black-box algorithms for polynomial identity…

Using an elementary approach involving the Euler Beta function and the binomial theorem, we derive two polynomial identities; one of which is a generalization of a known polynomial identity. Two well-known combinatorial identities, namely…

The Ideal Proof System (IPS) of Grochow & Pitassi (FOCS 2014, J. ACM, 2018) is an algebraic proof system that uses algebraic circuits to refute the solvability of unsatisfiable systems of polynomial equations. One potential drawback of IPS…

Read-$k$ oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ROABPs). In this work, we give an exponential lower bound of $\exp(n/k^{O(k)})$ on…

This paper is concerned with the construction of a small, but non-trivial, example of a polynomial identity algebra, which we call the \emph{Jackson algebra}, that will be used in sequels to this paper to study non-commutative arithmetic…

In this paper we present a theorem concerning an equivalent statement of the Jacobian Conjecture in terms of Picard-Vessiot extensions. Our theorem completes the earlier work of T. Crespo and Z. Hajto which suggested an effective criterion…

In this thesis, we study the properties of a nonassociative algebra construction from skew polynomial rings. This construction was introduced by Petit in the 1960s but largely ignored until recently. In particular, the automorphism groups…

Let $(P,\cdot,d)$ be a differential perm algebra over a field of characteristic $0$, i.e. an associative algebra satisfying $(ab)c=(ba)c$ equipped with a derivation $d$. We investigate polynomial identities in the algebras obtained from $d$…

The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…

[PLEASE SEE COMMENT] We consider the isomorphism problem for finite abelian groups and finite meta-cyclic groups. We prove that for a dense set of positive integers $n$, isomorphism testing for abelian groups of black-box type of order $n$…

We define the notion of an almost polynomial identity of an associative algebra $R$, and show that its existence implies the existence of an actual polynomial identity of $R$. A similar result is also obtained for Lie algebras and Jordan…

Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…

In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\Sigma_k$-RO-ABPs), generalizing the work in (Shpilka and Volkovich 2008,2009), who considered sums of $k$ read-once formulas…

Polynomial identities of two-dimensional Novikov algebras are studied over the complex field $\mathbb{C}$. We determine minimal generating sets for the T-ideals of the polynomial identities and linear bases for the corresponding relatively…

Over an arbitrary field, we conduct a comprehensive study of the polynomial identities and codimensions of two- and three-dimensional metabelian non-Lie Leibniz algebras. In addition, we compute the images of multihomogeneous polynomials on…

Suppose a finite dimensional semisimple Lie algebra $\mathfrak g$ acts by derivations on a finite dimensional associative or Lie algebra $A$ over a field of characteristic $0$. We prove the $\mathfrak g$-invariant analogs of Wedderburn -…