Related papers: Four-point distortion theorem for complex polynomi…

Two-view triangulation is a problem of minimizing a quadratic polynomial under an equality constraint. We derive a polynomial that encodes the local minimizers of this problem using the theory of Lagrange multipliers. This offers a simpler…

Let $N\ge 4$. We show that, if $x_1,\dots,x_N$ and $y_1,\dots,y_N$ are $N$-tuples of strictly positive numbers whose arithmetic, geometric and harmonic means agree, then \[ \max_j x_j <(N-2)\max_j y_j \quad\text{and}\quad \min_j x_j…

By using some techniques of the divided difference operators, we establish an 4n-point interpolation formula. Certain polynomials, such as Jackson's _8\phi_7 terminating summation formula, are special cases of this formula. Based on…

Invertible compositions of one-dimensional maps are studied which are assumed to include maps with non-positive Schwarzian derivative and others whose sum of distortions is bounded. If the assumptions of the Koebe principle hold, we show…

Fixed points for scalar theories in $4-\varepsilon$, $6-\varepsilon$ and $3-\varepsilon$ dimensions are discussed. It is shown how a large range of known fixed points for the four dimensional case can be obtained by using a general…

The main result is a wall crossing formula for central projections defined on submanifolds of a real projective space. Our formula gives the jump of the degree of such a projection when the center of the projection varies. The fact that the…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

We extend a theorem of Herman from the case of unicritical polynomials to the case of polynomials with two finite critical values. This theorem states that Siegel disks of such polynomials, under a diophantine condition (called Herman's…

In this paper I prove a conjecture which gives a lower bound for the largest absolute value of the coefficients of the n-th cyclotomic polynomial for some n. Moreover this estimate is essentially sharp.

For a degree $5$ real polynomial with roots $x_1\leq \cdots \leq x_5$ and roots $\xi_1\leq \cdots \leq \xi_4$ of its derivative, we set $z_j:=(x_j+x_{j+1})/2$, $1\leq j\leq 4$. We prove that one cannot have at the same time $\min_{1\leq…

We prove a quantitative Roth-type theorem for polynomial corners in $\mathbb{R}^2$. Let $P_1$ and $P_2$ be two linearly independent polynomials with zero constant term. We show that any measurable subset of $[0,1]^2$ with positive measure…

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

We apply the Thom-Milnor theorem to obtain the upper bounds on the amount of isolated (1) critical points of a potential generated by several fixed point charges(Maxwell's problem on point charges), (2) critical points of SINR, (3) critical…

In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

We prove that if $P(X) \in \mathbb{Z}[X]$ is an integer polynomial of degree $n$ and having $P(0) = 1$, then either $P(X)$ is a product of cyclotomic polynomials, or else at least one of the complex roots of $P$ belongs to the disk $|z|…

In this paper, we obtain new results on the critical points of a polynomial, these results are useful to the Sendov conjecture.

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…