Skip to main content
SpringerLink
Log in

O

  • Chapter
Encyclopaedia of Mathematics

Part of the book series: Encyclopaedia of Mathematics ((ENMA))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fuchs, L.: Partially ordered algebraic systems, Pergamon, 1963.

    MATH  Google Scholar 

  2. Kokorin, A.I., and Kopytov, V.M.: Fully ordered groups, Halstad, 1974. (Translated from the Russian.)

    Google Scholar 

  3. Kopytov, V.M., and Medvedev, N.Ya.: The theory of lattice-ordered groups, Kluwer Acad. Publ., 1994. (Translated from the Russian.)

    Google Scholar 

  4. Mura, R.T.B., and Rhemtulla, A.H.: Orderable groups, M. Dekker, 1977.

    Google Scholar 

  5. Collins, G.E.: ‘Quantifier elimination for real closed fields by cylindrical algebraic decomposition, automata theory and formal language’: 2nd G.I. Conference Kaiserslautern, Springer, 1975, pp. 134–183.

    Google Scholar 

  6. Gabrielov, A.: ‘Projections of semi-analytic sets’, Functional Anal. Appl. 2 (1968), 282–291.

    Article  MathSciNet  MATH  Google Scholar 

  7. Knight, J.F., Pillay, A., and Steinhorn, C.: Definable sets in ordered structures I, IF, Trans. Amer. Math. Soc. 295 (1986), 565–605.

    Article  MathSciNet  Google Scholar 

  8. Dries, L. van den: ‘Remarks on Tarski’s problem concerning (R,+,-,exp)’, in G. Lolli, G. Longo, and A. Marcja (eds.): Logic Colloquium ‘82, North-Holland, 1984, pp. 97–121.

    Chapter  Google Scholar 

  9. Dries, L. van den: ‘o-minimal structures’, in W. Hodges, M. Hyland, C. Steinhorn, and J. Truss (eds.): Logic: From Foundations to Applications, European Logic Colloquium, Oxford, 1996, pp. 137–185.

    Google Scholar 

  10. Dries, L. van den, Macintyre, A.J., and Marker, D.: ‘The elementary theory of restricted analytic fields with exponentiation’, Ann. of Math. 140 (1994), 183–205.

    Article  MathSciNet  MATH  Google Scholar 

  11. Wilkie, A.J.: ‘Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function’, J. Amer. Math. Soc. (forthcoming).

    Google Scholar 

  12. Berman, J.: ‘Distributive lattices with an additional unary operation’, Aequationes Math. 16 (1977), 165–171.

    Article  MathSciNet  MATH  Google Scholar 

  13. Blyth, T.S., and Varlet, J.C.: Ockham algebras, Oxford Univ. Press, 1994.

    MATH  Google Scholar 

  14. Davey, B.A.: ‘On the lattice of subvarieties’, Houston J. Math. 5 (1979), 183–192.

    MathSciNet  MATH  Google Scholar 

  15. Priestley, H.A.: ‘Ordered sets and duality for distributive lattices’, Ann. Discrete Math. 23 (1984), 39–60.

    MathSciNet  Google Scholar 

  16. Urquhart, A.: ‘Lattices with a dual homomorphic operation’, Studia Logica 38 (1979), 201–209.

    Article  MathSciNet  MATH  Google Scholar 

  17. Bonnecaze, A., Sole, P., and Calderbank, A.R.: ‘Quaternary construction of unimodular lattices’, IEEE Inform. Th. 41 (1995), 366–376.

    Article  MathSciNet  MATH  Google Scholar 

  18. Conway, J.H., and Sloane, N.J.A.: Sphere packings, lattices and groups, Springer, 1992.

    Google Scholar 

  19. Conway, J.H., and Sloane, N.J.A.: ‘Self-dual codes over the integers modulo 4’, J. Combin. Th. A 62 (1993), 31–45.

    MathSciNet  Google Scholar 

  20. Forney, G.D., Sloane, N.J.A., and Trott, M.D.: ‘The Nordstrom Robinson code is the binary image of the octacode’, in R. Calderbank, G.D. Forney Jr, and N. Moay-ERI (eds.): Coding and Quantization, Amer. Math. Soc, 1993, pp. 19–26.

    Google Scholar 

  21. Hammons, A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Sole, P.: ‘The Z4-linearity of Kerdock, Preparata, Goethals, and related codes’, IEEE Trans. Information Th. 40 (1994), 301–319.

    Article  MathSciNet  MATH  Google Scholar 

  22. Aschbacher, M.: ‘The subgroup structure of the finite classical groups by Peter Kleidman and Martin Liebeck’, Bull. Amer. Math. Soc. 25 (1991), 200–204.

    Article  MathSciNet  Google Scholar 

  23. Buekenhout, F.: ‘On a theorem of O’Nan and Scott’, Bull. Soc. Math. Belg. B 40 (1988), 1–9.

    MathSciNet  MATH  Google Scholar 

  24. Dixon, J.D., and Mortimer, B.: Permutation groups, GTM. Springer, 1996.

    Book  Google Scholar 

  25. Berge, C.: Graphs and hypergraphs, North-Holland, 1973. (Translated from the French.)

    MATH  Google Scholar 

  26. Bosák, J.: Decomposition of graphs, Kluwer Acad. Publ., 1990.

    Google Scholar 

  27. Cruse, A.B.: ‘A note on one-factors in certain regular multi-graphs’, Discrete Math. 18 (1977), 213–216.

    Article  MathSciNet  MATH  Google Scholar 

  28. Petersen, J.: ‘Die Theorie der regulären Graphes’, Acta Math. 15 (1981), 193–220.

    Article  Google Scholar 

  29. Schönberger, T.: ‘Ein Beweis des Peterschen Graphensatzes’, Acta Sci. Math. Szeged 7 (1934), 51–57.

    MATH  Google Scholar 

  30. Tutte, W.T.: ‘The factorizations of linear graphs’, J. London Math. Soc. 22 (1947), 459–474.

    Article  MathSciNet  Google Scholar 

  31. Wallis, W.D.: One-factorizations, Kluwer Acad. Publ., 1997.

    MATH  Google Scholar 

  32. Alspach, B., and George, J.C.: ‘One-factorization of tensor products of graphs’: Topics in Combinatorics and Graph Theory, Physica-Verlag, 1990, pp. 41–46.

    Google Scholar 

  33. Anderson, B.A.: ‘Finite topologies and Hamiltonian paths’, J. Combin. Th. 14B (1973), 87–93.

    Article  Google Scholar 

  34. Anderson, B.A.: ‘Symmetry groups of some perfect one-factorization of complete graphs’, Discrete Math. 18 (1977), 227–234.

    Article  MathSciNet  Google Scholar 

  35. Anderson, B.A., Barge, M.M., and Morse, D.: ‘A recursive construction of asymmetric 1-factorizations’, Aequationes Math. 15 (1977), 201–211.

    Article  MathSciNet  MATH  Google Scholar 

  36. Beecham, A.F., and Hurley, A.C.: ‘A scheduling problem with a simple graphical solution’, J. Australian Math. Soc. 21B (1980), 486–495.

    MathSciNet  Google Scholar 

  37. Bosak, J.: Decomposition of graphs, Kluwer Acad. Publ., 1990.

    Google Scholar 

  38. Chetwynd, A.G., and Hilton, A.J.W.: ‘Regular graphs of high degree are 1-factorizable’, Proc. London Math. Soc. (3) 50 (1985), 193–206.

    Article  MathSciNet  MATH  Google Scholar 

  39. Werra, D. de: ‘Scheduling in sports’: Studies on Graphs and Discrete Programming, North-Holland, 1981, pp. 381–395.

    Google Scholar 

  40. Werra, D. de: ‘On the multiplication of divisions: the use of graphs for sports scheduling’, Networks 15 (1985), 125–136.

    Article  MathSciNet  MATH  Google Scholar 

  41. Werra, D. de, Jacot-Descombes, L., and Masson, P.: ‘A constrained sports scheduling problem’, Discrete Applied Math. 26 (1990), 41–49.

    Article  MATH  Google Scholar 

  42. Dickson, L.E., and Safford, F.H.: ‘Solution to problem 8 (group theory)’, Amer. Math. Monthly 13 (1906), 150–151.

    Article  MathSciNet  Google Scholar 

  43. Dinitz, J.H., Garnick, D.K., and McKay, B.D.: ‘There are 526,915,620 non-isomorphic one-factorizations of K12’ J. Combin. Designs 2 (1994), 273–285.

    Article  MathSciNet  MATH  Google Scholar 

  44. Dinitz, J.H., and Stinson, D.R.: ‘A hill-climbing algorithm for the construction of one-factorizations and room squares’, SIAM J. Algebraic and Discrete Methods 8 (1987), 430–438.

    Article  MathSciNet  MATH  Google Scholar 

  45. Gelling, E.N.: ‘On one-factorizations of a complete graph and the relationship to round-robin schedules’, Ph.D. Thesis, Univ. Victoria, Canada (1973).

    Google Scholar 

  46. Gelling, E.N., and Odeh, R.E.: ‘On 1-factorizations of the complete graph and the relationship to round-robin schedules’, Congressus Numerantium 9 (1974), 213–221.

    MathSciNet  Google Scholar 

  47. Himelwright, P., Wallis, W.D., and Williamson, J.E.: ‘On one-factorizations of compositions of graphs’, J. Graph Th. 6 (1982), 75–80,

    Article  MathSciNet  MATH  Google Scholar 

  48. Himelwright, P., Wallis, W.D., and Williamson, J.E.: On one-factorizations of compositions of graphs Erratum: J. Graph Theory 8 (1984), 185–186.

    Article  MathSciNet  MATH  Google Scholar 

  49. Himelwright, P.E., and Williamson, J.E.: ‘On 1-factorability and edge-colorability of cartesian products of graphs’, Elemente der Math. 29 (1974), 66–67.

    MathSciNet  MATH  Google Scholar 

  50. Kotzig, A.: ‘1-factorizations of cartesian products of regular graphs’, J. Graph Th. 3 (1979), 23–34.

    Article  MathSciNet  MATH  Google Scholar 

  51. Lindner, C.C., Mendelsohn, E., and Rosa, A.: ‘On the number of 1-factorizations of the complete graph’, J. Combin. Th. 20A (1976), 265–282.

    Article  MathSciNet  Google Scholar 

  52. Lovász, L., and Plummer, M.D.: Matching theory, North-Holland, 1986.

    MATH  Google Scholar 

  53. Mendelsohn, E., and Rosa, A.: ‘One-factorizations of the complete graph — a survey’, J. Graph Th. 9 (1985), 43–65.

    Article  MathSciNet  MATH  Google Scholar 

  54. Parker, E.T.: ‘Edge-coloring numbers of some regular graphs’, Proc. Amer. Math. Soc. 37 (1973), 423–424.

    Article  MathSciNet  MATH  Google Scholar 

  55. Rosa, A., and Wallis, W.D.: ‘Premature sets of 1-factors, or, how not to schedule round-robin tournaments’, Discrete Applied Math. 4 (1982), 291–297.

    Article  MathSciNet  MATH  Google Scholar 

  56. Russell, K.G.: ‘Balancing carry-over effects in round robin tournaments’, Biometrika 67 (1988), 127–131.

    Article  Google Scholar 

  57. Straley, T.H.: ‘Scheduling designs for a league tournament’, Ars Combin. 15 (1983), 193–200.

    MathSciNet  MATH  Google Scholar 

  58. Wallis, W.D.: ‘One-factorizations of wreath products’: Combinatorial Mathematics VIII, Vol. 884 of Lecture Notes in Mathematics, Springer, 1981, pp. 337–345.

    Google Scholar 

  59. Wallis, W.D.: ‘A tournament problem’, J. Australian Math. Soc. 24B (1983), 289–291.

    MathSciNet  Google Scholar 

  60. Wallis, W.D.: ‘One-factorizations of complete graphs’: Contemporary Design Theory, Wiley, 1992, pp. 593–631.

    Google Scholar 

  61. Wallis, W.D.: One-factorizations, Kluwer Acad. Publ., 1997.

    MATH  Google Scholar 

  62. Wallis, W.D., and Wang, Z.: ‘On one-factorizations of cartesian products’, Congressus Numerantium 49 (1985), 237–245.

    MathSciNet  Google Scholar 

  63. Barnett, V., and Lewis, T.: Outliers in statistical data, third ed., Wiley, 1994.

    MATH  Google Scholar 

  64. Childs, A., and Balakrishnan, N.: ‘Relations for single moments of order statistics from non-identical logistic random variables and robust estimation of the location and scale parameters in the presence of multiple outliers’, in C.R. Rao and G.S. Maddala (eds.): Handbook of Statistics, Elsevier Sci., 1997.

    Google Scholar 

  65. Childs, A., and Balakrishnan, N.: ‘Some extensions in the robust estimation of parameters of exponential and double exponential distributions in the presence of multiple outliers’, in C.R. Rao and G.S. Maddala (eds.): Handbook of Statistics, Elsevier Sci., 1997.

    Google Scholar 

  66. David, H.A.: ‘Robust estimation in the presence of outliers’, in R.L. Launer and G.N. Wilkinson (eds.): Robustness in Statistics, Acad. Press, 1979, pp. 61–74.

    Google Scholar 

  67. David, H.A., and Shu, V.S.: ‘Robustness of location estimators in the presence of an outlier’, in H.A. David (ed.): Contributions to Survey Sampling and Applied Statistics: Papers in Honour of H.O. Hartley, Acad. Press, 1978, pp. 235–250.

    Google Scholar 

  68. Hawkins, D.M.: Identification of outliers, Chapman and Hall, 1980.

    MATH  Google Scholar 

Download references

Authors
  1. M. Hazewinkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Hazewinkel

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Kluwer Academic Publishers

About this chapter

Cite this chapter

Hazewinkel, M. (1997). O. In: Hazewinkel, M. (eds) Encyclopaedia of Mathematics. Encyclopaedia of Mathematics. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-1288-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-1288-6_15

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4896-7

  • Online ISBN: 978-94-015-1288-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation