Search arXivSearch

arXiv · 2408.07112

A generalization of the hexastix arrangement to higher dimensions

Abstract

Hexastix is an arrangement of non-overlapping infinite hexagonal prisms in four different directions that cover $\frac{3}{4}$ of space. We consider a possible generalization to $n$ dimensions, based on the permutohedral lattice $A^*_n$. The central lines of the generalized prisms are going to be oriented in $n+1$ different directions (parallel to the shortest non-zero vectors of $A^*_n$). The projection of the lines oriented in any direction along that direction to a hyperplane perpendicular to it is required to be a translation of the corresponding projection of $A^*_n$, and the minimal distance between lines oriented in any two given directions should be maximal. It is shown that this is possible if $n$ is a prime power. Also, the proportion of $n$-space that is covered is calculated for $n \in \{4, 5\}$, and an alternative generalization is briefly considered.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Kristian Haugland. 2024-08-13. A generalization of the hexastix arrangement to higher dimensions. https://arxiv.org/abs/2408.07112

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