Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0605175

Few-cosine spherical codes and Barnes-Wall lattices

Robert L. Griess, Jr
View original source ↗Read source document ↗Export metadata ↓

Abstract

Using Barnes-Wall lattices and 1-cocycles on finite groups of monomial matrices, we give a procedure to construct tricosine spherical codes. This was inspired by a 14-dimensional code which Ballinger, Cohn, Giansiracusa and Morris discovered in studies of the universally optimal property. It has 64 vectors and cosines $-3/7, -1/7, 1/7$. We construct the {\it Optimism Code}, a 4-cosine spherical code with 256 unit vectors in 16-dimensions. The cosines are $0, 1/4, -1/4, -1$. Its automorphism group has shape $2^{1+8}{\cdot}GL(4,2)$. The Optimism Code contains a subcode related to the BCGM code. The Optimism Code implies existence of a nonlinear binary code with parameters $(16,256,6)$, a Nordstrom-Robinson code, and gives a context for determining its automorphism group, which has form $2^4{:}Alt_7$.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert L. Griess, Jr. 2006-05-07. Few-cosine spherical codes and Barnes-Wall lattices. https://arxiv.org/abs/math/0605175

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗