Related papers: Information-Based Complexity vs Computational Comp…
The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…
In this work, we address the problem of polynomial interpolation of non-pointwise data. More specifically, we assume that our input information comes from measurements obtained on diffuse compact domains. Although the nodal and the diffused…
We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…
Let K denote an algebraically closed field. We study the relation between an ideal I in K[x1,...,xn] and its cross sections I_a=I+<x1-a>. In particular, we study under what conditions I can be recovered from the set I_S={(a,I_a):a in S}…
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by the fact that nonnegative separable and nonnegative quadratic…
We outline the super-resolution reconstruction problem posed as a maximization of probability. We then introduce an interpolation method based on polygonal pixel overlap, express it as a linear operator, and use it to improve…
Phase retrieval arises in various fields of science and engineering and it is well studied in a finite-dimensional setting. In this paper, we consider an infinite-dimensional phase retrieval problem to reconstruct real-valued signals living…
We intend to create new concepts aimed at finding necessary and sufficient conditions for Boolean satisfiability so that these conditions can be verified in polynomial time. Based on these conditions it will be possible to create an…
Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
Polynomial factorization over $ZZ$ is of great historical and practical importance. Currently, the standard technique is to factor the polynomial over finite fields first and then to lift to integers. Factorization over finite fields can be…
Maximum likelihood iteration is one of the most commonly used reconstruction algorithms in quantum tomography. The main appeal of the method is that it is easy to implement and that it converges reliably to a physically meaningful density…
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…
In this work we shall review the (phased) inverse scattering problem and then pursue the phaseless reconstruction from far-field data with the help of the concept of scattering coefficients. We perform sensitivity, resolution and stability…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…
We prove the existence of complex polynomials $p(z)$ of degree $n$ and $q(z)$ of degree $m<n$ such that the harmonic polynomial $ p(z) + \overline{q(z)}$ has at least $\lceil n \sqrt{m} \rceil$ many zeros. This provides an array of new…
We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…
In this paper we present a new algorithm for Polynomial Linear System Solving (via evaluation/interpolation) with errors. In this scenario, errors can occur in the black box evaluation step. We improve the bound on the number of errors that…
The conjugate phase retrieval problem concerns the determination of a complex-valued function, up to a unimodular constant and conjugation, from its magnitude observations. It can also be considered as a conjugate phaseless sampling and…