Related papers: Solving Cubic Equations By the Quadratic Formula

We prove a Voronoi formula for coefficients of a large class of $L$-functions including Maass cusp forms, Rankin-Selberg convolutions, and certain isobaric sums. Our proof is based on the functional equations of $L$-functions twisted by…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

We show under the assumption that the Tate-Shafarevich group of any elliptic curve over the rational numbers is finite that the cubic surface $x_1^3 + p_1p_2x_2^3 + p_2p_3x_3^3 + p_3p_1x_4^3 = 0$ has a rational point, where $p_1, p_2$ and…

A polynomial $p\in \mathbb{C}[z]$ with three finite values is called the Zolotarev polynomial. For a class of such polynomials with the given degree, given passport and simple critical points we define a \emph{combinatorial moduli space}. A…

Let $p$ be a normalized (monic and centered) quartic polynomial with non-trivial symmetry groups. It is already known that if $p$ is unicritical, with only two distinct roots with the same multiplicity or having a root at the origin then…

In this paper, we apply our minimax theory ([4], [5], [6]) with the one developed by A. Moameni in [2] to formalize a general scheme giving the multiplicity of critical points. Here is a sample of application of the scheme to a critical…

Let $\mathbb{H}$ be a field with $\mathbb{Q}\subset\mathbb{H}\subset\mathbb{C}$, and let $p(\lambda)$ be a polynomial in $\mathbb{H}[\lambda]$, and let $A\in\mathbb{H}^{n\times n}$ be nonderogatory. In this paper we consider the problem of…

A Voronoi diagram partitions the plane into convex cells, each containing the points closest to a single generator. Given such a tessellation, the inverse Voronoi problem seeks the generator set \( S \) that produced it. Our algorithm…

This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxations. Under some genericity assumptions on defining…

We propose a combinatorial method for computing explicit solutions to multi-parametric quadratic programs, which can be used to compute explicit control laws for linear model predictive control. In contrast to classical methods, which are…

Let g be a cubic polynomial with integer coefficients and n>9 variables, and assume that the congruence g=0 modulo p^k is soluble for all prime powers p^k. We show that the equation g=0 has infinitely many integer solutions when the cubic…

We give a new algorithmic solution to the well-known five-point relative pose problem. Our approach does not deal with the famous cubic constraint on an essential matrix. Instead, we use the Cayley representation of rotations in order to…

In this paper, the Hermite problem has been approached finding a periodic representation (by means of periodic rational or integer sequences) for any cubic irrationality. In other words, the problem of writing cubic irrationals as a…

We consider the following nonlinear elliptic system of Hamiltonian type with critical exponents: \begin{equation*} \begin{cases} -\Delta u + V(|y'|,y'')\, u = |v|^{p-1}v, & \text{in } \mathbb{R}^N,\newline -\Delta v + V(|y'|,y'')\, v =…

Let $k,p\in \mathbb{N}$ with $p$ prime and let $f\in\mathbb{Z}[x_1,x_2]$ be a bivariate polynomial with degree $d$ and all coefficients of absolute value at most $p^k$. Suppose also that $f$ is variable separated, i.e., $f=g_1+g_2$ for…

Let $Q_{p,q}(t)\in\mathbb{Z}[t]$ be Sharipov's even monic degree-$10$ second cuboid polynomial depending on coprime integers $p\neq q>0$. Writing $Q_{p,q}(t)$ as a quintic in $t^{2}$ produces an associated monic quintic polynomial. After…

We consider the distance minimization problem to a real algebraic variety $X \subseteq \RR^n$ when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the…

We show that computing even very coarse approximations of critical points is intractable for simple classes of nonconvex functions. More concretely, we prove that if there exists a polynomial-time algorithm that takes as input a polynomial…

In this paper we show that the number of radial positive solutions of the following critical problem $$ \Delta_p u(x) + \lambda K(|x|) \,u(x) \, |u(x)|^{q-2} =0\,,$$ $$ u(x)>0 \quad |x|<1,$$ $$ u(x)=0 \quad |x|=1,$$ where $q=…

A polynomial homotopy is a family of polynomial systems, where the systems in the family depend on one parameter. If for one value of the parameter we know a regular solution, then what is the nearest value of the parameter for which the…