论文信息 - A CONJECTURE OF ERDOS

A CONJECTURE OF ERDOS

The modern formulation of Descartes' Rule of Signs provides a list of possible numbers of both positive and negative roots for a given sign sequence. We have shown (assuming none of the signs are zero) that polynomials exist with any of the possible numbers of positive roots. By replacing x by -x, we can provide a polynomial with the given sign sequence that contains any given number of negative roots allowable by Descartes. We have not addressed trying to accommodate both the positive and negative roots simultaneously. The following question is unanswered here and seems to be open: Given a sign sequence (which may include some zeros), do there exist polynomials containing positive and negative roots numbering each of the possible combinations allowed by Descartes' Rule of Signs?

R. Faudree

[1] Michael J. Flynn,et al. Very high-speed computing systems , 1966 .

[2] Ian Foster,et al. Designing and building parallel programs , 1994 .

[3] Brendan D. McKay,et al. A new upper bound on the Ramsey number R(5, 5) , 1992, Australas. J Comb..

[4] J. W. Moon,et al. On Subgraphs of the Complete Bipartite Graph , 1964, Canadian Mathematical Bulletin.

[5] M. Clancy,et al. Some small ramsey numbers , 1977, J. Graph Theory.

[6] Andrew Thomason. Graph products and monochromatic multiplicities , 1997, Comb..

[7] On the ramsey number of the five-spoked wheel , 1974 .

[8] Frank Harary,et al. Generalized Ramsey theory for graphs , 1972 .

[9] Vojtech Rödl,et al. Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs , 1992, Graphs Comb..

[10] A. Thomason. A Disproof of a Conjecture of Erdős in Ramsey Theory , 1989 .

[11] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .

[12] Richard H. Schelp,et al. AN EXTREMAL PROBLEM IN GENERALIZED RAMSEY THEORY , 1980 .

[13] A. Goodman. On Sets of Acquaintances and Strangers at any Party , 1959 .

[14] Richard H. Schelp,et al. All triangle-graph ramsey numbers for connected graphs of order six , 1980, J. Graph Theory.

[15] J. Sheehan,et al. On the number of complete subgraphs contained in certain graphs , 1981, J. Comb. Theory, Ser. B.

[16] A. Sidorenko. Cycles in graphs and functional inequalities , 1989 .