netket.utils.group.PermutationGroup#
- class netket.utils.group.PermutationGroup[source]#
Bases:
FiniteGroup
Collection of permutation operations acting on sequences of length
degree
.Group elements need not all be of type
netket.utils.group.Permutation
, only act as such on a sequence when called.The class can contain elements that are distinct as objects (e.g.,
Identity()
andTranslation((0,))
) but have identical action. Those can be removed by callingremove_duplicates()
.- Inheritance
- Attributes
- character_table_by_class#
Calculates the character table using Burnside’s algorithm.
Each row of the output lists the characters of one irrep in the order the conjugacy classes are listed in self.conjugacy_classes.
Assumes that
Identity() == self[0]
, if not, the sign of some characters may be flipped. The irreps are sorted by dimension.
- conjugacy_classes#
The conjugacy classes of the group.
- Returns:
The three arrays
classes: a boolean array, each row indicating the elements that belong to one conjugacy class
representatives: the lowest-indexed member of each conjugacy class
inverse: the conjugacy class index of every group element
- conjugacy_table#
The conjugacy table of this Permutation Group.
Assuming the definitions
g = self[idx_g] h = self[idx_h]
self[self.conjugacy_table[idx_g,idx_h]]
corresponds to \(h^{-1}gh\).
- inverse#
- product_table#
- shape#
Tuple
(<# of group elements>, <degree>)
.Equivalent to
self.to_array().shape
.
- Methods
- __call__(initial)#
Apply all group elements to all entries of initial along the last axis.
- character_table()#
Calculates the character table using Burnside’s algorithm.
Each row of the output lists the characters of all group elements for one irrep, i.e.
self.character_table()[i,g]
gives \(\chi_i(g)\).Assumes that
Identity() == self[0]
, if not, the sign of some characters may be flipped. The irreps are sorted by dimension.
- character_table_readable()#
Returns a conventional rendering of the character table.
- irrep_matrices()#
Returns matrices that realise all irreps of the group.
- remove_duplicates(*, return_inverse=False)[source]#
Returns a new
PermutationGroup
with duplicate elements (that is, elements which represent identical permutations) removed.- Parameters:
return_inverse – If True, also return indices to reconstruct the original group from the result.
- Return type:
- Returns:
The permutation group with duplicate elements removed. If
return_inverse==True
, it also returns the indices needed to reconstruct the original group from the result.
- replace(**updates)#
Returns a new object replacing the specified fields with new values.
- to_array()[source]#
Convert the abstract group operations to an array of permutation indices.
It returns a matrix where the i-th row contains the indices corresponding to the i-th group element. That is,
self.to_array()[i, j]
is \(g_i^{-1}(j)\). Moreover,G = # this permutation group... V = np.arange(G.degree) assert np.all(G(V) == V[..., G.to_array()])