Related papers: Progress on Polynomial Identity Testing - II
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…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
Calibration tests based on the probability integral transform (PIT) are routinely used to assess the quality of univariate distributional forecasts. However, PIT-based calibration tests for multivariate distributional forecasts face various…
The field of property testing of probability distributions, or distribution testing, aims to provide fast and (most likely) correct answers to questions pertaining to specific aspects of very large datasets. In this work, we consider a…
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…
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…
We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…
Motivated by the question of data quantization and "binning," we revisit the problem of identity testing of discrete probability distributions. Identity testing (a.k.a. one-sample testing), a fundamental and by now well-understood problem…
The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…
Polynomial time primality tests for specific classes of numbers of the form $k\cdot 2^m \pm 1$ are introduced.
We discuss some geometric invariants of polynomial identities of algebras deduced from Kemer's theory and deduce some quantitative information on codimension and co--length
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether $S$ is a semigroup or has an identity element. If S is a monoid, we want to…
This article investigates the two-parameter quantum matrix algebra at roots of unity. In the roots of unity setting, this algebra becomes a Polynomial Identity (PI) algebra and it is known that simple modules over such algebra are…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
Our paper deals about identities involving Bell polynomials. Some identities on Bell polynomials derived using generating function and successive derivatives of binomial type sequences. We give some relations between Bell polynomials and…
We study polynomial identities of algebras with adjoined external unit. For a wide class of algebras we prove that adjoining external unit element leads to increasing of PI-exponent precisely to 1. We also show that any real number from the…
We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…