Related papers: On the complex zeros and the computational complex…
We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…
We continue and extend previous work on the parameterized complexity analysis of the NP-hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening earlier results both on the side of parameterized hardness as well…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
We address two sets of long-standing open questions in probability theory, from a computational complexity perspective: divisibility of stochastic maps, and divisibility and decomposability of probability distributions. We prove that finite…
We consider the family $\{f_L\}_{L>0}$ of Gaussian analytic functions in the unit disk, distinguished by the invariance of their zero set with respect to hyperbolic isometries. Let $n_L\left(r\right)$ be the number of zeros of $f_L$ in a…
We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…
We survey results on the distribution of zeros of random polynomials and of random holomorphic sections of line bundles, especially for large classes of probability measures on the spaces of holomorphic sections. We provide furthermore some…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
Following the work of Asai, Kaneko, and Ninomiya for Faber polynomials associated to $\mathrm{PSL}_2(\mathbb{Z})$, and Bannai, Kojima, and Miezaki's partial proof for the case of $\Gamma_0^*(2)$, we show that the zeros of certain modular…
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…
We consider the problem of sensitivity of threshold risk, defined as the probability of a function of a random variable falling below a specified threshold level $\delta >0.$ We demonstrate that for polynomial and rational functions of that…
This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…
We explore the connection between two seemingly distant fields: the set of cyclic functions $f$ in a Hilbert space of analytic functions over the unit disc $\D$, on the one hand, and the families of orthogonal polynomials for a weight on…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
Systems of differential equations with polynomial right-hand sides are very common in applications. On the other hand, their mathematical analysis is very challenging in general, due to the possibility of complex dynamics: multiple basins…
We prove locally uniform spacing for the zeros of orthogonal polynomials on the real line under weak conditions (Jacobi parameters approach the free ones and are of bounded variation). We prove that for ergodic discrete Schrodinger…
We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…
In this paper we deal with composite rational functions having zeros and poles forming consecutive elements of an arithmetic progression. We also correct a result published earlier related to composite rational functions having a fixed…
In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…