Related papers: Midpoints and critical points
Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…
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…
Let p(x) be a polynomial of degree 4 with four distinct real roots r1<r2<r3<r4. Let x1<x2<x3 be the critical points of p, and define the ratios s_{k}=((x_{k}-r_{k})/(r_{k+1}-r_{k})),k=1,2,3. For notational convenience, let s1=u, s2=v, and…
For a rational polynomial $f$ and rational numbers $c, u$, we put $f_c(x):=f(x)+c$, and consider the Zsigmondy set $\mathcal{Z}(f_c,u)$ associated to the sequence $\{f_c^n(u)-u\}_{n\geq 0}$, where $f_c^n$ is the $n$-st iteration of $f_c$.…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
We discuss two conjectures. (I) For each x_1,...,x_n \in R (C) there exist y_1,...,y_n \in R (C) such that \forall i \in {1,...,n} |y_i| \leq 2^{2^{n-2}} \forall i \in {1,...,n} (x_i=1 \Rightarrow y_i=1) \forall i,j,k \in {1,...,n}…
In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…
Hyperbolic polynomials are real multivariate polynomials with only real roots along a fixed pencil of lines. Testing whether a given polynomial is hyperbolic is a difficult task in general. We examine different ways of translating…
We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…
For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…
We consider polynomials of degree $d$ with only real roots and a fixed value of discriminant, and study the problem of minimizing the absolute value of polynomials at a fixed point off the real line. There are two explicit families of…
This paper is concerned with the analytic behaviors (monotonicity, isochronicity and the number of critical points) of period function for potential system $\ddot{x}+g(x)=0$.We give some sufficient criteria to determine the monotonicity and…
Below we establish the conditions guaranteeing the reality of all the zeros of polynomials $P_n(z)$ in the polynomial sequence $\{P_n(z)\}_{n=1}^{\infty}$ satisfying a five-term recurrence relation $$P_{n}(z)= zP_{n-1}(z) + \alpha…
Let $p(w)=(w-w_{1})(w-w_{2})(w-w_{3}),$with $\func{Re}w_{1}<\func{Re}w_{2}<\func{Re}w_{3}$. Assume that if the critical points of $p$ are not identical, then they cannot have equal real parts. Define the ratios…
We call a smooth function of one variable a degree n pseudopolynomial if its n-th derivative has no (real) zeros. An n pseudopolynomial is called hyperbolic if it has exactly n simple zeros. In this short note we describe the necessary and…
Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…
We consider univariate real polynomials with all roots real and with two sign changes in the sequence of their coefficients which are all non-vanishing. One of the changes is between the linear and the constant term. By Descartes' rule of…
We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…
Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…
We study the problem of minimizing the supremum norm, on a segment of the real line or on a compact set in the plane, by polynomials with integer coefficients. The extremal polynomials are naturally called integer Chebyshev polynomials.…