Skip to main content
SpringerLink
Log in

Quartic Barriers

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Many mathematical propositions are expressed in terms of a natural number n for which they are either true or false. This expository paper surveys a collection of propositions P(n) which are true if and only if n ≤ 4.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall: Englewood Cliffs, NJ, 1993.

    Google Scholar 

  2. K. Appel and W. Haken, “Every planar map is four colorable,” Bulletin of the American Mathematical Society, vol. 82, pp. 711–712, 1976.

    Google Scholar 

  3. E.R. Berlekamp, J.H. Conway, and R.K. Guy, Winning Ways: Games in Particular, vol. 2, Academic Press: London, 1982.

    Google Scholar 

  4. T. Bonnesen and W. Fenchel, Konvexe Körper, Chelsea Publishing Company: New York, 1948.

    Google Scholar 

  5. J.J.A.M. Brands and G. Laman, “Plane section of a tetrahedron,” American Mathematical Monthly, vol. 70, pp. 338–339, 1963.

    Google Scholar 

  6. G. Chartrand and D.P. Geller, “On uniquely colorable planar graphs,” Journal of Combinatorial Theory, vol. 6, pp. 271–278, 1969.

    Google Scholar 

  7. R.W. Cottle, “Minimal triangulation of the 4–cube,” Discrete Mathematics, vol. 40, pp. 25–29, 1982.

    Google Scholar 

  8. R.W. Cottle, J.S. Pang, and R.E. Stone, The Linear Complementarity Problem, Academic Press: Boston, 1992.

    Google Scholar 

  9. H. Davenport, The Higher Arithmetic, 6th edition, Cambridge University Press: Cambridge, 1992.

    Google Scholar 

  10. P.H. Diananda, “On nonnegative forms in real variables some or all of which are nonnegative,” Proceedings of the Cambridge Philosophical Society, vol. 58, pp. 17–25, 1962.

    Google Scholar 

  11. G.A. Dirac and S. Schuster, “A theorem of Kuratowski,” Indagationes Mathematicae, vol. 16, pp. 343–348, 1954.

    Google Scholar 

  12. H.G. Eggleston, “Plane section of a tetrahedron,” American Mathematical Monthly, vol. 70, p. 1108, 1963.

    Google Scholar 

  13. P. Erdös, A. Goodman, and L. Pósa, “The representation of a graph by set intersections,” Canadian Journal of Mathematics, vol. 18, pp. 106–112, 1966.

    Google Scholar 

  14. R.E. Erickson, C.L. Monma, and A.F. Veinott, Jr., “Send-and-split method for minimum-concave-cost network flows,” Mathematics of Operations Research, vol. 12, pp. 634–664, 1987.

    Google Scholar 

  15. H. Eves, An Introduction to the History of Mathematics, Rinehart: New York, 1953.

    Google Scholar 

  16. J. Faraut and A. Korányi, Analysis on Symmetric Cones, Oxford University Press: New York, 1994.

    Google Scholar 

  17. F. Granot and A.F. Veinott, Jr., “Substitutes, complements and ripples in network flows,” Management Science, vol. 10, pp. 471–497, 1985.

    Google Scholar 

  18. H.W. Guggenheimer, Applicable Geometry, Robert E. Krieger Publishing Company, Inc.: Huntington, 1977.

    Google Scholar 

  19. M. Hall, “A problem in partitions,” Bulletin of the American Mathematical Society, vol. 47, pp. 804–807, 1941.

    Google Scholar 

  20. M. Hall, Jr., “A survey of combinatorial analysis,” in Some Aspects of Analysis and Probability, Surveys in Applied Mathematics IV, I. Kaplansky, M. Hall, Jr., E. Hewitt, and R. Fortet (Eds.), John Wiley & Sons: New York, 1958, pp. 35–104.

    Google Scholar 

  21. M. Hall, Jr., Combinatorial Theory, Blaisdell: Waltham, MA, 1967.

    Google Scholar 

  22. M. Hall, Jr. and M. Newman, “Copositive and completely positive quadratic forms,” Proceedings of the Cambridge Philosophical Society, vol. 59, pp. 329–339, 1963.

    Google Scholar 

  23. F. Hausdorff, “Der Wertvorrat einer Bilinearform,” Mathematische Zeitschrift, vol. 3, pp. 314–316, 1919.

    Google Scholar 

  24. P. Heawood, “Map color theorems,” Quarterly Journal of Mathematics, vol. 24, pp. 332–338, 1890.

    Google Scholar 

  25. R. Honsberger, “A problem in checker-jumping,” Mathematical Gems II, Mathematical Association of America: Washington, D.C., 1976, pp. 23–28.

    Google Scholar 

  26. R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press: Cambridge, 1985.

    Google Scholar 

  27. R.A. Horn and C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press: Cambridge, 1991.

    Google Scholar 

  28. C. Kuratowski, “Sur le probleme des courbes gauches en topologie,” Fundamenta Mathematicae, vol. 15–16, pp. 271–283, 1930.

    Google Scholar 

  29. J.L. Lagrange, “Réflexions sur la résolution algébrique des équations,” Oevres, vol. 3, pp. 207–421. (From a paper of 1771.)

  30. A.-M. Legendre, Théorie des Nombres, F. Didot: Paris, 1830.

    Google Scholar 

  31. C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,” Management Science, vol. 11, pp. 681–689, 1965.

    Google Scholar 

  32. O. Ore, Theory of Graphs, American Mathematical Society: Providence, RI, 1962.

    Google Scholar 

  33. O. Ore, The Four-Color Problem, Academic Press: New York, 1967.

    Google Scholar 

  34. J.R. Maxfield and H. Minc, “On the matrix equation X′X = A,” Proceedings of the Edinburgh Mathematical Society, vol. 13:2, pp. 125–129, 1962–1963.

    Google Scholar 

  35. A. Meyer, “Mathematische Mittheilungen,” Vierteljahrschrift der Naturforschenden Gesellschaft in Zürich, vol. 29, pp. 209–222, 1884.

    Google Scholar 

  36. L.J. Mordell, Diophantine Equations, Academic Press: New York, 1969.

    Google Scholar 

  37. T.S. Motzkin, Beitrage zur Theorie der linearen Ungleichungen (Inaugural dissertation, Basel), Azriel: Jerusalem, 1936.

    Google Scholar 

  38. T.S. Motzkin, in National Bureau of Standards Report 1817, pp. 11–12, 1952.

  39. B.N. Moyls and M.D. Marcus, “Field convexity of a square matrix,” Proceedings of the American Mathematical Society, vol. 6, pp. 981–983, 1955.

    Google Scholar 

  40. T. Nagell, Introduction to Number Theory, John Wiley & Sons: New York; Almqvist & Wiksell: Stockholm, 1951.

    Google Scholar 

  41. O.T. O'Meara, Introduction to Quadratic Forms, Springer-Verlag: Berlin, 1963.

    Google Scholar 

  42. J. Philip, “Plane sections of simplices,” Mathematical Programming, vol. 3, pp. 312–325, 1972.

    Google Scholar 

  43. K.W. Schmidt, “Problem 68–18, Binary matrices,” SIAM Review, vol. 13, pp. 119–121, 1971.

    Google Scholar 

  44. D.E. Smith, History of Mathematics, vol. I, Dover: New York, 1951.

    Google Scholar 

  45. D.M.Y. Sommerville, An Introduction to the Geometry of N Dimensions, Dover: New York, 1958.

    Google Scholar 

  46. E. Szpilrajn-Marczewski, “Sur deux propriétés des classes d'ensembles,” Fundamenta Mathematicae, vol. 33, pp. 303–307, 1945.

    Google Scholar 

  47. L. Toti Rigatelli, Evariste Galois, Birkhäuser: Basel, 1996.

    Google Scholar 

  48. A.F. Veinott, Jr., “Least d-majorized network flows with inventory and statistical applications,” Management Science, vol. 17, pp. 547–567, 1971.

    Google Scholar 

  49. E.B. Vinberg, “Homogeneous cones,” Soviet Mathematics Doklady, vol. 1, p. 787, 1960.

    Google Scholar 

  50. E.B. Vinberg, “The theory of convex homogeneous cones,” Transactions of the Moscow Mathematical Society (1963), 1965, pp. 340–403.

  51. E.B. Vinberg, private communication, May 5, 1968.

  52. B.L. van der Waerden, Modern Algebra, vol. I, Ungar: New York, 1949.

    Google Scholar 

  53. D.W. Walkup, “A simplex with a large cross-section,” American Mathematical Monthly, vol. 75, pp. 34–36, 1968.

    Google Scholar 

  54. R. Webster, Convexity, Oxford University Press: Oxford, 1994.

    Google Scholar 

  55. C. Zong, Strange Phenomena in Convex and Discrete Geometry, Springer-Verlag: New York, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering-Economic Systems and Operations Research, Stanford University, Stanford, CA, 94305-4023

    Richard W. Cottle

Authors
  1. Richard W. Cottle
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cottle, R.W. Quartic Barriers. Computational Optimization and Applications 12, 81–105 (1999). https://doi.org/10.1023/A:1008615713732

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008615713732

Search

Navigation