A note on partition sum polynomials (Q2462319): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2006.12.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2035246978 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4313087 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3496299 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximately \(n\)-secting an angle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Lattice Based Public Key Cryptosystem Using Polynomial Representations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fibonacci numbers and Fermat's last theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the sum \(\sum_{k\equiv r\pmod m}{n\choose k}\) and related congruences. / rank | |||
Normal rank |
Revision as of 12:43, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on partition sum polynomials |
scientific article |
Statements
A note on partition sum polynomials (English)
0 references
30 November 2007
0 references
In the present paper the authors consider the following problem: how to partition the set \(\{\frac{k!}{p_0!p_1!...p_{n-2}!}\mid p_i\geq 0, p_0+...+p_{n-2}=k\}\) such that the differences between sums of partitions are at most \(1\)? In particular, for \(n=3\), the authors' main result implies that the sum \({k\choose i}+{k\choose{i+3}}+{k\choose{i+6}}+\dots\) equals \(\frac{2^k-(-1)^k}{3}+\delta(k)(-1)^k\), where \(\delta(k)=1\) if \(i\equiv(-k)\pmod 3\) and \(\delta(k)=0\) otherwise. In addition, for \(n\neq 3\), they study how close to \(2^k/n\) the sum \({k\choose i}+{k\choose{i+n}}+{k\choose{i+2n}}+\dots\) could be.
0 references