Related papers: Polynomial Roots and Open Mappings

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Let $T\colon X\to X$ be a bounded operator on Banach space, whose spectrum $\sigma(T)$ is included in the closed unit disc $\overline{\mathbb D}$. Assume that the peripheral spectrum $\sigma(T)\cap{\mathbb T}$ is finite and that $T$…

We consider the normal matrix model with a cubic potential. The model is ill-defined, and in order to reguralize it, Elbau and Felder introduced a model with a cut-off and corresponding system of orthogonal polynomials with respect to a…

We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…

We develop the algebraic polynomial theory for "supertropical algebra," as initiated earlier over the real numbers by the first author. The main innovation there was the introduction of "ghost elements," which also play the key role in our…

We generalize the notion of Monk's schema in such a way to integrate finite dimensions. This allows us to lift a plathora of deep results proved for finite dimensions to the infinite dimensional case, like the solution to problem 2.12 in…

The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…

The algebra B of bicomplex numbers is viewed as a complexification of the Archimedean f-algebra of hyperbolic numbers D. This lattice-theoretic approach allows us to establish new properties of the so-called D-norms. In particular, we show…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Emil Artin defined a zeta function for algebraic curves over finite fields and made a conjecture about them analogous to the famous Riemann hypothesis. This and other conjectures about these zeta functions would come to be called the Weil…

The classical Gauss--Lucas theorem describes the location of the critical points of a polynomial. There is also a hyperbolic version, due to Walsh, in which the role of polynomials is played by finite Blaschke products on the unit disk. We…

In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix…

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain orbit closures, many beautiful mathematical properties are…

We show that a densely defined closable operator $A$ such that the resolvent set of $A^2$ is not empty is necessarily closed. This result is then extended to the case of a polynomial $p(A)$. We also generalize a recent result by…

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

Rational approximations of functions with singularities can converge at a root-exponential rate if the poles are exponentially clustered. We begin by reviewing this effect in minimax, least-squares, and AAA approximations on intervals and…

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

In this paper we investigate the reproducing kernel Hilbert space where the polylogarithm appears as kernel functions. This investigation begins with the properties of functions in this space, and here a connection to the classical Hardy…