Related papers: Solving Cubic Equations By the Quadratic Formula

We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…

A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…

Let V be a plane smooth cubic curve over a finitely generated field k. The Mordell-Weil theorem for V states that there is a finite subset P \subset V(k) such that the whole V(k) can be obtained from P by drawing secants and tangents…

Answering a question of Zureick-Brown, we determine the cubic points on the modular curves $X_0(N)$ for $N \in \{53,57,61,65,67,73\}$ as well as the quartic points on $X_0(65)$. To do so, we develop a "partially relative" symmetric Chabauty…

We consider the family of cubic polynomials with a simple parabolic fixed point. We prove that the boundary of the immediate basin of attraction of the parabolic point is a Jordan curve and give a description of the dynamics.

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

Let $X$ be a quotient of the modular curve $X_0(N)$ whose Jacobian $J_X$ is a simple factor of $J_0(N)^{new}$ over $\mathbb{Q}$. Let $f$ be the newform of level $N$ and weight 2 associated with $J_X$; assume $f$ has analytic rank 1. We give…

In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used…

We consider the problem of optimizing a multivariate quadratic function where each decision variable is constrained to be a complex $m$'th root of unity. Such problems have applications in signal processing, MIMO detection, and the…

The conditions for cubic equations, to have 3 real roots and 2 of the roots lie in the closed interval $[-1, 1]$ are given. These conditions are visualized. This question arises in physics in e.g. the theory of tops.

We are concerned with the study of the existence and multiplicity of solutions for Dirichlet boundary value problems, involving the $( p( m ), \, q( m ) )-$ equation and the nonlinearity is superlinear but does not fulfil the…

Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…

We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…

This study proposes a cubic regularization of the Newton method for generating weakly efficient points of unconstrained vector optimization problems under no convexity assumption on the objective function. It is observed that at a given…

In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

A new technique is presented to solve a class of linear boundary value problems (BVP). Technique is primarily based on an operational matrix developed from a set of modified Bernoulli polynomials. The new set of polynomials is an…

In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials. First, following Han [2012] we develop a method to study…

We study the existence of solutions to the cubic Schr\"odinger system $$ -\Delta u_i = \sum_{j =1}^m \beta_{ij} u_j^2u_i + \lambda_i u_i\ \hbox{in}\ \Omega,\ u_i=0\ \hbox{on}\ \partial\Omega,\ i =1,\dots,m, $$ when $\Omega$ is a bounded…

There are thousands of papers on rootfinding for nonlinear scalar equations. Here is one more, to talk about an apparently new method, which I call ``Inverse Cubic Iteration'' (ICI) in analogy to the Inverse Quadratic Iteration in Richard…