Related papers: Need Polynomial Systems be Doubly-exponential?
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
Polynomial processes are defined by the property that conditional expectations of polynomial functions of the process are again polynomials of the same or lower degree. Many fundamental stochastic processes, including affine processes, are…
In this paper, we obtain several new classes of irreducible polynomials having integer coefficients whose zeros lie inside an open disk around the origin or outside a closed annular region in the complex plane. Such irreducible polynomials…
Valiant's famous VP vs. VNP conjecture states that the symbolic permanent polynomial does not have polynomial-size algebraic circuits. However, the best upper bound on the size of the circuits computing the permanent is exponential.…
In [Jalowy, Kabluchko, Marynych, arXiv:2504.11593v1, 2025], the authors discuss a user-friendly approach to determine the limiting empirical zero distribution of a sequence of real-rooted polynomials, as the degree goes to $\infty$. In this…
In this paper, an original reduction algorithm for solving simultaneous multivariate polynomial equations is presented. The algorithm is exponential in complexity, but the well-known algorithms, such as the extended Euclidean algorithm and…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…
Motivated by Tweedie's formula for the Compound Decision problem, we examine the theoretical foundations of empirical Bayes estimators that directly model the marginal density $m(y)$. Our main result shows that polynomial log-marginals of…
We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…
This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…
The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…
We study multiple orthogonal polynomials of Meixner-Pollaczek type with respect to a symmetric system of two orthogonality measures. Our main result is that the limiting distribution of the zeros of these polynomials is one component of the…
We study the problem of stabilization for the acoustic system with a spatially distributed damping. Imposing various hypotheses on the structural properties of the damping term, we identify either exponential or polynomial decay of…
Laguerre's theorem regarding the number of non-real zeros of a polynomial and its image under certain linear operators is generalized. This generalization is then used to (1) exhibit a number of previously undiscovered complex zero…
The two-matrix model can be solved by introducing bi-orthogonal polynomials. In the case the potentials in the measure are polynomials, finite sequences of bi-orthogonal polynomials (called "windows") satisfy polynomial ODEs as well as…
In this paper we prove that assuming Schanuel's conjecture, an exponential polynomial in one variable over the algebraic numbers has only finitely many algebraic solutions. This implies a positive answer to Shapiro's conjecture for…
Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT…
Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…
This article addresses an equidistribution problem concerning the zeros of systems of random holomorphic sections of positive line bundles on compact K\"{a}hler manifolds and random polynomials on $\mathbb{C}^{m}$ in the setting of the…