Skip to main content
SpringerLink
Log in

The Applications of Total Positivity to Combinatorics, and Conversely

  • Chapter
Book cover Total Positivity and Its Applications

Part of the book series: Mathematics and Its Applications ((MAIA,volume 359))

Abstract

Total positivity arises often in various branches of mathematics, statistics, probability, mechanics, economics, and computer science (see, e.g., [24], and the references cited there). In this paper we give a survey of the interactions between total positivity and combinatorics.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. J. C. Ahuja and E. A. Enneking, Concavity property and a recurrence relation for associated Lah numbers, Fibonacci Quart., 17 (1979), 158–161.

    MathSciNet  MATH  Google Scholar 

  2. M. Aissen, I. J. Schoenberg, and A. M. Whitney, On the generating function of totally positive sequences, I, J. d’Anal. Math, 2 (1952), 93–103.

    Article  MathSciNet  MATH  Google Scholar 

  3. T. Ando, Totally positive matrices, Linear Algebra Appl., 90 (1987), 165–219.

    Article  MathSciNet  MATH  Google Scholar 

  4. F. Brenti, Query 389,Notices Amer. Math. Soc., 35 (1988), 315.

    Google Scholar 

  5. F. Brenti, Unimodal, log-concave, and Pólya Frequency sequences in Combinatorics, Memoirs Amer. Math. Soc., no. 413 (1989).

    Google Scholar 

  6. F. Brenti, Log-concavity and combinatorial properties of Fibonacci Lattices, Europ. J. Combinatorics, 12 (1991), 459–476.

    MathSciNet  MATH  Google Scholar 

  7. F. Brenti,Expansions of chromatic polynomials and log-concavity, Trans. Amer. Math. Soc., 332 (1992), 729–756 .

    Article  MathSciNet  MATH  Google Scholar 

  8. F. Brenti, Permutation enumeration, symmetric functions, and unimodality, Pacific J. Math., 157 (1993), 1–28.

    Article  MathSciNet  MATH  Google Scholar 

  9. F. Brenti, Determinants of super-Schur functions, lattice paths, and dotted plane partitions, Adv. in Math., 98(1993), 27–64.

    Article  MathSciNet  MATH  Google Scholar 

  10. F. Brenti, G. F. Royle, and D. G. Wagner, Location of zeros of chromatic and related polynomials of graphs, Canadian J. Math., 46 (1994), 55–80.

    Article  MathSciNet  MATH  Google Scholar 

  11. F. Brenti, q-Eulerian polynomials arising from Coxeter groups, Europ. J. Combinatorics, 15 (1994), 417–441f.

    Article  MathSciNet  MATH  Google Scholar 

  12. F. Brenti, Log-concave and unimodal sequences in Algebra, Combinatorics and Geometry: an update, Contemporary Math., 178 (1994), 71- 89.

    Article  MathSciNet  Google Scholar 

  13. F. Brenti, Combinatorics and total positivity, J. Combin. Theory Ser. A, 175–218.

    Google Scholar 

  14. L. Carlitz, Note on the numbers of Jordan and Ward, Duke Math. J. 38 (1971), 783–790.

    Article  MathSciNet  MATH  Google Scholar 

  15. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht/Boston, 1974.

    Book  MATH  Google Scholar 

  16. A. Edrei, On the generating function of totally positive sequences, II, J. d’Anal. Math, 2 (1952), 104–109.

    Article  MathSciNet  MATH  Google Scholar 

  17. A. Edrei, Proof of a conjecture of Schoenberg on the generating function of a totally positive sequence, Canadian J. Math., 5 (1953), 86–94.

    Article  MathSciNet  MATH  Google Scholar 

  18. I. Gessel and G. Viennot, Binomial determinants, paths, and hook length formulae, Adv. in Math., 58 (1985), 300–321.

    Article  MathSciNet  MATH  Google Scholar 

  19. I. Gessel and G. Viennot, Determinants, paths, and plane partitions, preprint.

    Google Scholar 

  20. H. W. Gould, The q-Stirling numbers of the first and second kinds, Duke Math. J., 28 (1961), 281–289.

    Article  MathSciNet  MATH  Google Scholar 

  21. K. I. Gross and D. St. P. Richards, Total positivity, finite reflection groups, and a formula of Harish-Chandra, J. Approximation Theory, to appear.

    Google Scholar 

  22. J. E. Humphreys, Reflection Groups and Coxeter Groups, Cambridge Studies in Advanced Mathematics, no.29, Cambridge Univ. Press, Cambridge, 1990.

    Book  MATH  Google Scholar 

  23. S. Karlin and G. McGregor, Coincidence probabilities, Pacific J. Math., 9 (1959), 1141–1164.

    Article  MathSciNet  MATH  Google Scholar 

  24. S. Karlin, Total Positivity, vol.1, Stanford University Press, 1968.

    MATH  Google Scholar 

  25. D. Knuth and J. Szwarcfiter, Astructured program to generate all topological sorting arrangements, Inform. Process. Lett., 2 (1974), 153–157.

    Article  MATH  Google Scholar 

  26. A. Kalvin and Y. Varol, On the generation of all topological sortings, J. Algorithms, 4 (1983), 150–162.

    Article  MathSciNet  MATH  Google Scholar 

  27. P. Leroux, Reduced matrices and q-log concavity properties of q-Stirling numbers, J. Combin. Theory Ser. A, 54 (1990), 64–84.

    Article  MathSciNet  MATH  Google Scholar 

  28. B. Lindström, On the vector representations of induced matroids, Bull. London Math. Soc., 5 (1973), 85–90.

    Article  MathSciNet  MATH  Google Scholar 

  29. G. Lusztig, Total positivity in reductive groups, Institut Mittag-Leffler report no. 5, 1993–94.

    Google Scholar 

  30. I. G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford University Press, New York/London, 1979.

    MATH  Google Scholar 

  31. J. Neggers, Representations of finite partially ordered sets, J. Combin. Inform. System Sci., 3 (1978), 113–133.

    MathSciNet  MATH  Google Scholar 

  32. R. C. Read and W. T. Tutte, Chromatic polynomials, in Selected Topics in Graph Theory 3 (Beineke and Wilson, editors), Academic Press, New York, 1988.

    Google Scholar 

  33. V. Reiner, Quotients of Coxeter complexes and P-partitions, Memoirs Amer. Math. Soc., no. 460 (1992).

    Google Scholar 

  34. V. Reiner, Signed permutations statistics, Europ. J. Combinatorics, 14 (1993), 553–67.

    Article  MathSciNet  MATH  Google Scholar 

  35. V. Reiner, Signed permutation statistics and cycle type, Europ. J. Combinatorics, 14 (1993), 569–79.

    Article  MathSciNet  MATH  Google Scholar 

  36. B. E. Sagan, Log concave sequences of symmetric functions and analogs of the Yacobi-Trudi determinants, Trans. Amer. Math. Soc., 329 (1992), 795–812.

    Article  MathSciNet  MATH  Google Scholar 

  37. B. E. Sagan, Amaj statistic for set partitions, Europ. J. Combinatorics, 12 (1991), 69–79.

    MathSciNet  MATH  Google Scholar 

  38. B. E. Sagan, The Symmetric Group, Wadsworth and Brooks/Cole, Pacific Grove, CA, 1991.

    MATH  Google Scholar 

  39. I. J. Schoenberg, Some analytical aspects of the problem of smoothing, Courant Anniversary Volume, New York, 1948.

    Google Scholar 

  40. R. P. Stanley, Ordered structures and partitions, Memoirs Amer. Math. Soc., no. 119 (1972).

    Google Scholar 

  41. R. P. Stanley, Enumerative Combinatorics, vol.1, Wadsworth and Brooks/Cole, Monterey, CA, 1986.

    MATH  Google Scholar 

  42. R. P. Stanley, Log-concave and unimodal sequences in Algebra, Combinatorics and Geometry, Annals of the New York Academy of Sciences, 576 (1989), 500–534.

    Article  MathSciNet  Google Scholar 

  43. R. P. Stanley, Graph colorings and related symmetric functions: ideas and applications, preprint.

    Google Scholar 

  44. J. R. Stembridge, Non-intersecting paths, pfaffians and plane partitions, Adv. in Math., 83 (1990), 96–131.

    Article  MathSciNet  MATH  Google Scholar 

  45. J. R. Stembridge, Immanants of totally positive matrices are nonnegative, Bull. London Math. Soc., 23 (1991), 422–428.

    Article  MathSciNet  MATH  Google Scholar 

  46. J. R. Stembridge, personal communication, April 1991.

    Google Scholar 

  47. J. R. Stembridge, Some conjectures for immanants, Canad. J. Math., 44 (1992), 1079–1099.

    Article  MathSciNet  MATH  Google Scholar 

  48. J. R. Stembridge, A Maple package for posets, preprint.

    Google Scholar 

  49. E. Thoma, Die unzerlegbaren, positiv-definiten Klassenfunktionen der abzählbar unendlichen symmetrischen Gruppe, Math. Zeit., 85 (1964), 40–61.

    Article  MathSciNet  MATH  Google Scholar 

  50. M. Wachs and D. White, q-Stirling numbers and set partition statistics, J. Combin. Theory Ser. A, 56 (1991), 27–46.

    Article  MathSciNet  MATH  Google Scholar 

  51. D. G. Wagner, The partition polynomial of a finite set system, J. Combin. Theory Ser. A, 56 (1991), 138–159.

    Article  MathSciNet  MATH  Google Scholar 

  52. D. G. Wagner, Enumerative combinatorics of partially ordered sets, and total positivity of Hadamard products, Ph.D. Thesis, Massachusetts Institute of Technology, 1989.

    Google Scholar 

  53. D. G. Wagner, Total positivity of Hadamard products, J. Math. Analysis and Appl., 163 (1992), 459–483.

    Article  MATH  Google Scholar 

  54. D. G. Wagner, Enumeration of functions from posets to chains, Europ. J. Combinatorics, 13 (1992), 313–324.

    Article  MATH  Google Scholar 

  55. D. G. Wagner, Zeros of rank-generating functions of Cohen-Macaulay complexes, Proceedings of Fourth Formal Power Series and Algebraic Combinatorics Conference, Montreal, 1992, Discrete Math., to appear.

    Google Scholar 

  56. D. West, Generating linear extensions by adjacent transpositions, J. Combin. Theory Ser. B, 58 (1993), 58–64.

    Article  MathSciNet  MATH  Google Scholar 

  57. T. Zaslavsky, Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes, Memoirs Amer. Math. Soc., 154 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Institute for Advanced Study, Princeton, NJ, 08540, USA

    Francesco Brenti

Authors
  1. Francesco Brenti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, University of Zaragoza, Zaragoza, Spain

    Mariano Gasca

  2. IBM, T.J. Watson Research Center, Yorktown Heights, New York, USA

    Charles A. Micchelli

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Brenti, F. (1996). The Applications of Total Positivity to Combinatorics, and Conversely. In: Gasca, M., Micchelli, C.A. (eds) Total Positivity and Its Applications. Mathematics and Its Applications, vol 359. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8674-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-8674-0_22

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-4667-3

  • Online ISBN: 978-94-015-8674-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation