Equalizing the Coefficients in a Product of Polynomials
Canadian mathematical bulletin, Tome 16 (1973) no. 4, pp. 531-539

Voir la notice de l'article provenant de la source Cambridge University Press

In 1959, Moser [4] posed the following problem: how should a pair of n-sided dice be loaded (identically) so that, on throwing the dice, the frequency of the most frequently occurring sum is as small as possible? This can be recast in the following form: determine for each n(≥1), the polynomial P n (x) which minimizes the maximum coefficient in the polynomial subject to the conditions that the coefficients of P n (x) are nonnegative and sum to unity.
Macleod, R. A.; Roberts, F. D. K. Equalizing the Coefficients in a Product of Polynomials. Canadian mathematical bulletin, Tome 16 (1973) no. 4, pp. 531-539. doi: 10.4153/CMB-1973-087-x
@article{10_4153_CMB_1973_087_x,
     author = {Macleod, R. A. and Roberts, F. D. K.},
     title = {Equalizing the {Coefficients} in a {Product} of {Polynomials}},
     journal = {Canadian mathematical bulletin},
     pages = {531--539},
     year = {1973},
     volume = {16},
     number = {4},
     doi = {10.4153/CMB-1973-087-x},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-087-x/}
}
TY  - JOUR
AU  - Macleod, R. A.
AU  - Roberts, F. D. K.
TI  - Equalizing the Coefficients in a Product of Polynomials
JO  - Canadian mathematical bulletin
PY  - 1973
SP  - 531
EP  - 539
VL  - 16
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-087-x/
DO  - 10.4153/CMB-1973-087-x
ID  - 10_4153_CMB_1973_087_x
ER  - 
%0 Journal Article
%A Macleod, R. A.
%A Roberts, F. D. K.
%T Equalizing the Coefficients in a Product of Polynomials
%J Canadian mathematical bulletin
%D 1973
%P 531-539
%V 16
%N 4
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1973-087-x/
%R 10.4153/CMB-1973-087-x
%F 10_4153_CMB_1973_087_x

[1] 1. Barrodale, I. and Roberts, F. D. K., Application of mathematical programming to l approximation, in nonlinear programming, Rosen, Mangasarian and Ritter, eds., Academic Press, New York, (1970), 447–464. Google Scholar

[2] 2. Clements, G. F., On a min-max problem of Leo Moser, J. Combinatorial Theory, 4 (1968), 36–39. Google Scholar

[3] 3. Fröberg, C E., Introduction to numerical analysis, Addison-Wesley, Reading, Mass., 1969. Google Scholar

[4] 4. Moser, L., in Report of the Institute in the Theory of Numbers, University of Colorado, June 21-July 17 (1959), p. 342. Google Scholar

[5] 5. Moser, L., On the representation of 1, 2,…, n by sums, Acta Arith. VI (1960), 11–13. Google Scholar

Cité par Sources :