Ehrhart polynomials of the Birkhoff polytopes
edit · history · discussion · files · short url · combinatorics discrete geometry polynomial
Polynomials
$n$ 
$H_n(t)$
3:
1/8*t^4 + 3/4*t^3 + 15/8*t^2 + 9/4*t + 1
4:
11/11340*t^9 + 11/630*t^8 + 19/135*t^7 + 2/3*t^6 + 1109/540*t^5 + 43/10*t^4 + 35117/5670*t^3 + 379/63*t^2 + 65/18*t + 1
5:
188723/836911595520*t^16 + 188723/20922789888*t^15 + 1008757/5977939968*t^14 + 112655/57480192*t^13 + 72750523/4598415360*t^12 + 984101/10450944*t^11 + 125188639/292626432*t^10 + 55426325/36578304*t^9 + 3541860299/836075520*t^8 + 196563587/20901888*t^7 + 3812839477/229920768*t^6 + 664118435/28740096*t^5 + 438177965089/17435658240*t^4 + 3028287247/145297152*t^3 + 6229735/494208*t^2 + 725/144*t + 1
6:
9700106723/10258736801144832000000*t^25 + 9700106723/136783157348597760000*t^24 + 158824242127/62444484876533760000*t^23 + 4394656999/75690284698828800*t^22 + 853529939221/901074817843200000*t^21 + 141248912237/12014330904576000*t^20 + 2462417656967/21341245685760000*t^19 + 18674864899/20324995891200*t^18 + 1062348478211833/175751435059200000*t^17 + 77984295979769/2343352467456000*t^16 + 1424745952102609/9206027550720000*t^15 + 8346012436199/13638559334400*t^14 + 570713692223620411/276180826521600000*t^13 + 2000221303490489/334764638208000*t^12 + 16265048187290869/1098446469120000*t^11 + 736591080322991/23433524674560*t^10 + 253578194011961479/4446092851200000*t^9 + 232132948167689/2634721689600*t^8 + 243245111626317349/2111894104320000*t^7 + 14226886368398551/112634352230400*t^6 + 155498465793777230567/1355132050272000000*t^5 + 382955230861099213/4517106834240000*t^4 + 12246206617138789/247365374256000*t^3 + 46584105377/2141691552*t^2 + 3899/600*t + 1
Definition
The Birkhoff polytope $B_n\subset\mathbb{R}^{n\times n}$ is the lattice polytope of $n\times n$ doubly stochastic matrices [2]. The table stores its Ehrhart polynomial $H_n(t)=L_{B_n}(t)$, counting $n\times n$ nonnegative integer matrices whose rows and columns all sum to $t$.
Parameters
$n$
—   matrix size ($n$ is a positive integer)
Formulas
(1)
If $d=(n-1)^2$, then $\sum_{t\geq0}H_n(t)z^t=h^*_{B_n}(z)/(1-z)^{d+1}$ [3].
(2)
With $d=(n-1)^2$ and $h^*_{B_n}(z)=\sum_i h_i^*z^i$, $H_n(t)=\sum_{i=0}^{d}h_i^*\binom{t+d-i}{d}$.
(3)
$H_n(1)=$$n!$, since the lattice points of $B_n$ are the $n\times n$ permutation matrices.
(4)
$d!\,[t^d]H_n(t)$ is the normalized volume of $B_n$, where $d=(n-1)^2$ and $[t^d]H_n(t)$ is the leading coefficient [6].
(5)
$H_n(-n-t)=(-1)^{n-1}H_n(t)$ and $H_n(-1)=\cdots=H_n(-n+1)=0$ [1].
Comments
(6)
$H_n(t)$ counts semi-magic squares: $n\times n$ nonnegative integer matrices whose rows and columns all sum to $t$, with no condition on the diagonals.
(7)
For $n=1$ and $n=2$ the polytope is respectively a point and a line segment, so $H_1(t)=1$ and $H_2(t)=t+1$.
(8)
Beck and Pixton computed $H_n(t)$ for $n\leq9$ [1], and the polynomials are listed at [4]. The rows from $n=7$ on are omitted here because the polynomials are long enough to be poor reference entries.
Programs
(P1)
Sage
import numberdb.sage as numberdb
from sage.arith.misc import binomial
from sage.rings.rational_field import QQ
from sage.rings.polynomial.polynomial_ring_constructor import PolynomialRing

T = PolynomialRing(QQ, "t")
t = T.gen()

def ehrhart_from_h_star(coefficients, dimension):
    return sum(QQ(c) * T(binomial(t + dimension - i, dimension))
               for i, c in enumerate(coefficients))

ehrhart_from_h_star([1, 14, 87, 148, 87, 14, 1], 9)  # H_4(t)
References
[1]
Matthias Beck and Dennis Pixton, The Ehrhart polynomial of the Birkhoff polytope, Discrete & Computational Geometry 30 (2003), no. 4, 623-637. (arXiv) (doi)
Links
Similar tables
Ehrhart $h^*$-polynomials of the Birkhoff polytopes —   gives the numerator $h^*_{B_n}(z)$ of the Ehrhart series; the two tables determine each other by (1) and (2)
Factorial of natural numbers —   gives $H_n(1)=n!$, the number of permutation matrices in $B_n$
Data properties
Entries are of type: rational polynomial
Table is complete: no (it holds $H_n(t)$ for every matrix size $n$ with $3\leq n\leq6$; for $n=1,2$ the values are trivial, and from $n=7$ the polynomials run to thousands of characters)
How they were obtained:

The $h^*$-coefficients used to compute these rows are transcribed from OEIS A259473 [5], and the Ehrhart polynomials are obtained from them by the binomial transform in (2).

more

The entries were compared with Beck and Pixton's published polynomials [4]; direct dynamic-programming counts for $n=3,4,5$ were compared with OEIS A002817 [7], A001496 [8], and A003438 [9]; each stored row satisfied $H_n(1)=n!$.