MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have the following relation:

$$ \sum_{d|n} (1+1/x)^{d-1} F_{n/d}(x^d)=L_n(x) $$

where the right hand side is (for every $n$) a polynomial in $x$, which I have an expression for, but it's not extremely beautiful. The family of polynomials $F_k(x)$ is unknown, and is what I'm looking for.

Since this is close to Dirichlet convolution, I have not quite given up hope that there is something similar to Möbius inversion, that would give me $F_k(x)$ explicitely. Is this possible? Related instances of such a problem may also be interesting.

A possibly weaker, but still sufficient solution would be an expression in terms of $L_k$ and $R_k$ of the expression

$$ \sum_{d|n} R_d(x) F_{n/d}(x^d) $$

where $R_k(x)$ is another family of polynomials, which is also unknown.

share|cite|improve this question
A meta question: would a tag "inverse-relations" be appropriate? – Martin Rubey Aug 7 '10 at 10:16

At least computing $F_k(x)$ turned out not to be that hard after all. Slightly more generally, consider

$$ \sum_{d|k} Z_d(x) F_{n/d}(x^d) = L_n(x), $$ with $Z_1(x)=1$.

Then we have $$ F_n(x)=\sum_{1=d_0|d_1|\dots|d_k|n}L_{n/d_k}(x^{d_k}) (-1)^k\prod_{i=0}^{k-1} Z_{d_{i+1}/d_i}(x^{d_i}), $$

where in the sum $d_0 < d_1 < \dots < d_k \leq n$. In other words, we are summing over all chains starting at $1$, below $n$. The formula is easily shown by induction.

share|cite|improve this answer
Shameless plug: I used this, to give an "explicit" expression for the number of ribbon Schur functions of given size and height, see . Of course, it would be very nice if the formulas in Theorem 4.2 could be simplified. – Martin Rubey Aug 23 '10 at 12:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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