Related papers: A Note on Quartic Equations with only Trivial Solu…
Integer solutions of the diophantine equation $A^4+hB^4=C^4+hD^4$ are known for all positive integer values of $h < 1000$. While a solution of the aforementioned diophantine equation for any arbitrary positive integer value of $h$ is not…
In the paper there are described minimal nontrivial solutions of the isometry equation. This equation naturally appears in the coding theory in the study of additive code isometries. The minimal nontrivial solutions correspond to the case…
Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…
Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)^3+x^3+(x+1)^3=z^2$ in integers $x$, $z$. The generalization $(x-1)^k+x^k+(x+1)^k=z^n$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng…
We prove the existence of a family of non-trivial solutions of the Liouville equation in dimensions two and four with infinite volume. These solutions are perturbations of a finite-volume solution of the same equation in one dimension less.…
Based on the theory of invariant sets of descending flow, we give a new proof of the existence of three nontrivial solutions and some remarks on it.
There are thirteen types of singular points for irreducible real quartic curves and seventeen types of singular points for reducible real quartic curves. This classification is originally due to D.A. Gudkov. There are nine types of singular…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences. Based…
A sharp condition is provided to guarantee that the (nontrivial) solutions of a DDE of the form $\dot{x}(t)+F(t,x)=0$ $t\geq 0,$ (where $F(t,\cdot)$ is an odd-like causal operator) either oscillate, or converge monotonically to zero. The…
The real roots of the cubic and quartic polynomials are studied geometrically with the help of their respective Siebeck--Marden--Northshield equilateral triangle and regular tetrahedron. The Vi\`ete trigonometric formulae for the roots of…
We obtain a pair of nontrivial solutions for a class of concave-linear-convex type elliptic problems that are either critical or subcritical. The solutions we find are neither local minimizers nor of mountain pass type in general. They are…
We introduce a direct numerical treatment of nonlinear higher-index differential-algebraic equations by means of overdetermined polynomial least-squares collocation. The procedure is not much more computationally expensive than standard…
The convergence of an adaptive mixed finite element method for general second order linear elliptic problems defined on simply connected bounded polygonal domains is analyzed in this paper. The main difficulties in the analysis are posed by…
We prove a Poisson summation formula for the zero locus of a quadratic form in an even number of variables with no assumption on the support of the functions involved. The key novelty in the formula is that all ``boundary terms'' are given…
In dimension $N\geq 5$, and for $0<s<4$ with $\gamma\in\mathbb{R}$, we study the existence of nontrivial weak solutions for the doubly critical problem $$\Delta^2 u-\frac{\gamma}{|x|^4}u=…
We show that the degree of the Alexander polynomial of an irreducible plane algebraic curve with nodes and cusps as the only singularities does not exceed ${5 \over 3}d-2$ where $d$ is the degree of the curve. We also show that the…
Finding roots of equations is at the heart of most computational science. A well-known and widely used iterative algorithm is the Newton's method. However, its convergence depends heavily on the initial guess, with poor choices often…
In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…
In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…