Struct CoreReduction 

pub struct CoreReduction { /* private fields */ }

Replayable evidence that beat-point deletions reach a canonical core.

Implementations

impl CoreReduction

pub fn reduced(&self) -> &Poset

The terminal core before its final canonical relabeling.

pub fn core(&self) -> &Poset

The canonical representative of the terminal core.

pub fn deletions(&self) -> &[BeatPoint]

Beat-point deletions, in replay order and in original vertex ids.

pub fn retained_vertices(&self) -> &[VertexId]

Map from reduced-poset ids to retained original vertex ids.

pub fn canonical_labeling(&self) -> &Permutation

Final permutation from reduced-poset ids to canonical-core ids.

pub fn graded_homology_invariants( &self, ) -> Result<Vec<FinitelyGeneratedAbelianGroup>, PosetError>

Compute lean integral homology from the canonical core.

Beat-point deletion preserves the homotopy type of the order complex, so these groups are also the integral homology of the source poset. The returned vector is indexed by homological degree.

pub fn verify(&self, original: &Poset) -> bool

Replay every deletion and verify the stored reduced and canonical cores.

Trait Implementations

impl Clone for CoreReduction

fn clone(&self) -> CoreReduction

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CoreReduction

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.