English
Related papers

Related papers: Unexpected local extrema for the Sendov conjecture

200 papers

We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

Commutative Algebra · Mathematics 2016-08-14 Martin Kohls , Müfit Sezer

Let $X \in \{0,\ldots,n \}$ be a random variable, with mean $\mu$ and standard deviation $\sigma$ and let \[f_X(z) = \sum_{k} \mathbb{P}(X = k) z^k, \] be its probability generating function. Pemantle conjectured that if $\sigma$ is large…

Probability · Mathematics 2019-08-29 Marcus Michelen , Julian Sahasrabudhe

Let \( P(z) \) be a polynomial of degree \( n \) and $\alpha \in \mathbb{C}$. The polar derivative of \( P(z) \), denoted by \( D_\alpha P(z) \) and is defined by $D_\alpha P(z): = nP(z) + (\alpha -z)P'(z)$. The polar derivative \( D_\alpha…

Complex Variables · Mathematics 2026-01-16 N. A. Rather , Danish Rashid Bhat , Tanveer Bhat

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

Complex Variables · Mathematics 2016-12-26 Catherine Bénéteau , Dmitry Khavinson , Constanze Liaw , Daniel Seco , Alan A. Sola

Let $ P(z) $ be a polynomial of degree $ n $ having all zeros in $|z|\leq k$ where $k\leq 1,$ then it was proved by Dewan \textit{et al} that for every real or complex number $\alpha$ with $|\alpha|\geq k$ and each $r\geq 0$ $$…

Complex Variables · Mathematics 2013-04-03 N. A. Rather , Suhail Gulzar

Let H be the supremum of finitely many real polynomials of degree d and assume that H has a strict local minimum at 0. We prove a \L ojasiewicz-type inequality $H(x_1,...,x_n) > ||(x_1,...,x_n)||^s$ where s depends only on d and n. This…

Algebraic Geometry · Mathematics 2007-05-23 János Kollár

Andreev's Problem states the following: Given an integer $d$ and a subset of $S \subseteq \mathbb{F}_q \times \mathbb{F}_q$, is there a polynomial $y = p(x)$ of degree at most $d$ such that for every $a \in \mathbb{F}_q$, $(a,p(a)) \in S$?…

Computational Complexity · Computer Science 2019-07-19 Aditya Potukuchi

We consider some known and some new properties of the family of polynomials introduced by Ted Suffridge in 1969. We begin by giving a brief overview of their extremal properties in classic and more recent work. We also give a compact form…

Complex Variables · Mathematics 2020-10-07 Jimmy Dillies , Dmitriy Dmitrishin , Alex Stokolos

We give a construction which produces irreducible complex rigid local systems on $\Bbb{P}_{\Bbb{C}}^1-\{p_1,\dots,p_s\}$ via quantum Schubert calculus and strange duality. These local systems are unitary and arise from a study of vertices…

Algebraic Geometry · Mathematics 2021-12-10 Prakash Belkale

In this paper, we make progress on a question related to one of Galvin that has attracted substantial attention recently. The question is that of determining among all graphs $G$ with $n$ vertices and $\Delta(G)\leq r$, which has the most…

Combinatorics · Mathematics 2014-05-07 Jonathan Cutler , A. J. Radcliffe

For any prime $p$ and real number and $\alpha$, the $p$-adic Littlewood Conjecture due to de Mathan and Teuli\'e asserts that \[\inf_{|m|\ge1}|m|_p\cdot |m|\cdot |\left\langle\alpha m\right\rangle|=0.\] Above, $|m|$ is the usual absolute…

Number Theory · Mathematics 2025-11-03 Steven Robertson

We study a question with connections to linear algebra, real algebraic geometry, combinatorics, and complex analysis. Let $p(x,y)$ be a polynomial of degree $d$ with $N$ positive coefficients and no negative coefficients, such that $p=1$…

Complex Variables · Mathematics 2010-05-26 Jiri Lebl , Daniel Lichtblau

Let $k\leq n$. Each polynomial $p\in\oR[x_1,...,x_n]$ can be uniquely written as $p=\sum_{\mu}\mu p_{\mu}$, where $\mu$ ranges over the set $M$ of all monomials in $\oR[x_1,...,x_k]$ and where $p_{\mu}\in\oR[x_{k+1},...,x_n]$. If $p$ is…

Combinatorics · Mathematics 2012-11-16 Alexander Schrijver

Erd\H{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is…

Computational Geometry · Computer Science 2013-03-25 Gabriel Nivasch , János Pach , Rom Pinchasi , Shira Zerbib

We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…

Numerical Analysis · Mathematics 2011-11-28 Philip J. Aston , Oliver Junge

In this paper, we investigate an upper bound of the polar derivative of a polynomial of degree $n$ $$p(z)=(z-z_m)^{t_m} (z-z_{m-1})^{t_{m-1}}\cdots (z-z_0)^{t_0}(a_0+\sum\limits_{\nu=\mu} ^{n-(t_m+\cdots+t_0)} a_{\nu}z^\nu)$$ where zeros…

Complex Variables · Mathematics 2018-04-30 Nuttapong Arunrat , Keaitsuda Maneeruk Nakprasit

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

Number Theory · Mathematics 2015-01-14 Artūras Dubickas , Min Sha

In this paper, we show exponential lower bounds for the class of homogeneous depth-$5$ circuits over all small finite fields. More formally, we show that there is an explicit family $\{P_d : d \in \mathbb{N}\}$ of polynomials in…

Computational Complexity · Computer Science 2015-07-02 Mrinal Kumar , Ramprasad Saptharishi

Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…

Probability · Mathematics 2018-11-20 László Györfi , Norbert Henze , Harro Walk

In this paper we partially settle our conjecture from [1] (math.SP/0701143) on roots of eigenpolynomials for degenerate exactly-solvable operators. Namely, for any such operator, we establish a lower bound (which supports our conjecture)…

Spectral Theory · Mathematics 2007-05-23 Tanja Bergkvist , Jan-Erik Bjork