• A formula for a doubly refined...

Treffer: A formula for a doubly refined enumeration of alternating sign matrices

Title:
A formula for a doubly refined enumeration of alternating sign matrices
Authors:
KARKLINSKY, Matan, ROMIK, Dan
Source:
Advances in applied mathematics (Print). 45(1):28-35
Publisher Information:
San Diego, CA: Elsevier, 2010.
Publication Year:
2010
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Généralités, histoire et biographie, General, history and biography, Mathématiques générales, General mathematics, Combinatoire, Combinatorics, Combinatoria, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Produit matrice, Matrix product, Producto matriz, 05XX, 05A15, 82B20, Alternating sign matrix, Enumerative combinatorics, Six-vertex model, Square ice
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Einstein Institute of Mathematics, The Hebrew University, Givat-Ram, Jerusalem 91904, Israel
ISSN:
0196-8858
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=22744705
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.22744705
Database:
PASCAL Archive

Weitere Informationen

Zeilberger (1996) [12] proved the Refined Alternating Sign Matrix Theorem, which gives a product formula, first conjectured by Mills, Robbins and Rumsey (1983) [9], for the number of alternating sign matrices with given top row. Stroganov (2006) [10] proved an explicit formula for the number of alternating sign matrices with given top and bottom rows. Fischer and Romik (2009) [7] considered a different kind of doubly-refined enumeration where one counts alternating sign matrices with given top two rows, and obtained partial results on this enumeration. In this paper we continue the study of the doubly-refined enumeration with respect to the top two rows, and use Stroganov's formula to prove an explicit formula for these doubly-refined enumeration numbers.