Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. The polytope of Tesl ...
Conference paper

The polytope of Tesler matrices

Karola Mészáros (1), Alejandro H. Morales (2), Brendon Rhoades (3)
(1) Department of Mathematics [Cornell]
(2) University of California [Los Angeles]
(3) Department of Mathematics [Univ California San Diego]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2014
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 27th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2015)
Proceedings
DOI
10.46298/dmtcs.2475
License
Attribution 4.0 International (CC BY 4.0)
Polytopes in Combinatorics and Algebra
Indicators
667
Views
678
Downloads

The polytope of Tesler matrices

Karola Mészáros (1), Alejandro H. Morales (2), Brendon Rhoades (3)
(1) Department of Mathematics [Cornell]
(2) University of California [Los Angeles]
(3) Department of Mathematics [Univ California San Diego]
Abstract
English
We introduce the Tesler polytope $Tes_n(a)$, whose integer points are the Tesler matrices of size n with hook sums $a_1,a_2,...,a_n in Z_{\geq 0}$. We show that $Tes_n(a)$ is a flow polytope and therefore the number of Tesler matrices is counted by the type $A_n$ Kostant partition function evaluated at $(a_1,a_2,...,a_n,-\sum_{i=1}^n a_i)$. We describe the faces of this polytope in terms of "Tesler tableaux" and characterize when the polytope is simple. We prove that the h-vector of $Tes_n(a)$ when all $a_i>0$ is given by the Mahonian numbers and calculate the volume of $Tes_n(1,1,...,1)$ to be a product of consecutive Catalan numbers multiplied by the number of standard Young tableaux of staircase shape.
French
On présente le polytope de Tesler $Tes_n(a)$, dont les points réticuilaires sont les matrices de Tesler de taillen avec des sommes des équerres $a_1,a_2,...,a_n in Z_{\geq 0}$. On montre que $Tes_n(a)$ est un polytope de flux. Donc lenombre de matrices de Tesler est donné par la fonction de Kostant de type An évaluée à ($(a_1,a_2,...,a_n,-\sum_{i=1}^n a_i)$On décrit les faces de ce polytope en termes de “tableaux de Tesler” et on caractérise quand le polytope est simple.On montre que l’h-vecteur de $Tes_n(a)$ , quand tous les $a_i>0$ , est donnée par le nombre de permutations avec unnombre donné d’inversions et on calcule le volume de T$Tes_n(1,1,...,1)$ comme un produit de nombres de Catalanconsécutives multiplié par le nombre de tableaux standard de Young en forme d’escalier
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Tesler matrices
  • flow polytopes
  • Kostant partition function
Cited by

Source: OpenCitations

  • A weighted sum over generalized Tesler matrices

    Journal of Algebraic Combinatorics

    Authors : Andrew Timothy Wilson ORCID

    Journal reference : Volume 45, 2016, pp. 825-855

    DOI : 10.1007/s10801-016-0726-2
Preview
Loading PDF preview...