9
$\begingroup$

If $n\geq 2$, is the function $$ f_n(a,b) := \left( \frac{\binom{n}{a}}{\binom{n}{b}}\right)^{\frac{1}{b-a}}$$ injective over the set $\{ (a,b) \;|\; 0\leq a<b \leq n, \; a+b \neq n \}$?

I heard about this problem by way of a colleague who attributed it to William Wu of Stanford. According to our mutual friend, it came up in a study of self-intersections of bezier curves. If pressed, I could perhaps produce a reference.

A few simple comments, which I'm not sure are helpful. First, it's easy to see that the functions are injective and equal to rational numbers over the subdomain where $b-a=1$, and (apparently) equal to irrational algebraic numbers over the rest of the domain. My efforts at proving this conjecture were focused in that direction. Second, I computer-verified this for $n \leq 675$.

$\endgroup$
3
  • $\begingroup$ Can you state clealry if a and b are restricted to integers? Gerhard "Ask Me About System Design" Paseman, 2011.11.09 $\endgroup$ Nov 10, 2011 at 4:56
  • $\begingroup$ Sorry, I meant clearly. Gerhard "Ask Me About System Design" Paseman, 2011.11.09 $\endgroup$ Nov 10, 2011 at 4:57
  • $\begingroup$ Yes, a, b, and n are all integers. $\endgroup$ Nov 10, 2011 at 5:56

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.