Related papers: Revisiting the general cubic: A simplification of …
Previous research on quantum annealing methods focused on effectively modeling systems of linear equations by utilizing quadratic unconstrained binary optimization (QUBO) formulations. These studies take part in enhancing quantum computing…
We study the solubility of cubic equations over the integers. Assuming a necessary congruence condition, the existence of such solutions is established when the $h$-invariant of $C$ is at least $14$, improving on work of Davenport-Lewis and…
Based on Jensen formulae and the second kind of Chebyshev polynomials, another proof is presented for an extension of a curious binomial identity due to Z. W. Sun and K. J. Wu.
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
A new method for solving quartic equations due to Luo and Lin is investigated both computationally and theoretically. As a result, a completely straightforward elementary method is given for solving Bumby's equation $3X^4-2Y^2=1$, along…
In this paper we rederive an old upper bound on the number of halving edges present in the halving graph of an arbitrary set of $n$ points in 2-dimensions which are placed in general position. We provide a different analysis of an identity…
We study polygon equations and their connections to simplex equations, which generalize the pentagon and Yang--Baxter equations, respectively. First, we show that certain "commutative" pairs of solutions of (dual) polygon equations give…
Let $p(z)$ be a monic cubic complex polynomial with distinct roots and distinct critical points. We say a critical point has the {\it Voronoi property} if it lies in the Voronoi cell of a root $\theta$, $V(\theta)$, i.e. the set of points…
It is known that the solvability of a Sylvester equation over max-plus algebra can be determined in polynomial time by verifying its principal solution. A succinct representation of the principal solution is presented, with a more accurate…
In this work, we describe our experience in learning the use of a computer proof assistant - specifically, Lean - from scratch, through proving formulae for the solutions of polynomial equations. Specifically, in this work we characterize…
We derive a new Fibonacci identity. This single identity subsumes important known identities such as those of Catalan, Ruggles, Halton and others, as well as standard general identities found in the books by Vajda, Koshy and others. We also…
We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…
We review an exact WKB resolution method for the stationary 1D Schr\"odinger equation with a general polynomial potential. This contribution covers already published material: we supply a commented summary here, stressing a few aspects…
We consider a singular fractional differential equation involving generalized Katugampola derivative and obtain the existence and uniqueness of its solution. A scheme for uniformly approximating solution is constructed by using Picard…
Quantified constraints and Quantified Boolean Formulae are typically much more difficult to reason with than classical constraints, because quantifier alternation makes the usual notion of solution inappropriate. As a consequence, basic…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
Angular parts of certain solvable models are studied. We find that an extension of this class may be based on suitable trigonometric identities. The new exactly solvable Hamiltonians are shown to describe interesting two- and three-particle…
This paper presents the non-linear generalization of a previous work on matrix differential models. It focusses on the construction of approximate solutions of first-order matrix differential equations Y'(x)=f(x,Y(x)) using matrix-cubic…
The different forms of the tetrahedron equation appear when all possible ways to label the scattering process of infinitely long straight lines are considered in three dimensional spacetime. This is expected to lead to three dimensional…
We give an algebraic identity for cubic polynomials which generalizes Brahmagupta's identity and facilitates arithmetic in cubic fields. We also pose a question about a relationship between the elements of a cubic field of fixed trace and…