#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub enum DynkinType {
A(usize),
D(usize),
E6,
E7,
E8,
}
impl DynkinType {
pub fn num_vertices(self) -> Option<usize> {
match self {
Self::A(n) => (n >= 1).then_some(n),
Self::D(n) => (n >= 4).then_some(n),
Self::E6 => Some(6),
Self::E7 => Some(7),
Self::E8 => Some(8),
}
}
pub fn indecomposable_count(self) -> Option<usize> {
match self {
Self::A(n) => (n >= 1)
.then(|| {
if n % 2 == 0 {
(n / 2).checked_mul(n.checked_add(1)?)
} else {
n.checked_mul(n / 2 + 1)
}
})
.flatten(),
Self::D(n) => (n >= 4).then(|| n.checked_mul(n - 1)).flatten(),
Self::E6 => Some(36),
Self::E7 => Some(63),
Self::E8 => Some(120),
}
}
}
display_error! { DynkinType {
Self::A(n) => "A_{n}";
Self::D(n) => "D_{n}";
Self::E6 => "E_6";
Self::E7 => "E_7";
Self::E8 => "E_8";
} }
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub enum EuclideanType {
A(usize),
D(usize),
E6,
E7,
E8,
}
impl EuclideanType {
pub fn num_vertices(self) -> Option<usize> {
match self {
Self::A(n) => (n >= 1).then(|| n.checked_add(1)).flatten(),
Self::D(n) => (n >= 4).then(|| n.checked_add(1)).flatten(),
Self::E6 => Some(7),
Self::E7 => Some(8),
Self::E8 => Some(9),
}
}
}
display_error! { EuclideanType {
Self::A(n) => "affine A_{n}";
Self::D(n) => "affine D_{n}";
Self::E6 => "affine E_6";
Self::E7 => "affine E_7";
Self::E8 => "affine E_8";
} }