Related papers: The Quartic Residues Latin Square

In our paper, we apply additive-combinatorial methods to study the distribution of the set of squares $\mathcal{R}$ in the prime field. We obtain the best upper bound on the number of gaps in $\mathcal{R}$ at the moment and generalize this…

In this note, we study large deviations of the number $\mathbf{N}$ of intercalates ($2\times2$ combinatorial subsquares which are themselves Latin squares) in a random $n\times n$ Latin square. In particular, for constant $\delta>0$ we…

When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.

We give a short proof that the quartic polynomial $f(z)=\frac 1 6 z^{4} + \frac 2 3 z^{3} + \frac 7 6 z^{2} + z$ is univalent.

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced…

An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…

We determine explicit formulas for the number of representations of a positive integer $n$ by quaternary quadratic forms with coefficients $1$, $2$, $5$ or $10$. We use a modular forms approach.

Latin squares are interesting combinatorial objects with many applications. When working with Latin squares, one is sometimes led to deal with partial Latin squares, a generalization of Latin squares. One of the problems regarding partial…

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

For odd primes $p$ we consider the factors \[ A(p)=\frac{p-\chi_4(p)}{p+\chi_4(p)}, \qquad \chi_4(p)= \begin{cases} 1,&p\equiv 1\pmod 4, \\ -1,&p\equiv 3\pmod 4, \end{cases} \] and study products of $A(p)$ restricted to unions of residue…

We obtain transformation formulas for quadratic character sums with quartic and cubic polynomial arguments.

We use a representability theorem of G. L. Watson to examine sums of squares in Quaternion rings with integer coefficients. This allows us to determine a large family of such rings where every element expressible as the sum of squares can…

Well-known results of Lagrange and Jacobi prove that the every $m \in \mathbb N$ can be expressed as a sum of four integer squares, and the number $r(m)$ of such representations can be given by an explicit formula in $m$. In this paper, we…

For fixed $q\in\{3,7,11,19, 43,67,163\}$, we consider the density of primes $p$ congruent to $1$ modulo $4$ such that the class group of the number field $\mathbb{Q}(\sqrt{-qp})$ has order divisible by $16$. We show that this density is…

In 1888, Hilbert proved that every non-negative quartic form f=f(x,y,z) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up…

We study the three term recurrence modulo m. In particular, we prove that Pell numbers modulo m is residue complete if and only m is 2, a power of 3, or a power of 5. Pell-Lucas numbers modulo m is residue complete if and only if m is a…

We study the asymptotics of the average number of squares (or quadratic residues) in Z_n and Z_n^*. Similar analyses are performed for cubes, square roots of 0 and 1, and cube roots of 0 and 1.