Skip to main content
minus half -> plus half
Source Link
Lev Borisov
  • 5.2k
  • 1
  • 22
  • 38

Let's see what happens in dim 2. You have $conv((0,0),(ra_1+sb_1,0),(0,ra_2+sb_2))$. The number of points in the closed triandle $(0,0),(A,0),(0,B)$ is $(A+1)(B+1)/2$ minusplus half the number of points on the diagonal, which is $gcd(A,B)+1$. So up to a polynomial in $r$ and $s$ you get $gcd(ra_1+sb_1,ra_2+sb_2)$. I am pretty sure it is not polynomial in $r,s$. For example, take $a_1=1$, $b_1=0$, $a_2=0$, $b_2=1$, so you get $gcd(r,s)$.

Let's see what happens in dim 2. You have $conv((0,0),(ra_1+sb_1,0),(0,ra_2+sb_2))$. The number of points in the closed triandle $(0,0),(A,0),(0,B)$ is $(A+1)(B+1)/2$ minus the number of points on the diagonal, which is $gcd(A,B)+1$. So up to a polynomial in $r$ and $s$ you get $gcd(ra_1+sb_1,ra_2+sb_2)$. I am pretty sure it is not polynomial in $r,s$. For example, take $a_1=1$, $b_1=0$, $a_2=0$, $b_2=1$, so you get $gcd(r,s)$.

Let's see what happens in dim 2. You have $conv((0,0),(ra_1+sb_1,0),(0,ra_2+sb_2))$. The number of points in the closed triandle $(0,0),(A,0),(0,B)$ is $(A+1)(B+1)/2$ plus half the number of points on the diagonal, which is $gcd(A,B)+1$. So up to a polynomial in $r$ and $s$ you get $gcd(ra_1+sb_1,ra_2+sb_2)$. I am pretty sure it is not polynomial in $r,s$. For example, take $a_1=1$, $b_1=0$, $a_2=0$, $b_2=1$, so you get $gcd(r,s)$.

Source Link
Lev Borisov
  • 5.2k
  • 1
  • 22
  • 38

Let's see what happens in dim 2. You have $conv((0,0),(ra_1+sb_1,0),(0,ra_2+sb_2))$. The number of points in the closed triandle $(0,0),(A,0),(0,B)$ is $(A+1)(B+1)/2$ minus the number of points on the diagonal, which is $gcd(A,B)+1$. So up to a polynomial in $r$ and $s$ you get $gcd(ra_1+sb_1,ra_2+sb_2)$. I am pretty sure it is not polynomial in $r,s$. For example, take $a_1=1$, $b_1=0$, $a_2=0$, $b_2=1$, so you get $gcd(r,s)$.