Affordable Access

Publisher Website

Permutation equivalence and the Hermite invariant

Authors
Journal
Linear Algebra and its Applications
0024-3795
Publisher
Elsevier
Publication Date
Volume
256
Identifiers
DOI: 10.1016/s0024-3795(97)81114-7
Disciplines
  • Computer Science

Abstract

Abstract Permutation equivalence and permutation congruence are special cases of matrix equivalence and similarity. This paper introduces a new invariant—the Hermite invariant—for testing permutation equivalence, along with a method for computing it and an assessment of its complexity. Under a restricted definition, the complexity of the invariant becomes polynomial in the dimensions of the input matrices. The sufficiency of the invariant is discussed, and experimental results are given. These results suggest that the Hermite invariant is particularly good at distinguishing nonpermutation equivalent matrices with constant row and column sums.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Permutation invariant norms

on Linear Algebra and its Applica... Jan 01, 1995

Hermite indices and equivalence relations

on Linear Algebra and its Applica... Jan 01, 2004
More articles like this..