Paley-Type Matrices in Combinatorics

• Paley-Type Matrices are highly structured ±1 and complex matrices defined using quadratic residues in finite fields, exemplifying canonical Hadamard and conference matrices.
• They extend classical constructions to higher dimensions and cohomological frameworks, enabling advances in combinatorial design, coding theory, and compressed sensing.
• Recent developments leverage cyclotomic generalizations and graph-theoretic methods to address open problems in matrix construction and combinatorial factorizations.

Paley-type matrices are a family of highly structured ±1 and complex-valued matrices derived from the arithmetic of finite fields and quadratic residues. They play a central role in combinatorial design, coding theory, frame theory, algebraic graph theory, and compressed sensing. Their construction is intimately connected to the quadratic character over finite fields, and they serve as canonical examples of Hadamard matrices, equiangular tight frames, and conference matrices. Recent work extends the classical Paley construction to higher dimensions, cyclotomic generalizations, cohomological frameworks, and intricate interactions with graph factorization and expanded combinatorial configurations.

1. Classical Two-Dimensional Paley-Type Matrices

The foundational Paley construction begins with a finite field $F_q$ of odd order $q$ and its quadratic character $\chi: F_q \to \{\pm 1\}$, defined by $\chi(x) = 1$ if $x$ is a nonzero square in $F_q$, $-1$ otherwise, and $\chi(0)=0$. The projective line $\mathrm{PG}(1,q) = F_q \cup \{\infty\}$ serves as the index set for a $(q+1)\times (q+1)$ Paley-type matrix $q$0. When $q$1, the entries of $q$2 are given by:

• $q$3 if $q$4,
• $q$5 if $q$6, or if one of $q$7 is $q$8 and the other in $q$9,
• $\chi: F_q \to \{\pm 1\}$0 otherwise.

This matrix satisfies $\chi: F_q \to \{\pm 1\}$1, certifying it as a Hadamard matrix of order $\chi: F_q \to \{\pm 1\}$2 (Krčadinac et al., 2023). For $\chi: F_q \to \{\pm 1\}$3, variants with slightly adjusted signs (Paley type II) are used to restore the Hadamard property (Kumari et al., 2019). The combinatorial logic underlying these matrices is tightly woven with the arithmetic of quadratic residues and the symmetry group PSL$\chi: F_q \to \{\pm 1\}$4 acting on $\chi: F_q \to \{\pm 1\}$5.

2. Extensions: 3D Paley-Type Hadamard Matrices

Recent work generalizes the Paley construction to higher dimensions. Krčadinac, Pavčević, and Tabak introduced three-dimensional Hadamard matrices of Paley type defined on $\chi: F_q \to \{\pm 1\}$6 for $\chi: F_q \to \{\pm 1\}$7 and $\chi: F_q \to \{\pm 1\}$8 an odd prime power (Krčadinac et al., 2023). The 3D array $\chi: F_q \to \{\pm 1\}$9 is constructed as follows:

• $\chi(x) = 1$0 if $\chi(x) = 1$1,
• $\chi(x) = 1$2 if exactly two of $\chi(x) = 1$3 are equal or if any is $\chi(x) = 1$4 and the other two are distinct elements of $\chi(x) = 1$5,
• Otherwise, for $\chi(x) = 1$6 pairwise distinct,

$\chi(x) = 1$7

Orthogonality in each coordinate direction is verified using character sums and the 2-transitivity of PSL$\chi(x) = 1$8. When $\chi(x) = 1$9, every 2D slice of $x$0 recovers a classical (Paley I) 2D Hadamard matrix. This 3D construction solves previously open existence problems for multidimensional Hadamard arrays for infinitely many new orders (Krčadinac et al., 2023).

3. Cohomological and Group-Theoretic Framework

Paley-type matrices are encompassed within Goldberger and Dula’s theory of Cohomology-Developed Matrices (CDMs), which use group cohomology to organize and classify weighing and Hadamard matrices (Goldberger, 2019). The “Paley Conference” matrix arises as a 1-cocycle ($x$1) development over the affine group $x$2 acting on $x$3. The matrix construction enforces invariance under $x$4 and leverages the quadratic character as a 1-cocycle twist on the stabilizer subgroup. The unique (up to diagonal equivalence) cohomological recipe

$x$5

combined with appropriate completion, yields the Paley Hadamard matrices. Symmetries and orthogonality derive from 2-transitivity and group-averaging, while the cohomological framework provides a unifying lens for generalizations to exotic matrix classes and connections to automorphism lifting problems.

4. Combinatorics, Conference Matrices, and Generalizations

Kumari and Mahato developed extended Paley constructions, producing Hadamard matrices of order $x$6 or $x$7 for any odd prime power $x$8, not just those congruent to $x$9 or $F_q$0 (Kumari et al., 2019). These constructions deploy conference matrices $F_q$1 of order $F_q$2—with $F_q$3—and global block structures:

$F_q$4

where $F_q$5 and $F_q$6 are block matrices assembled by repeating rows or columns of a Hadamard seed matrix $F_q$7. In the most general case, the twin-prime construction employs difference set–based conference matrices. These block-matrix architectures expand the class of achievable Hadamard orders and produce matrices with distinct sign spectra from traditional Paley, Sylvester, or Williamson constructions.

5. Paley-Type Matrices in Compressed Sensing and Frame Theory

Paley matrices and their normalized forms ("Paley Equiangular Tight Frames" or Paley ETFs) constitute explicit constructions of equiangular tight frames (ETFs) with near-optimal coherence. Let $F_q$8 prime, and define $F_q$9 as a $-1$0 complex matrix with

$-1$1

for distinct $-1$2. The coherence achieves the Welch bound up to constants. A major open problem is whether Paley ETFs admit Restricted Isometry Property (RIP) at sparsity levels $-1$3 ("beating the square-root bottleneck"). Recent work demonstrates that if the Paley ETF satisfies RIP for $-1$4 and $-1$5, then novel explicit two-source extractors with min-entropy below $-1$6 for negligible error are obtained, solving key challenges in pseudorandomness and randomness extraction (Satake, 2024, Satake, 2020). The Paley graph conjecture predicts that Paley matrices are almost optimal deterministic RIP matrices, contingent on deep pseudorandomness properties of quadratic residues.

6. Algebraic Graph Theory and Factorizations

Paley-type matrices are deeply linked with the adjacency matrices of Paley graphs (strongly regular graphs with parameters governed by field arithmetic). Their Smith normal forms and Laplacian critical groups have been completely worked out in terms of eigenvalues and p-ary digit-carry combinatorics (Chandler et al., 2014). A recent advance (Yip et al., 18 Jan 2026) settled the problem of constructing 1-factorizations of the complete graph $-1$7 compatible with the sign pattern of Paley-type matrices for all odd primes $-1$8, connecting sign patterns to edge arithmetic via quadratic residues. This illuminates new bridges between Hadamard matrix theory and combinatorial factorizations, notably perfect matchings with arithmetic constraints derived from field algebra.

7. Cyclotomic and Group-Scheme Generalizations

Paley-type constructions extend beyond quadratic residues via cyclotomic class techniques and difference sets. Chen and Feng show that suitable unions of cyclotomic classes in the multiplicative group of finite fields, selected using Arasu–Dillon–Player difference sets, yield new Paley-type group schemes and corresponding Hadamard matrices (Chen et al., 2012). Explicit character-sum criteria, based on bounding $-1$9, guarantee the required orthogonality for the corresponding $\chi(0)=0$0-matrices. These generalizations produce large classes of non-equivalent matrices in moderate orders, substantially enriching the taxonomy of Paley-type combinatorial objects.

---

References:

(Krčadinac et al., 2023): "Three-dimensional Hadamard matrices of Paley type" (Goldberger, 2019): "Cohomology-Developed Matrices -- constructing families of weighing matrices and automorphism actions" (Satake, 2020): "On the restricted isometry property of the Paley matrix" (Satake, 2024): "On the Paley RIP and Paley graph extractor" (Kumari et al., 2019): "Extension of Paley Construction for Hadamard Matrix" (Chen et al., 2012): "Paley type group schemes from cyclotomic classes and Arasu-Dillon-Player difference sets" (Chandler et al., 2014): "The Smith and critical groups of Paley graphs" (Yip et al., 18 Jan 2026): "Paley-type matrices and $\chi(0)=0$1-factorizations of complete graphs"