Related papers: Legendre pairs of lengths $\ell \equiv 0$ (mod $3$…

By assuming a type of balance for length $\ell=87$ and non-trivial subgroups of multiplier groups of Legendre pairs (LPs) for length $\ell=85$, we find LPs of these lengths. We then study the power spectral density (PSD) values of…

There are 20 odd integers v less than 200 for which the existence of Legendre pairs of length v is undecided. The smallest among them is v=77. We have constructed Legendre pairs of lengths 91, 93 and 123 reducing the number of undecided…

We introduce quaternary Legendre pairs of length $\ell$. In contrast to binary Legendre pairs they can exist for even $\ell$ as well. First we show that they are pertinent to the construction of quaternary Hadamard matrices of order…

We provide a search method for Legendre pairs of composite length based on generating binary matrices with fixed row and column sums from compressed, complementary integer vectors. This approach yielded the first construction of a Legendre…

Quaternary Legendre pairs are pertinent to the construction of quaternary Hadamard matrices and have many applications, for example in coding theory and communications. In contrast to binary Legendre pairs, quaternary ones can exist for…

We give the first general constructions of even length quaternary Legendre pairs: there is a quaternary Legendre pair of length $(q-1)/2$ for every prime power $q$ congruent to $1$ modulo $4$, and there is a quaternary Legendre pair of…

We investigate how Legendre $G$-array pairs are related to several different perfect binary $G$-array families. In particular we study the relations between Legendre $G$-array pairs, Sidelnikov-Lempel-Cohn-Eastman $\mathbb{Z}_{q-1}$-arrays,…

In this paper we propose a general strategy for rapidly computing sparse Legendre expansions. The resulting methods yield a new class of fast algorithms capable of approximating a given function $f:[-1,1] \rightarrow \mathbb{R}$ with a…

Fix an algebraically closed field $\mathbb{F}$ and an integer $n \geq 1$. Let $\text{Mat}_n(\mathbb{F})$ denote the $\mathbb{F}$-algebra consisting of the $n \times n$ matrices that have all entries in $\mathbb{F}$. We consider a pair of…

Let (A,B) and (C,D) denote Leonard pairs on V. We say these pairs are adjacent whenever each basis for V which is standard for (A,B) (resp. (C,D)) is split for (C,D) (resp. (A,B)). Our main results are as follows: Theorem 1. There exists at…

Fix an algebraically closed field $\mathbb{F}$ and an integer $d \geq 3$. Let $V$ be a vector space over $\mathbb{F}$ with dimension $d+1$. A Leonard pair on $V$ is an ordered pair of diagonalizable linear transformations $A: V \to V$ and…

Given the Fourier-Legendre expansions of $f$ and $g$, and mild conditions on $f$ and $g$, we derive the Fourier-Legendre expansion of their product in terms of their corresponding Fourier-Legendre coefficients. In this way, expansions of…

Fix an algebraically closed field $\mathbb{F}$ and an integer $d \geq 3$. Let $\text{Mat}_{d+1}(\mathbb{F})$ denote the $\mathbb{F}$-algebra consisting of the $(d+1) \times (d+1)$ matrices that have all entries in $\mathbb{F}$. We consider…

In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)^A$ can take large values.

Let $p$ be a prime number and $\left(\frac{\cdot}{p}\right)$ be the Legendre symbol modulo $p$. The \emph{Legendre path} attached to $p$ is the polygonal path whose vertices are the normalized character sums $\frac{1}{\sqrt{p}} \sum_{n\leq…

The number of 123-avoiding permutation on $\{1,2,\ldots,n\}$ with a fixed leading terms is counted by the ballot numbers. The same holds for $132$-avoiding permutations. These results were proved by Miner and Pak using the…

The primary objective of this section is to demonstrate that the actual pseudorandom measures of our construction are significantly smaller than the theoretical upper bounds derived from the Weil theorem. Regarding the family of sequences,…

If the list of binary numbers is read by upward-sloping diagonals, the resulting ``sloping binary numbers'' 0, 11, 110, 101, 100, 1111, 1010, ... (or 0, 3, 6, 5, 4, 15, 10, ...) have some surprising properties. We give formulae for the n-th…

Fix an algebraically closed field $\F$ and an integer $d \geq 3$. Let $V$ be a vector space over $\F$ with dimension $d+1$. A Leonard pair on $V$ is a pair of diagonalizable linear transformations $A: V \to V$ and $A^* : V \to V$, each…

Let $ (P_n)_{n\ge 0}$ be the sequence of Perrin numbers defined by ternary relation $ P_0=3 $, $ P_1=0 $, $ P_2=2 $, and $ P_{n+3}=P_{n+1}+P_n $ for all $ n\ge 0 $. In this paper, we use Baker's theory for nonzero linear forms in logarithms…