Related papers: Identity Testing for Radical Expressions

We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an deterministic white-box polynomial identity…

Let $A$ be a residually finite dimensional algebra (not necessarily associative) over a field $k$. Suppose first that $k$ is algebraically closed. We show that if $A$ satisfies a homogeneous almost identity $Q$, then $A$ has an ideal of…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration…

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…

Four-center two-electron Coulomb integrals routinely appear in electronic structure algorithms. The resolution-of-the-identity (RI) is a popular technique to reduce the computational cost for the numerical evaluation of these integrals in…

This paper is about solving polynomial systems. It first recalls how to do that efficiently with a very high probability of correctness by reconstructing a rational univariate representation (rur) using Groebner revlex computation,…

A read-once oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum…

Let $R$ be a ring satisfying a polynomial identity and let $\delta$ be a derivation of $R$. We show that if $N$ is the nil radical of $R$ then $\delta(N)\subseteq N$ and the Jacobson radical of $R[x;\delta]$ is equal to $N[x;\delta]$. As a…

We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a novel way to compute a lower bound on the positive real…

General concept of a gradation slicing is used to analyze polynomial solutions of ordinary differential equations (ODE) with polynomial coefficients, ${\cal L}\psi=0$, where ${\cal L}=\sum_l p_l(z) d_z^l$, $p_l(z)$ are polynomials, $z$ is a…

The complexity of representing a polynomial by a Read-Once Oblivious Algebraic Branching Program (ROABP) is highly dependent on the chosen variable ordering. Bhargava et al. prove that finding the optimal ordering is NP-hard, and provide…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

In this paper we study an extension of the Polynomial Calculus proof system where we can introduce new variables and take a square root. We prove that an instance of the subset-sum principle, the binary value principle, requires refutations…

A polynomial is real-rooted if all of its roots are real. For every polynomial $f(t) \in {\mathbf R}[t]$, the Hermite-Sylvester theorem associates a quadratic form $\Phi_2$ such that $f(t)$ is real-rooted if and only if $\Phi_2$ is positive…

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

We consider the problem of testing distribution identity. Given a sequence of independent samples from an unknown distribution on a domain of size n, the goal is to check if the unknown distribution approximately equals a known distribution…

We describe a connection between the subjects of cluster algebras, polynomial identity algebras and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity…

We introduce analysis of orbital parities as a concept and a tool for understanding radicals. Based on fundamental reduced one- and two-electron density matrices, our approach allows us to evaluate a total measure of radical character and…