Related papers: Estimating the Koebe radius for polynomials

For a finite group $G$, Frobenius found a formula for the values of the function $\sum_{\mathrm{Irr} G} (\dim\, \pi)^{-s}$ for even integers $s$, where $\mathrm{Irr} G$ is the set of irreducible representations of $G$. We generalize this…

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

Let $f$ be a polynomial with integer coefficients whose degree is at least 2. We consider the problem of covering the orbit $\operatorname{Orb}_f(t)=\{t,f(t),f(f(t)),\cdots\}$, where $t$ is an integer, using arithmetic progressions each of…

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…

In this paper, we investigate the extremal values of (the logarithm of) the characteristic polynomial of a random unitary matrix whose spectrum is distributed according the Circular Beta Ensemble (C$\beta$E). More precisely, if $X_n$ is…

We sharpen the bound $n^{2k}$ on the maximum modulus of the $k^{{\rm th}}$ radial derivative of the Zernike circle polynomials (disk polynomials) of degree $n$ to $n^2(n^2-1^2)\cdot ... \cdot(n^2-(k-1)^2)/2^k(1/2)_k$. This bound is obtained…

For $N \in \mathbb{N}$, let $T_{N}$ be the Chebyshev polynomial of the first kind. Expressions for the sequence of numbers $p_{\ell}^{(N)}$, defined as the coefficients in the expansion of $1/T_{N}(1/z)$, are provided. These coefficients…

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

We use a method based on the division algorithm to determine all the values of the real parameters $b$ and $c$ for which the hypergeometric polynomials $_2F_1(-n, b; c; z)$ have $n$ real, simple zeros. Furthermore, we use the…

The matrix Fej\'er-Riesz theorem characterizes positive semidefinite matrix polynomials on the real line. In the previous work of the second-named author this was extended to the characterization on arbitrary closed semialgebraic sets $K$…

We consider Chebyshev polynomials, $T_n(z)$, for infinite, compact sets $\frak{e} \subset \mathbb{R}$ (that is, the monic polynomials minimizing the sup-norm, $\Vert T_n \Vert_{\frak{e}}$, on $\frak{e}$). We resolve a $45+$ year old…

When solving differential equations by a spectral method, it is often convenient to shift from Chebyshev polynomials $T_{n}(x)$ with coefficients $a_{n}$ to modified basis functions that incorporate the boundary conditions. For homogeneous…

We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real…

We solve the following problem of Z. F\"uredi, J. C. Lagarias and F. Morgan [FLM]: Is there an upper bound polynomial in $n$ for the largest cardinality of a set S of unit vectors in an n-dimensional Minkowski space (or Banach space) such…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

We consider the polynomial equation $$X^n + a_{n-1}\cdot X^{n-1} + \dots + a_1 \cdot X + a_0 \cdot I = O,$$ over $(2 \times 2)$-matrices $X$ with the real entries, where $I$ is the identity matrix, $O$ is the null matrix, $a_i \in \mathbb…

For arbitrary $n$ complex numbers $a_{\nu-1}$, $\nu=1,\dots,n$, where $n$ is sufficiently large, we get the representation in the form of power sums: $a_{\nu-1}=\lambda_1^\nu+\dots+\lambda_{2n+1}^\nu$, where $\lambda_k$ are distinct points,…

By applying the Euler--Rayleigh methods to a specific representation of the Jacobi polynomials as hypergeometric functions, we obtain new bounds for their largest zeros. In particular, we derive upper and lower bound for…

The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…

Let $K$ be a field and $S=K[x_1,\ldots,x_n]$, the ring of polynomials in $n$ variables, over $K$. Using the fact that the Hilbert depth is an upper bound for the Stanley depth of a quotient of squarefree monomial ideals $0\subset…