Search arXivSearch

arXiv · 2406.04023

Orbits of the hyperoctahedral group as Euclidean designs

Abstract

The hyperoctahedral group $H$ in $n$ dimensions (the Weyl group of Lie type $B_n$) is the subgroup of the orthogonal group generated by all transpositions of coordinates and reflections with respect to coordinate hyperplanes. A finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ is called a Euclidean $t$-design, if $$\sum_{r \in R} W_r \overline{f}_{S_{r}} = \sum_{{\bf x} \in {\cal X}} w({\bf x}) f({\bf x})$$ holds for every polynomial $f$ of total degree at most $t$; here $R$ is the set of norms of the points in ${\cal X}$, $W_r$ is the total weight of all elements of ${\cal X}$ with norm $r$, $S_r$ is the $n$-dimensional sphere of radius $r$ centered at the origin, and $\overline{f}_{S_{r}}$ is the average of $f$ over $S_{r}$. Here we consider Euclidean designs which are supported by orbits of the hyperoctahedral group. Namely, we prove that any Euclidean design on a union of generalized hyperoctahedra has strength (maximum $t$ for which it is a Euclidean design) equal to 3, 5, or 7. We find explicit necessary and sufficient conditions for when this strength is 5 and for when it is 7. In order to establish our classification, we translate the above definition of Euclidean designs to a single equation for $t=5$, a set of three equations for $t=7$, and a set of seven equations for $t=9$. Neumaier and Seidel (1988), as well as Delsarte and Seidel (1989), proved a Fisher-type inequality $|{\cal X}| \geq N(n,p,t)$ for the minimum size of a Euclidean $t$-design in $\mathbb{R}^n$ on $p=|R|$ concentric spheres (assuming that the design is antipodal if $t$ is odd). A Euclidean design with exactly $N(n,p,t)$ points is called tight. We exhibit new examples of antipodal tight Euclidean designs, supported by orbits of the hyperoctahedral group, for $N(n,p,t)=$(3,2,5), (3,3,7), and (4,2,7).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bela Bajnok. 2024-06-06. Orbits of the hyperoctahedral group as Euclidean designs. https://arxiv.org/abs/2406.04023

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO