Tagged Questions

The tag has no usage guidance.

237 views

153 views

Solving for f given constraint involving f(x, y) and f(xy, y)

I am interested in a weighted version of the Catalan numbers. The generating function for this case, $$f(x, y) = \sum_s \sum_n f_{s n} x^s y^n$$ (where the $y^n$ term is the weight), obeys the ...
199 views

Generating function of alternating even terms in the Vandermonde Convolution

I have G(x) = \sum_{i = 0}^{\infty} \sum_{r = 0}^{\infty} (-1)^i \binom{k}{2i} \binom{n-k}{r} x^{2i} x^{r} = \frac{1}{2} \left( (1 + x{\iota})^{k} + (1 - x \iota)^{k} \right)(1 + x)^...
79 views

222 views

Eliminating a variable from a two-variable linear recurrence

In attempting to enumerate a combinatorial class of objects, I've come to a bivariate recurrence: $$a_{n,k} = 2a_{n,k-1} + (k+1)a_{n-1,k+1} - ka_{n-1,k} - a_{n,k-2} + a_{n-1,k-1}.$$ Together with ...
1k views

Number of 1 in binary representation of n

Let $1(n)$ be the number of digits $1$ in binary representation of number $n$. For example, $13=1101_2$ so $1(13)=3\\$ Is there explicit form of $\,\,\sum{1(i)x^i}$? I checked OEIS and didn't find ...
183 views

58 views

Direct proof that a certain generating function is D-finite

Consider the set $T^{2,3}_n$ of all non-planar rooted trees with $n$ leaves labelled by $1,2,\ldots,n$ where each internal vertex can have two or three children. If we think of the binary / ternary ...
396 views

68 views

Restricted partitions with square terms only

Let $P(N,M,n)$ be the number of partitions of $n$ such that each term is $\le N$ and there are at most $M$ terms. So we know the generating function for $P(N,M,n)$ is $\frac{(q)_{N+M}}{(q)_M (q)_{N}}$...
390 views

A particularly “natural” algebraic structure with three commutative, pairwise-distributive operations

EDIT: As mentioned in my answer below, I was mistaken in thinking Dirichlet convolution distributes over ordinary convolution. I'm leaving this question here for reference. I keep stumbling on the ...
Any interesting properties of the matrix $M:=(m_{ij})$ with $m_{ij}=min(i,j)$? [closed]
Do you know any interesting properties on the matrix $M(n):=(m_{ij})$ of size $n \times n,$ where $m_{ij}= \text{min}(i,j)$ ? The matrix $M$ enumerates certain combinatorial objects.
I have the following generating function, $$G(x,y)=\sum_{n,k \geq 0}a(n,k)x^ny^k = \frac{(y^2-y)x+1}{(y-y^3)x^2-(y+1)x+1}$$ and I am interested in obtaining an asymptotic for the sequence $a(n,k)$ i.e....