Computing the Dimension of a Bipartition Matrix

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Freeman, Dawson, Umble, Ronald
Format: Preprint
Publié: 2021
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909456571301888
author Freeman, Dawson
Umble, Ronald
author_facet Freeman, Dawson
Umble, Ronald
contents The dimension of a bipartition matrix (BPM) is the sum of the dimensions of its indecomposable factors. The dimension of an indecomposable BPM is the sum of its row, column, and entry dimensions. To compute these dimensions, we apply four routines of independent interest: (1) Factor a bipartition as a product of indecomposables; (2) recover a bipartition from its indecomposable factorization; (3) factor a BPM as a product of indecomposables; and (4) compute the "transpose-rotation" (the column dimension of a BPM is the row dimension of its transpose-rotation).
format Preprint
id arxiv_https___arxiv_org_abs_2111_05799
institution arXiv
publishDate 2021
record_format arxiv
spellingShingle Computing the Dimension of a Bipartition Matrix
Freeman, Dawson
Umble, Ronald
Combinatorics
Algebraic Topology
03E05, 05A18, 52B05, 52B11
The dimension of a bipartition matrix (BPM) is the sum of the dimensions of its indecomposable factors. The dimension of an indecomposable BPM is the sum of its row, column, and entry dimensions. To compute these dimensions, we apply four routines of independent interest: (1) Factor a bipartition as a product of indecomposables; (2) recover a bipartition from its indecomposable factorization; (3) factor a BPM as a product of indecomposables; and (4) compute the "transpose-rotation" (the column dimension of a BPM is the row dimension of its transpose-rotation).
title Computing the Dimension of a Bipartition Matrix
topic Combinatorics
Algebraic Topology
03E05, 05A18, 52B05, 52B11
url https://arxiv.org/abs/2111.05799