FACTORIZACIÓN DE PERMUTACIONES
We present a program for computing a factorization of the elements of S", using the minimal number of simple transpositions. The program is implemented for the computational algebraic system CoCoA.
- Autores:
- Tipo de recurso:
- article
- Fecha de publicación:
- 2003
- Institución:
- Pontificia Universidad Javeriana
- Repositorio:
- Repositorio Universidad Javeriana
- Idioma:
- eng
- OAI Identifier:
- oai:repository.javeriana.edu.co:10554/31651
- Acceso en línea:
- http://revistas.javeriana.edu.co/index.php/scientarium/article/view/4843
http://hdl.handle.net/10554/31651
- Palabra clave:
- null
Permutation, simple transposition, Lehmer code, Schubert polynomial.
null
- Rights
- openAccess
- License
- Atribución-NoComercial-SinDerivadas 4.0 Internacional
| Summary: | We present a program for computing a factorization of the elements of S", using the minimal number of simple transpositions. The program is implemented for the computational algebraic system CoCoA. |
|---|