Related papers: Solving Cubic Equations By the Quadratic Formula
This paper presents a quadratic formula-based nonlinear representation for a given single-variable function f(x), $-1 \leq x \leq 1$. First, we construct the explicit polynomial coefficient functions a(x), b(x), and c(x) using a…
We consider the type I multiple orthogonal polynomials (MOPs) $(A_{n,m}, B_{n,m})$ and type II MOPs $P_{n,m}$, satisfying non-hermitian orthogonality with respect to the weight $e^{-z^3}$ on two unbounded contours on $\mathbb C$. Under the…
We present a short elementary proof of the well-known criterion for a cubic polynomial to have three real roots. The proof is based on Fermat's approach to calculus for polynomials. This approach illustrates the idea of a derivative…
We give a simple algorithm that determines whether a given post-critically finite topological polynomial is Thurston equivalent to a polynomial. If it is, the algorithm produces the Hubbard tree; otherwise, the algorithm produces the…
Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…
In our previous work we have shown that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial P_B(q,v), henceforth referred to as the critical polynomial. This polynomial may be defined on any periodic…
A cubic polynomial $P$ with a non-repelling fixed point $b$ is said to be \emph{immediately renormalizable} if there exists a (connected) quadratic-like invariant filled Julia set $K^*$ such that $b\in K^*$. In that case exactly one…
In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the…
In the classic polyline simplification problem we want to replace a given polygonal curve $P$, consisting of $n$ vertices, by a subsequence $P'$ of $k$ vertices from $P$ such that the polygonal curves $P$ and $P'$ are as close as possible.…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
Voronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly…
The Voronoi conjecture on parallelohedra claims that for every convex polytope $P$ that tiles Euclidean $d$-dimensional space with translations there exists a $d$-dimensional lattice such that $P$ and the Voronoi polytope of this lattice…
B\o gvad and H\"agg proved that for a rational function with simple poles, the zeros of successive derivatives accumulate on the Voronoi diagram of the pole set, and the normalized zero-counting measures converge to a canonical probability…
We implement an iterative numerical method to solve polynomial equations $f(x)=0$ in the $p$-adic numbers, where $f(x) \in\mathbb{Z}_p[x]$. This method is a simplified $p$-adic analogue of Jarratt's method for finding roots of functions…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
We consider cubic polynomials f(z)=z^3+az+b defined over the function field C(L), with a marked point of period N and multiplier L. In the case N=1, there are infinitely many such objects, and in the case N>2, only finitely many. The case…
We describe a new algorithm for computing the Voronoi diagram of a set of $n$ points in constant-dimensional Euclidean space. The running time of our algorithm is $O(f \log n \log \Delta)$ where $f$ is the output complexity of the Voronoi…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
We consider the supercritical problem \[ -\Delta v=|v|^{p-2}v in \Theta_{\epsilon}, v=0 on \partial\Theta_{\epsilon}, \] where $\Theta$ is a bounded smooth domain in $\mathbb{R}^{N}$, $N\geq3$, $p>2^{\ast}:=2N/(N-2)$, and…
The number of periodic solutions to Painlev\'e VI along a Pochhammer loop is counted exactly. It is shown that the number grows exponentially with period, where the growth rate is determined explicitly. Principal ingredients of the…