qpms/trivialgroup.c

   1 #include "groups.h"
   2
   3 /// Trivial group, with one (reduntant) generator.
   4 /**
   5  * For the trivial group, zero generators are enough.
   6  * However, some functions might be not robust enough and require
   7  * a first generator to work properly.
   8  */
   9 const qpms_finite_group_t QPMS_FINITE_GROUP_TRIVIAL_G = {
  10   "trivial_g", // name
  11   1, // order
  12   0, // idi
  13   (qpms_gmi_t[]) { // mt
  14     0,
  15   },
  16   (qpms_gmi_t[]) { // invi
  17     0
  18   },
  19   (qpms_gmi_t[]) {0}, // gens
  20   1, // ngens
  21   (qpms_permutation_t[]){ // permrep
  22     "()",
  23   },
  24   NULL, // elemlabels
  25   0, // permrep_nelem
  26   (qpms_irot3_t[]) { // rep3d
  27    {{1.0+0.0*I, 0.0+0.0*I}, 1},
  28   },
  29   1, // nirreps
  30   (struct qpms_finite_group_irrep_t[]) { // irreps
  31     {
  32       1, // dim
  33       "A", //name
  34       (complex double []) {1} // m
  35     },
  36   } // end of irreps
  37 };
  38
  39 /// Trivial group.
  40 const qpms_finite_group_t QPMS_FINITE_GROUP_TRIVIAL = {
  41   "trivial", // name
  42   1, // order
  43   0, // idi
  44   (qpms_gmi_t[]) { // mt
  45     0,
  46   },
  47   (qpms_gmi_t[]) { // invi
  48     0
  49   },
  50   NULL, // gens
  51   0, // ngens
  52   (qpms_permutation_t[]){ // permrep
  53     "()",
  54   },
  55   NULL, // elemlabels
  56   0, // permrep_nelem
  57   (qpms_irot3_t[]) { // rep3d
  58    {{1.0+0.0*I, 0.0+0.0*I}, 1},
  59   },
  60   1, // nirreps
  61   (struct qpms_finite_group_irrep_t[]) { // irreps
  62     {
  63       1, // dim
  64       "A", //name
  65       (complex double []) {1} // m
  66     },
  67   } // end of irreps
  68 };
  69
  70