Related papers: On the Koebe Quarter Theorem for Polynomials

We use algebraic methods in statistical mechanics to represent a multi-parameter class of polynomials in several variables as partition functions of a new family of solvable lattice models. The class of polynomials, defined by A. N.…

Odd degree Chebyshev polynomials over a ring of modulo $2^w$ have two kinds of period. One is an "orbital period". Odd degree Chebyshev polynomials are bijection over the ring. Therefore, when an odd degree Chebyshev polynomial iterate…

Given a polynomial $p$, the degree of its Chebyshev's method $C_p$ is determined. If $p$ is cubic then the degree of $C_p$ is found to be $4,6$ or $7$ and we investigate the dynamics of $C_p$ in these cases. If a cubic polynomial $p$ is…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

We prove a new upper bound for the number of smooth values of a polynomial with integer coefficients. This improves Timofeev's previous result unless the polynomial is a product of linear polynomials with integer coefficients. As an…

In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

We present precise bit and degree estimates for the optimal value of the polynomial optimization problem $f^*:=\text{inf}_{x\in \mathscr{X}}~f(x)$, where $\mathscr{X}$ is a semi-algebraic set satisfying some non-degeneracy conditions. Our…

We study a conjecture called "linear rank conjecture" recently raised in (Tsang et al., FOCS'13), which asserts that if many linear constraints are required to lower the degree of a GF(2) polynomial, then the Fourier sparsity (i.e. number…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

We show that optimal polynomial meshes exist for every convex body in $\mathbb{R}^d$, confirming a conjecture by A. Kroo.

The idea of using polynomial methods to improve simple smoother iterations within a multigrid method for a symmetric positive definite (SPD) system is revisited. When the single-step smoother itself corresponds to an SPD operator, there is…

We prove a Roth type theorem for polynomial corners in the finite field setting. Let $\phi_1$ and $\phi_2$ be two polynomials of distinct degree. For sufficiently large primes $p$, any subset $ A \subset \mathbb F_p \times \mathbb F_p$ with…

For a pair of conjugate trigonometrical polynomials $C (t) = \sum_ { j = 1 } ^N { { a_j}\cos jt }, S(t) = \sum_ { j = 1 } ^N { { a_j}\sin jt }$ with real coefficients and normalization ${a_1} = 1 $ we solve the extremal problem \[ \sup_…

Let S(n) be the set of all polynomials of degree n with all roots in the unit disk, and define d(P) to be the maximum of the distances from each of the roots of a polynomial P to that root's nearest critical point. In this notation,…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

Results of Koebe (1936), Schramm (1992), and Springborn (2005) yield realizations of $3$-polytopes with edges tangent to the unit sphere. Here we study the algebraic degrees of such realizations. This initiates the research on constrained…

We generalize the work of Dem'janenko and Silverman for the Fermat quartics, effectively determining the rational points on the curves $x^{2m}+ax^m+ay^m+y^{2m}=b$ whenever the ranks of some companion hyperelliptic Jacobians are at most one.…

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality…