Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1609.04530

Experimental Constructions of Binary Matrices with Good Peak-Sidelobe Distances

Jerod Michel
View original source ↗Read source document ↗Export metadata ↓

Abstract

Skirlo et al., in 'Binary matrices of optimal autocorrelations as alignment marks' [Journal of Vacuum Science and Technology Series B 33(2) (2015) 1-7], defined a new class of binary matrices by maximizing the peak-sidelobe distances in the aperiodic autocorrelations and, by exhaustive computer searches, found the optimal square matrices of dimension up to 7 x 7, and optimal diagonally symmetric matrices of dimensions 8 x 8 and 9 x 9. We make an initial investigation into and propose a strategy for (deterministically) constructing binary matrices with good peak-sidelobe distances. We construct several classes of these and compare their distances to those of the optimal matrices found by Skirlo et al. Our constructions produce matrices that are near optimal for small dimension. Furthermore, we formulate a tight upper bound on the peak-sidelobe distance of a cer- tain class of circulant matrices. Interestingly, binary matrices corresponding to certain difference sets and almost difference sets have peak-sidelobe distances meeting this upper bound.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jerod Michel. 2016-09-15. Experimental Constructions of Binary Matrices with Good Peak-Sidelobe Distances. https://doi.org/10.1116/1.4967995

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗