Related papers: A Cubic Composite Test
A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…
An elementary approach is shown which derives the values of the Gauss sums over $\mathbb F_{p^r}$, $p$ odd, of a cubic character without using Davenport-Hasse's theorem. New links between Gauss sums over different field extensions are shown…
The Cube versus Cube test is a variant of the well-known Plane versus Plane test of Raz and Safra, in which to each $3$-dimensional affine subspace $C$ of $\mathbb{F}_q^n$, a polynomial of degree at most $d$, $T(C)$, is assigned in a…
The representation of any integer as the sum of two cubes to a fixed modulus is always possible if and only if the modulus is not divisible by seven or nine. For a positive non-prime integer N there is given an inductive way to find its…
The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…
The equivariant nonnegativity versus sums of squares question has been solved for any infinite series of essential reflection groups but type A. As a first step to a classification, we analyse $A_n$-invariant quartics. We prove that the…
The concept of positively and negatively compatible null vectors arises in the study of Clifford geometric algebras with a Lorentz-Minkowski metric. In previous works, the basic properties of such algebras have been set down in terms of a…
Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…
In this paper we confirm a conjecture of Sun which states that each positive integer is a sum of a square, an odd square and a triangular number. Given any positive integer m, we show that p=2m+1 is a prime congruent to 3 modulo 4 if and…
A construction of $p$-parameter Brownian sheet on the hypercube $C=[0,1]^p$ as a sum of $2^p$ independent Gaussian processes is obtained. The terms are closely related to Brownian pillows, and the probability laws of their $L^2(C)$ squared…
In this note, we use integral binary cubic forms to study the rational cube sum problem. We prove (unconditionally) that for any positive integer $d$, infinitely many primes in each of the residue classes $ 1 \pmod {9d}$ as well as $ -1…
The perfect cuboid problem is an old famous unsolved problem in mathematics concerning the existence or non-existence of a rectangular parallelepiped whose edges, face diagonals, and space diagonal are of integer lengths. Recently Walter…
A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…
The use of quadratic residues to construct matrices with specific determinant values is a familiar problem with connections to many areas of mathematics and statistics. Our research has focused on using cubic residues to construct matrices…
We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.
Quadratic permutation polynomials (QPPs) have been widely studied and used as interleavers in turbo codes. However, less attention has been given to cubic permutation polynomials (CPPs). This paper proves a theorem which states sufficient…
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
A perfect cuboid, popularly known as a perfect Euler brick/a perfect box, is a cuboid having integer side lengths, integer face diagonals and an integer space diagonal. Euler provided an example where only the body diagonal became deficient…
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.