... | ... | @@ -37,7 +37,7 @@ where the `i<n>` are the site indices [1] and the `v<n>` are the values assigned |
|
|
site. The two sequences can be efficiently stored as arrays, as the shape is known (`(N,)` for the indices
|
|
|
and `(N, n_orbs, n_orbs)` for the values).
|
|
|
|
|
|
All of the sites which have a value given by a function `func` are stored like so:
|
|
|
All of the sites which have a value given by a *function* `func` are stored like so:
|
|
|
|
|
|
(fam, func, [i1, i2, i3, ..., iN])
|
|
|
|
... | ... | @@ -91,7 +91,19 @@ function `where` by: |
|
|
where: S → G
|
|
|
x ↦ g | x = g·y , y ∈ S'
|
|
|
|
|
|
We can now define the *connection set*, `C`, of a system as the set of symmetry group elements
|
|
|
where: T → G x G
|
|
|
(x,y) ↦ (g,h) | (x,y) = (g·u, h·v) , u,v ∈ S'
|
|
|
|
|
|
We can now define the *connection set*, `C`, of a system as the set of symmetry group elements:
|
|
|
|
|
|
C = ⋃ where(t)
|
|
|
t ∈ T'
|
|
|
|
|
|
and we define the *degree* of the system to be the cardinality of the connection set.
|
|
|
|
|
|
Let us look at a few examples to clarify this:
|
|
|
|
|
|
![graphene]()
|
|
|
|
|
|
|
|
|
|
... | ... | |