Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 2014: LATIN 2014: Theoretical Informatics pp 490–501Cite as

Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences

  • Conference paper

  • 1151 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8392))

Abstract

We consider a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey–Wilson polynomials; however, their purely combinatorial properties have gained considerable interest in the past few years.

We will be interested in a general model of staircase tableaux in which symbols that appear in staircase tableaux may have arbitrary positive weights. Under this general model we derive a number of results concerning the limiting laws for the number of appearances of symbols in a random staircase tableaux.

One advantage of our generality is that we may let the weights approach extreme values of zero or infinity, which covers further special cases appearing earlier in the literature.

One of the main tools we use are generating functions of the parameters of interests. This leads us to a two–parameter family of polynomials. Specific values of the parameters cover a number of special cases analyzed earlier in the literature including the classical Eulerian polynomials.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aval, J.-C., Boussicault, A., Nadeau, P.: Tree-like tableaux. In: 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011). Discrete Math. Theor. Comput. Sci. Proc., AO, pp. 63–74 (2011)

    Google Scholar 

  2. Carlitz, L., Scoville, R.: Generalized Eulerian numbers: combinatorial applications. J. Reine Angew. Math. 265, 110–137 (1974)

    MATH  MathSciNet  Google Scholar 

  3. Corteel, S., Dasse-Hartaut, S.: Statistics on staircase tableaux, Eulerian and Mahonian statistics. In: 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011), Discrete Math. Theor. Comput. Sci. Proc., AO, pp. 245–255 (2011)

    Google Scholar 

  4. Corteel, S., Hitczenko, P.: Expected values of statistics on permutation tableaux. In: 2007 Conference on Analysis of Algorithms, AofA 2007, Discrete Math. Theor. Comput. Sci. Proc., AH, pp. 325–339 (2007)

    Google Scholar 

  5. Corteel, S., Stanley, R., Stanton, D., Williams, L.: Formulae for Askey–Wilson moments and enumeration of staircase tableaux. Trans. Amer. Math. Soc. 364(11), 6009–6037 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  6. Corteel, S., Williams, L.K.: A Markov chain on permutations which projects to the PASEP. Int. Math. Res. Notes, Article 17:rnm055, 27pp (2007)

    Google Scholar 

  7. Corteel, S., Williams, L.K.: Tableaux combinatorics for the asymmetric exclusion process. Adv. Appl. Math. 39, 293–310 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Corteel, S., Williams, L.K.: Staircase tableaux, the asymmetric exclusion process, and Askey–Wilson polynomials. Proc. Natl. Acad. Sci. 107(15), 6726–6730 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  9. Corteel, S., Williams, L.K.: Tableaux combinatorics for the asymmetric exclusion process and Askey–Wilson polynomials. Duke Math. J. 159, 385–415 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dasse-Hartaut, S., Hitczenko, P.: Greek letters in random staircase tableaux. Random Struct. Algorithms 42, 73–96 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Derrida, B., Evans, M.R., Hakim, V., Pasquier, V.: Exact solution of a 1D asymmetric exclusion model using a matrix formulation. J. Phys. A 26(7), 1493–1517 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Franssens, G.R.: On a number pyramid related to the binomial, Deleham, Eulerian, MacMahon and Stirling number triangles. J. Integer Seq. 9(4):Article 06.4.1, 34 (2006)

    Google Scholar 

  13. Frobenius, G.: Über die Bernoullischen Zahlen und die Eulerschen Polynome. Sitzungsberichte der Königlich Preussischen Akademie der Wissenschaften, Berlin, pp. 809–847 (1910)

    Google Scholar 

  14. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  15. Hitczenko, P., Janson, S.: Asymptotic normality of statistics on permutation tableaux. Contemporary Math. 520, 83–104 (2010)

    Article  MathSciNet  Google Scholar 

  16. Hitczenko, P., Janson, S.: Weighted random staircase tableaux. To appear in Combin. Probab. Comput., arxiv.org/abs/1212.5498

    Google Scholar 

  17. Janson, S.: Euler–Frobenius numbers and rounding. arxiv.org/abs/1305.3512

    Google Scholar 

  18. Liu, L.L., Wang, Y.: A unified approach to polynomial sequences with only real zeros. Adv. Appl. Math. 38(4), 542–560 (2007)

    Article  MATH  Google Scholar 

  19. MacMahon, P.A.: The divisors of numbers. Proc. London Math. Soc. Ser. 2 19(1), 305–340 (1920)

    MATH  Google Scholar 

  20. Nadeau, P.: The structure of alternative tableaux. J. Combin. Theory Ser. A 118(5), 1638–1660 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  21. NIST Digital Library of Mathematical Functions, http://dlmf.nist.gov/

  22. The On-Line Encyclopedia of Integer Sequences, http://oeis.org

  23. Petrov, V.V.: Sums of Independent Random Variables. Springer, Berlin (1975)

    Book  Google Scholar 

  24. Stanley, R.P.: Enumerative Combinatorics, vol. I. Cambridge Univ. Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  25. Wang, Y., Yeh, Y.-N.: Polynomials with real zeros and Pólya frequency sequences. J. Combin. Theory Ser. A 109(1), 63–74 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Drexel University, Philadelphia, PA, USA, 19104

    Paweł Hitczenko

  2. Department of Mathematics, Uppsala University, Uppsala, Sweden

    Svante Janson

Authors
  1. Paweł Hitczenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Svante Janson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Facultad de Ingeniería, Instituto de Computación, Universidad de la República, Julio Herrera y Reissig 565, 11300, Montevideo, Uruguay

    Alberto Pardo  & Alfredo Viola  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hitczenko, P., Janson, S. (2014). Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences. In: Pardo, A., Viola, A. (eds) LATIN 2014: Theoretical Informatics. LATIN 2014. Lecture Notes in Computer Science, vol 8392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54423-1_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54422-4

  • Online ISBN: 978-3-642-54423-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation