Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0608039

On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups

Pilar Sabariego·Francisco Santos
View original source ↗Read source document ↗Export metadata ↓

Abstract

We are interested in the maximum possible number of facets that Dirichlet stereohedra for three-dimensional crystallographic groups can have. The problem for non-cubic groups was studied in previous papers by D. Bochis and the second author (Discrete Comput. Geom. 25:3 (2001), 419-444, and Beitr. Algebra Geom., 47:1 (2006), 89-120). This paper deals with ''full'' cubic groups, while ''quarter'' cubic groups are left for a subsequent paper. Here, ''full'' and ''quarter'' refers to the recent classification of three-dimensional crystallographic groups by Conway, Delgado-Friedrichs, Huson and Thurston (math.MG/9911185, Beitr. Algebra Geom. 42.2 (2001), 475-507). Our main result in this paper is that Dirichlet stereohedra for any of the 27 full groups cannot have more than 25 facets. We also find stereohedra with 17 facets for one of these groups.

Explore related subjects

math.COmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pilar Sabariego, Francisco Santos. 2008-01-11. On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups. https://doi.org/10.1007/s00454-008-9063-0

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↗