1
$\begingroup$

Let $f \in \mathbb{Q}[x]$.

Let $S(f)$ denote the number of distinct linear factors of $f(x)-f(y)$.

$S(f)$ is bounded by $\deg(f)$.

Q1 Is $S(f)$ bounded by constant?

Q2 Is it possible $S(f)>2$ for arbitrary large degree of $f$?

This is related to the number of ways of polynomial represents an integer.

$\endgroup$
2
  • 4
    $\begingroup$ This is regarding $f(x)-f(y)$ as an element of $\mathbb{Q}[x,y]$? Or is $y$ a number? $\endgroup$ May 31, 2016 at 14:32
  • $\begingroup$ @DanielMcLaury Yes, in Q[x,y]. $\endgroup$
    – joro
    May 31, 2016 at 14:43

1 Answer 1

15
$\begingroup$

$S(f) \leq 2$ for all nonconstant $f$.

By context, I understand that you mean factorization in $\mathbb{Q}[x,y]$. If you factor in $\mathbb{C}[x,y]$ then, of course, $x^n-y^n$ is a product of lines. (Daniel McLaury, in comments, mentions a third option, that $y$ might be a fixed integer. I don't know about this.)

Assume $f$ is not constant. Then clearly $x$ and $y$ do not divide $f(x)-f(y)$. Any other linear function can be written as $y-\lambda(x)$ for some affine linear transformation $\lambda(x) = mx+b$ with $m \neq 0$. If $y-\lambda(x)$ divides $f(y)-f(x)$ then $f(\lambda(x)) = f(x)$ for all $x$. Thus, $f(x) = f(\lambda(x)) = f(\lambda(\lambda(x)) = \cdots$. If $\lambda$ is not of either the form $\lambda(x) = x$ or $\lambda(x) = c-x$, then iteration of $\lambda$ has infinite orbits, so this implies $f$ is constant, a contradiction. (If we were factoring over $\mathbb{C}[x,y]$, we'd have to consider $m$ a root of unity other than $\pm 1$.)

Moreover, if $y-(c_1-x)$ and $y-(c_2-x)$ both divide $f(y)-f(x)$, then $f(x) = f(c_1-x) = f(c_1-c_2+x) = \cdots = f(k(c_1-c_2)+x)$ for all $k$, so we can have $y-(c-x) | f(y)-f(x)$ for at most one $c$.

Thus, the most that can divide $f(y)-f(x)$ is $y-x$ and $x+y-c$ for one value of $c$, and $S(f) \leq 2$.

You might have intended to count factors with multiplicity, but this doesn't matter. Let the leading term of $f(x)$ be $f_n x^n$. Then the degree $n$ part of $f(y) - f(x)$, namely $f_n (x^n-y^n)$ is divisible by $x-y$ and $x+y$ only once, so $x-y$ and $x+y-c$ can each divide $f(x)-f(y)$ only once.

$\endgroup$
2
  • 1
    $\begingroup$ If $y$ is fixed integer, the answer is trivially unbounded. Choose natural $n$ an set $f(x)=\prod_{i=1}^n(x-i)$. $f(x)=0$ has $n$ integer zeros. Set $y$ to any of the zeros, then $f(x)-f(y)$ has $n$ distinct linear factors. $\endgroup$
    – joro
    May 31, 2016 at 16:03
  • 2
    $\begingroup$ @David Speyer: Your last paragraph gives an easier proof of $S(f)\le2$: Let $H(F)$ be the highest homogeneous term of a bivariate polynomial $F$. If $F=F_1F_2\cdots F_r$, then $H(F)=H(F_1)H(F_2)\cdots H(F_r)$. Thus it suffices to consider the case $f=X^n$, which is obvious. $\endgroup$ May 31, 2016 at 21:47

Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.