Does A(n, k) have a combinatorial interpretation when k is an arbitrary negative integer?
Statement
Does A(n, k) have a combinatorial interpretation when k is an arbitrary negative integer? Furthermore, it follows by (2) that for n even, A(n, k) \geq 0 for any k \in R. (We are integrating x2 against a non-negative function over R.) A potentially easier question is therefore: Question′. Does A(2n, k) have a combinatorial interpretation for all k \in Z? Av\pi (n, 3) = C(n + 2) − 2n . Overall, the k-arrangements appear to provide a combinatorially rich general setting for several types of enumerative questions. Intriguingly, the k-arrangements are also closely connected to a fundamental object in probability theory. Specifically, (1) can be seen to be equivalent to Z \infty (2) A(n, k) = xn e−x+(k−1) dx. k−1
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.