License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.AofA.2020.12
URN: urn:nbn:de:0030-drops-120424
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12042/
Go to the corresponding LIPIcs Volume Portal

Fischer, Ilse ; Konvalinka, Matjaž

The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem

pdf-format:
LIPIcs-AofA-2020-12.pdf (0.6 MB)

Abstract

Alternating sign matrices are known to be equinumerous with descending plane partitions, totally symmetric self-complementary plane partitions and alternating sign triangles, but a bijective proof for any of these equivalences has been elusive for almost 40 years. In this extended abstract, we provide a sketch of the first bijective proof of the enumeration formula for alternating sign matrices, and of the fact that alternating sign matrices are equinumerous with descending plane partitions. The bijections are based on the operator formula for the number of monotone triangles due to the first author. The starting point for these constructions were known "computational" proofs, but the combinatorial point of view led to several drastic modifications and simplifications. We also provide computer code where all of our constructions have been implemented.

BibTeX - Entry

@InProceedings{fischer_et_al:LIPIcs:2020:12042,
  author =	{Ilse Fischer and Matjaž Konvalinka},
  title =	{{The First Bijective Proof of the Alternating Sign Matrix Theorem Theorem}},
  booktitle =	{31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
  pages =	{12:1--12:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-147-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{159},
  editor =	{Michael Drmota and Clemens Heuberger},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12042},
  URN =		{urn:nbn:de:0030-drops-120424},
  doi =		{10.4230/LIPIcs.AofA.2020.12},
  annote =	{Keywords: enumeration, bijective proof, alternating sign matrix, plane partition}
}

Keywords: enumeration, bijective proof, alternating sign matrix, plane partition
Collection: 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
Issue Date: 2020
Date of publication: 10.06.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI