Solving Sum of Integers for Given Constraints

  • Thread starter Thread starter TriTertButoxy
  • Start date Start date
  • Tags Tags
    Integers Sum
TriTertButoxy
Messages
190
Reaction score
0
Hi, I'm doing a physics calculation, and along the way, I've run up against a curious math problem. I'm sure this is a rather classic problem in mathematics, but I'm just not acquainted with the subject enough to answer it, or even look it up, so hopefully someone can point me in the right direction.

For a given positive integer \ell>0 and another positive integer m\leq\ell, for what values of a list of (zero or positive) integers \{k_1\geq0,\,k_2\geq0,\,\ldots,\,k_\ell\geq0\} satisfies the following simultaneous pair of equations?
\sum_{n=1}^\ell k_n = m
\sum_{n=1}^\ell n k_n = \ell

Even the name given to the problem would point me in the right direction. Thanks!
Also, please do not treat me like a student :-)
 
Physics news on Phys.org
Ok, I think I found the answer; The answer has something to do with Bell's polynomials, and exponential formula. Thanks anyway :-)
 
TriTertButoxy said:
Hi, I'm doing a physics calculation, and along the way, I've run up against a curious math problem. I'm sure this is a rather classic problem in mathematics, but I'm just not acquainted with the subject enough to answer it, or even look it up, so hopefully someone can point me in the right direction.

For a given positive integer \ell>0 and another positive integer m\leq\ell, for what values of a list of (zero or positive) integers \{k_1\geq0,\,k_2\geq0,\,\ldots,\,k_\ell\geq0\} satisfies the following simultaneous pair of equations?
\sum_{n=1}^\ell k_n = m
\sum_{n=1}^\ell n k_n = \ell

Even the name given to the problem would point me in the right direction. Thanks!
Also, please do not treat me like a student :-)
For the sum to add up to no more than \ell there would have to be a lot of k's equal to zero since for larger integers the sum would easily exceed \ell. To find a solution, I would suggest that assume all but one k were zero and that m divides \ell. P.S. this doesn't look like a classic problem.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top