Related papers: Almost every real quadratic polynomial has a poly-…

For any polynomial map with a single critical point, we prove that its lower Lyapunov exponent at the critical value is negative if and only if the map has an attracting cycle. Similar statement holds for the exponential maps and some other…

Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in…

For all positive integers $k$ and $N$ we prove that there are infinitely many totally real multiquadratic fields $K$ of degree $2^k$ over $\mathbb Q$ such that each universal quadratic form over $K$ has at least $N$ variables.

Let $f(z) = z^2 + c$ be a quadratic polynomial, with c in the Mandelbrot set. Assume further that both fixed points of f are repelling, and that f is not renormalizable. Then we prove that the Julia set J of f is holomorphically removable…

We show that if $P$ is a quadratic polynomial with a fixed Cremer point and Julia set $J$, then for any monotone map $\ph:J\to A$ from $J$ onto a locally connected continuum $A$, $A$ is a single point.

We present the strongest known knot invariant that can be computed effectively (in polynomial time).

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

For any integers $d\ge 3$ and $n\ge 1$, we construct a hyperbolic rational map of degree $d$ such that it has $n$ cycles of the connected components of its Julia set except single points and Jordan curves.

Let $f:\hat{C}\to\hat{C}$ be a subhyperbolic rational map of degree $d$. We construct a set of coding maps $Cod(f)=\{\pi_r:\Sigma\to J\}_r$ of the Julia set $J$ by geometric coding trees, where the parameter $r$ ranges over mappings from a…

We find all quadratic post-critically finite (PCF) rational maps defined over the rationals. We describe an algorithm to search for possibly PCF maps. Using the algorithm, we eliminate all but twelve rational maps, all of which are…

In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…

We show that the iterative logarithm of each non-linear entire function is differentially transcendental over the ring of entire functions, and we give a sufficient criterion for such an iterative logarithm to be differentially…

We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

For the family of quadratic rational functions having a $2$-cycle of bounded type Siegel disks, we prove that each of the boundaries of these Siegel disks contains at most one critical point. In the parameter plane, we prove that the locus…

Let $f$ be a rational map with degree at least two. We prove that $f$ has at least $2$ disjoint and infinite critical orbits in the Julia set if it has a Herman ring. This result is sharp in the following sense: there exists a cubic…

It is shown that a polynomial with a Cremer periodic point has a non-accessible critical point in its Julia set provided that the Cremer periodic point is approximated by small cycles.

We prove for a tropical rational map that if for any point the convex hull of Jacobian matrices at smooth points in a neighborhood of the point does not contain singular matrices then the map is an isomorphism. We also show that a tropical…

The computational complexity of the partition, 0-1 subset sum, unbounded subset sum, 0-1 knapsack and unbounded knapsack problems and their multiple variants were studied in numerous papers in the past where all the weights and profits were…

This paper is concerned with rational curves on real classical groups. Our contributions are three-fold: (i) We determine the structure of quadratic rational curves on real classical groups. As a consequence, we completely classify…