192 reputation
8
bio website linkedin.com/in/piotrsemenov
location Russian Federation, Saint-Petersburg
age 28
visits member for 1 year, 7 months
seen May 12 at 20:44

Researcher and software engineer.


Feb
7
accepted How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
Feb
7
comment How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
sure, I specified the upper limit just to see the finite summation. Thank you for your answer!
Feb
6
comment How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
Just to improve your answer, the upper limit of sum is $\lfloor \frac{k}{l} \rfloor-1$.
Feb
6
comment How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
Just a small typo in your answer. Add $l$ balls to first bin, one have to distribute $k-l$ balls (instead of "$m-l$ units").
Feb
6
comment How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
Can you kindly explain, why $\binom{k-jl-1}{m-1}$ and not $\binom{k-jl-1}{m-j-1}$?
Feb
5
asked How many ways to distribute $k$ indistinguishable balls over $m$ of $n$ distinguishable bins of finite capacity $l$?
Feb
3
comment Number of ways to put $n$ unlabeled balls in $k$ bins with a max of $m$ balls in each bin
@Brian What are the sum limits in your formula? The expression from book Enumerative Combinatorics (p. $360$) is $L(n,k,m)=\sum_{j=0}^k (-1)^j C_k^j C_{k+n-j(m+1)-1}^{k-1}$ according to your notation, where $C_k^j$ means the binomial coefficient. Unfortunately, $L(n,k,m)=0$ for any $n \leq k \cdot m$ (Mathematica' showed me that). Somewhere the mistake lives. Can you kindly help me with this problem?
Oct
29
awarded  Scholar
Oct
29
accepted When is a cyclotomic polynomial over a finite field a minimal polynomial?
Oct
29
accepted How many irreducible factors does $x^n-1$ have over finite field?
Oct
22
asked How many irreducible factors does $x^n-1$ have over finite field?
Oct
21
awarded  Student
Oct
21
comment When is a cyclotomic polynomial over a finite field a minimal polynomial?
Thanks! So I did a mistake while suggesting that cyclotomic polynomials are also irreducible in case of finite fields.
Oct
21
revised When is a cyclotomic polynomial over a finite field a minimal polynomial?
deleted 94 characters in body
Oct
21
comment When is a cyclotomic polynomial over a finite field a minimal polynomial?
Please explain it for the following example. Given finite field $\mathrm{F}_q$, I have a decomposition $x^n-1=\prod_{i=0}^{m-1}f_i(x)$ over $\mathrm{F}_q$, where all $f_i(x)$ are cyclotomic. I am not sure that all $f_i(x)$ are minimal polynomials for some elements from extension $[\mathrm{F}_q^r : \mathrm{F}_q]$, where $r$ is a smallest number that $n$ divides $q^r - 1$. What is wrong in that?
Oct
21
revised When is a cyclotomic polynomial over a finite field a minimal polynomial?
added 82 characters in body
Oct
21
asked When is a cyclotomic polynomial over a finite field a minimal polynomial?
Jun
27
awarded  Critic
Jun
27
awarded  Commentator
Jun
26
comment Finding Eigenvalues and Eigenvectors weird equations
I got my answers just be definition of eigenvector: for matrix $A$ the eigenvector $v$ corresponding to eigenvalue $\lambda$ is the solution of system of linear equations $(A - \lambda \cdot I) \cdot v = 0$. In another words, dot product of matrix $(A - \lambda \cdot I)$ rows and vector $v$ vanishes. So I have got the equation $2x - y - 2z = 0$ for $[x, y, z]$ being the eigenvector we are looking for. Setting $x$ to $1$ you can got the eigenvectors $[1, 0, 1]$ and $[1, 2, 0]$ correspondingly.