Login / Signup

A formula for a doubly refined enumeration of alternating sign matrices.

Matan KarklinskyDan Romik
Published in: Adv. Appl. Math. (2010)
Keyphrases
  • coefficient matrix
  • dynamic programming
  • singular value decomposition
  • positive definite
  • refinement process
  • knowledge base
  • search space
  • eigendecomposition
  • sparse matrix
  • american sign language