2
$\begingroup$

Given some $d$ dimensional torus, (i.e. just a $d$-dimensional hypercube with periodic boundary conditions) I'll call $\Omega$, and a group of transformations $G$ of $\Omega$, I want to find the smallest sub-region in the hyper-torus such that the rest of the torus can be generated by the action of the group elements of $G$.

That is, I want to find the smallest $\tilde{\Omega}$ such that

\begin{equation} \Omega = \bigcup_{g \in G} g (\tilde{\Omega}) \end{equation}

Condensed matter physicists approach this problem quite often in finding an irreducible Brillouin zone, but I cannot find any general procedure for solving this problem that doesn't involve just guessing the solution.

Does anyone have suggestions for how to go about doing this, or references they can point me to?


There is a related and unanswered question here: https://math.stackexchange.com/questions/1284436/algebraic-determination-of-asymmetric-unit-aka-irreducible-wedge-in-brillouin

$\endgroup$
2
  • $\begingroup$ Are you familiar with Voronoi tilings? $\endgroup$ Commented Jul 18, 2020 at 2:24
  • $\begingroup$ After reading the Wikipedia page, yes I think so. $\endgroup$
    – Mason
    Commented Jul 18, 2020 at 15:15

1 Answer 1

2
$\begingroup$

I assume that $G$ acts isometrically on the flat torus $T^n$. Then the standard construction of $\tilde\Omega$ proceeds as follows. Pick a point $x\in T^n$ not fixed by any $g\in G$ and consider its $G$-orbit $Gx= \{gx: g\in G\}$. Take the Voronoi tiling of $T^n$ corresponding to this subset, let $D_x$ be the tile "centered" at $x$: $$ D_x=\{y\in T^n: \forall G \setminus \{1\}, d(x,y)\le d(gx,y)\}. $$ (Here $d$ is the distance function on the torus corresponding to the flat Riemannian metric.) This will be your $\tilde\Omega$. Indeed, since $gD_x= D_{gx}$, $G$ will permute simply-transitively the tiles $D_{gx}, g\in G$.

It is a nice exercise to prove that if $E\subset D_g$ is a subset whose closure is not the entire $D_x$, then $GE\ne T^n$, where $$ GE= \bigcup_{g\in G} gE. $$

$\endgroup$
6
  • $\begingroup$ That is a beautiful technique, thank you! If you're interested, I put a bounty on essentially the same question on Math Stack Exchange: math.stackexchange.com/questions/1284436/…. If you also submit your answer there, you should be able to claim the bounty. $\endgroup$
    – Mason
    Commented Jul 20, 2020 at 3:21
  • $\begingroup$ Is there a generalization of this which doesn't assume that $G$ acts isometrically? $\endgroup$
    – Mason
    Commented Jul 30, 2020 at 3:16
  • $\begingroup$ @Mason: Yes, but you need some assumptions on the action of $G$: $G$ is finite and acts simplicially (preserves some triangulation). See math.stackexchange.com/questions/3047013/… $\endgroup$ Commented Jul 31, 2020 at 22:41
  • $\begingroup$ I've been trying to understand your link but I think I'm still confused. Are you saying that if G is finite and acts simplicially, then the Voronoi technique above is still valid? Or are you saying that your link shows a more general method different from Voronoi? $\endgroup$
    – Mason
    Commented Aug 7, 2020 at 23:38
  • $\begingroup$ Also, do you have any guidance on how I can tell if a given group will act simplicially? $\endgroup$
    – Mason
    Commented Aug 7, 2020 at 23:39

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .