Related papers: Extreme points and saturated polynomials

Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$ and $\mathcal{F}$ be a family of geometric objects. We call a point $x \in P$ a strong centerpoint of $P$ w.r.t $\mathcal{F}$ if $x$ is contained in all $F \in \mathcal{F}$ that contains more…

We establish a rigid-analytic analog of the Pila-Wilkie counting theorem, giving sub-polynomial upper bounds for the number of rational points in the transcendental part of a $\mathbb{Q}_p$-analytic set, and the number of rational functions…

Let f(z) be a rational function of degree at least 2 with coefficients in a number field K, and assume that the second iterate f^2(z) of f(z) is not a polynomial. The second author previously proved that for any b in K, the forward orbit…

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

We introduce a family of extremal polynomials associated with the prolongation of a stratified nilpotent Lie algebra. These polynomials are related to a new algebraic characterization of abnormal subriemannian geodesics in stratified…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…

We first introduce a configuration of arbitrary isogonal conjugates related to a known property concerning the spiral center of two pairs of isogonal conjugates. We then consider a special case where two conics are tangent at exactly two…

We characterize those valued fields for which the image of the valuation ring under every polynomial in several variables contains an element of maximal value, or zero.

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

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…

Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ may be complex. We impose some restriction on the coefficients of the real part of the given polynomial…

We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of…

We describe a genetic algorithm to find extreme examples in the arithmetic of dynamical systems. The algorithm is applied to four problems: small (non-zero) canonical heights, many rational preperiodic points, long rational cycles, and long…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…