The admissible interval for the invariant factors of a product of matrices (Q4264402)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1339262
Language Label Description Also known as
default for all languages
No label defined
    English
    The admissible interval for the invariant factors of a product of matrices
    scientific article; zbMATH DE number 1339262

      Statements

      The admissible interval for the invariant factors of a product of matrices (English)
      0 references
      0 references
      6 February 2000
      0 references
      invariant factors
      0 references
      Young tableaux
      0 references
      Littlewood-Richardson sequences
      0 references
      admissible interval
      0 references
      local principal domain
      0 references
      invariant partition
      0 references
      combinatorial algorithm
      0 references
      The invariant factors of a nonsingular matrix \(A\) over a local principal domain can be identified with a partition of integers called the invariant partition of \(A\). Given partitions \(a\), \(b\), and \(c\), there are nonsingular matrices \(A\), \(B\), and \(C\) with invariant partitions \(a\), \(b\), and \(c\), respectively, such that \(AB=C\) if and only if there is a Littlewood-Richardson sequence of type \((a,b,c)\). For partitions \(a\), \(c\) with \(a\leq c\), let \(LR(a,c)\) be the set of partitions \(b\) for which at least one Littlewood-Richardson sequence of type \((a,b,c)\) exists. \(LR(a,c)\) has a minimal element \({\mathbf w}\) and a maximal element \({\mathbf n}\) with respect to order majorization. The author provides a combinatorial algorithm for constructing all elements in \(LR(a,c)\). She also exhibits explicit bijections between \(LR\) tableaux of conjugate shape and weight and between \(LR\) tableaux of dual shape and equal weight.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references