Search arXivSearch

arXiv · 2307.07900

Fragmenting any Parallelepiped into a Signed Tiling

Abstract

It is broadly known that any parallelepiped tiles space by translating copies of itself along its edges. In earlier work relating to higher-dimensional sandpile groups, the second author discovered a novel construction which fragments the parallelpiped into a collection of smaller tiles. These tiles fill space with the same symmetry as the larger parallelepiped. Their volumes are equal to the components of the multi-row Laplace determinant expansion, so this construction only works when all these signs are non-negative (or non-positive). In this work, we extend the construction to work for all parallelepipeds, without requiring the non-negative condition. This naturally gives tiles with negative volume, which we understand to mean canceling out tiles with positive volume. In fact, with this cancellation, we prove that every point in space is contained in exactly one more tile with positive volume than tile with negative volume. This is a natural definition for a signed tiling. Our main technique is to show that the net number of signed tiles doesn't change as a point moves through space. This is a relatively indirect proof method, and the underlying structure of these tilings remains mysterious.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joseph Doolittle, Alex McDonough. 2024-06-05. Fragmenting any Parallelepiped into a Signed Tiling. https://doi.org/10.1007/s00454-024-00664-8

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

KEEP EXPLORING

Related papers

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

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