Have a personal or library account? Click to login

Pattern avoidance in inversion sequences

Pure Mathematics and Applications
Volume 25 (2015): Issue 2 (December 2015)
By:
Open Access
|Jun 2016

References

  1. [1] A. Burstein, Enumeration of Words with Forbidden Patterns, Ph.D. thesis, University of Pennsylvania, 1998.
    Search in Google Scholar
  2. [2] D. Callan, Pattern avoidance in „flattened” partitions, Discrete Math., 309 (2009) 4187-4191.
    Search in Google Scholar
  3. [3] W. Y. C. Chen, A. J. X. Guo, P. L. Guo, H. H. Y. Huang and T. Y. H. Liu, s-inversion sequences and P-partitions of type B, at http://arxiv.org/abs/1310.5313.
    Search in Google Scholar
  4. [4] Q. H. Hou and T. Mansour, Kernel method and systems of functional equations with several conditions, J. Comput. Appl. Math., 235 (2011) 1205-1212.
    Search in Google Scholar
  5. [5] S. Kitaev, Patterns in Permutations and Words, Springer, 201110.1007/978-3-642-17333-2
    Search in Google Scholar
  6. [6] D. E. Knuth, The Art of Computer Programming, Volumes 1 and 3, Addison-Wesley, Reading, MA 1968, 1973.
    Search in Google Scholar
  7. [7] T. Mansour, Restricted 132-avoiding k-ary words, Chebyshev polynomials, and continued fractions, Adv. in Appl. Math., 36 (2006) 175-193.10.1016/j.aam.2005.04.003
    Search in Google Scholar
  8. [8] T. Mansour and M. Shattuck, Pattern avoidance in flattened permutations, Pure Math. Appl. (PU.M.A.), 22 (2011) 75-86.
    Search in Google Scholar
  9. [9] C. D. Savage and M. J. Schuster, Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences, J. Combin. Theory Ser. A, 119 (2012) 850-870.10.1016/j.jcta.2011.12.005
    Search in Google Scholar
  10. [10] R. Simion and F. W. Schmidt, Restricted permutations, European J. Combin., 6 (1985) 383-406.10.1016/S0195-6698(85)80052-4
    Search in Google Scholar
  11. [11] N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, at http://oeis.org, 2010.
    Search in Google Scholar
  12. [12] R. P. Stanley, Enumerative Combinatorics, Vol. I, Cambridge University Press, 1997.10.1017/CBO9780511805967
    Search in Google Scholar
  13. [13] D. Zeilberger, Enumeration schemes, and more importantly, their automatic generation, Ann. Comb., 2 (1998) 185-195.10.1007/BF01608488
    Search in Google Scholar
DOI: https://doi.org/10.1515/puma-2015-0016 | Journal eISSN: 1788-800X
Journal RSS Feed
Language: English
Page range: 157 - 176
Submitted on: Feb 8, 2015
Published on: Jun 24, 2016
Published by: Corvinus University of Budapest
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
pattern avoidance,
permutation,
inversion sequence,
kernel method
Related subjects:
Computer sciences,
Theoretical computer sciences,
Business and economics,
Mathematics and statistics for economists,
Mathematics,
Mathematics,
Analysis,
Differential equations and dynamical systems

© 2016 Toufik Mansour, Mark Shattuck, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous articleVolume 25 (2015): Issue 2 (December 2015)