Related papers: Efficient Polynomial Identity Testing Over Nonasso…
The objective of this paper is the proof of a conjecture of Kontsevich on the isomorphism between groups of polynomial symplectomorphisms and automorphisms of the corresponding Weyl algebra in characteristic zero. The proof is based on the…
We introduce a quantitative version of polynomial cohomology for discrete groups and show that it coincides with usual group cohomology when combinatorial filling functions are polynomially bounded. As an application, we show that Betti…
Let $F$ be an algebraically closed field of characteristic zero. We consider the question which subsets of $M_n(F)$ can be images of noncommutative polynomials. We prove that a noncommutative polynomial $f$ has only finitely many similarity…
In this set of three companion manuscripts/articles, we unveil our new results on primality testing and reveal new primality testing algorithms enabled by those results. The results have been classified (and referred to) as…
Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…
We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…
The group isomorphism problem in computational complexity asks whether two finite groups given by their Cayley tables are isomorphic or not. Although polynomial-time isomorphism tests exist for many specific types of groups, no general…
This is a short survey of works on identical relations in group rings, enveloping algebras, Poisson symmetric algebras and other related algebraic structures. First, the classical work of Passman specified group rings that satisfy…
In the algebraic metacomplexity framework we prove that the decomposition of metapolynomials into their isotypic components can be implemented efficiently, namely with only a quasipolynomial blowup in the circuit size. We use this to…
A new algorithm for real root isolation of polynomial equations based on hybrid computation is presented in this paper. Firstly, the approximate (complex) zeros of the given polynomial equations are obtained via homotopy continuation…
We study an algorithm for approximating the multivariate independence polynomial $Z(\mathbf{z})$, with negative and complex arguments, an object that has strong connections to combinatorics and to statistical physics. In particular, the…
We find all homogeneous quadratic systems of ODEs with two dependent variables that have polynomial first integrals and satisfy the Kowalevski-Lyapunov test. Such systems have infinitely many polynomial infinitesimal symmetries. We describe…
Equivalence testing for a polynomial family {g_m} over a field F is the following problem: Given black-box access to an n-variate polynomial f(x), where n is the number of variables in g_m, check if there exists an A in GL(n,F) such that…
Real algebraic geometry provides certificates for the positivity of polynomials on semi-algebraic sets by expressing them as a suitable combination of sums of squares and the defining inequalitites. We show how Putinar's theorem for…
We study the problem of space and time efficient evaluation of a nonparametric estimator that approximates an unknown density. In the regime where consistent estimation is possible, we use a piecewise multivariate polynomial interpolation…
We give a new framework for proving the existence of low-degree, polynomial approximators for Boolean functions with respect to broad classes of non-product distributions. Our proofs use techniques related to the classical moment problem…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
In this paper, we initiate the study of deterministic PIT for $\Sigma^{[k]}\Pi\Sigma\Pi^{[\delta]}$ circuits over fields of any characteristic, where $k$ and $\delta$ are bounded. Our main result is a deterministic polynomial-time black-box…
We give unified modular proofs to all of Gosper's identities on the $q$-constant $\Pi_q$. We also confirm Gosper's observation that for any distinct positive integers $n_1,\cdots,n_m$ with $m\geq 3$, $\Pi_{q^{n_1}}$, $\cdots$,…