Related papers: Quaternary Legendre Pairs

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

Given an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$,…

In this short note we construct a spectral, non-tiling set of size $2p$ in $(\mathbb{Z}/p\mathbb{Z})^4$, $p$ odd prime. This example complements a previous counterexample in [arXiv:1509.01090], which existed only for $p \equiv 3 \pmod{4}$.…

A $Z_2Z_4$-linear Hadamard code of length $\alpha+2\beta=2^t$ is a binary Hadamard code which is the Gray map image of a $Z_2Z_4$-additive code with $\alpha$ binary coordinates and $\beta$ quaternary coordinates. It is known that there are…

We give a complete classification of binary linear complementary dual codes of lengths up to $13$ and ternary linear complementary dual codes of lengths up to $10$.

First examples of symmetric Hadamard matrices of orders 508 and 764 are constructed. The method used is known as the propus construction. A conjecture regarding this method is formally proposed but it appears implicitly in three previous…

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F_4 + uF_4 as well as F_4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension…

Permutation decoding is a technique which involves finding a subset $S$, called PD-set, of the permutation automorphism group of a code $C$ in order to assist in decoding. An explicit construction of $\left \lfloor{\frac{2^m-m-1}{1+m}}…

In this paper some combinatorial and homological tools are used to describe and give an explicit formula for the number of exceptional pairs (exceptional sequences of length two) for some classes of Nakayama Algebras and for the Auslander…

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

The Legendre-Stirling numbers of the second kind were introduced by Everitt et al. in the spectral theory of powers of the Legendre differential expressions. In this paper, we provide a combinatorial code for Legendre-Stirling set…

Apart from the ordinary and the periodic Golay pairs, we define also the negaperiodic Golay pairs. (They occurred first, under a different name, in a paper of Ito.) If a Hadamard matrix is also a Toeplitz matrix, we show that it must be…

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…

In this work, we apply the idea of composite matrices arising from group rings to derive a number of different techniques for constructing self-dual codes over finite commutative Frobenius rings. By applying these techniques over different…

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…

In the present paper, we give Assmus--Mattson type theorems for codes and lattices. We show that a binary doubly even self-dual code of length 24m with minimum weight 4m provides a combinatorial 1-design and an even unimodular lattice of…

Recently, Kulo\u{g}lu {\it et al.} \cite{Kul} introduced the higher order Horadam numbers. In this study, novel 3-parameter generalized quaternion sequences of higher order Horadam numbers, which have not been studied before, are defined by…

Exceptional orthogonal polynomials are families of orthogonal polynomials that arise as solutions of Sturm-Liouville eigenvalue problems. They generalize the classical families of Hermite, Laguerre, and Jacobi polynomials by allowing for…