45
Views
0
CrossRef citations to date
0
Altmetric
Articles

Counting subwords in flattened involutions and Kummer functions

&
Pages 1404-1425 | Received 21 May 2015, Accepted 05 Jun 2016, Published online: 23 Jun 2016

References

  • M. Abramowitz and I.A. Stegun, Handbook of Mathematical Functions, Applied Mathematics Series Vol. 55, National Bureau of Standards, Washington, DC, 1972.
  • A.T. Benjamin and J.J. Quinn, Proofs that Really Count: The Art of Combinatorial Proof, Mathematical Association of America, Washington, DC, 2003.
  • D. Callan, Pattern avoidance in ‘flattened’ partitions, Discrete Math. 309 (2009), pp. 4187–4191.
  • L. Carlitz, Generalized Stirling numbers, Combinatorial Analysis Notes, Duke University, Durham, NC, 1968, pp. 1–7.
  • W.M.B. Dukes, Permutation statistics on involutions, European. J. Combin. 28(1) (2007), pp. 186–198.
  • O. Guibert and T. Mansour, Some statistics on restricted 132-involutions, Ann. Comb. 6 (2002), pp. 349–374.
  • S. Heubach and T. Mansour, Combinatorics of Compositions and Words, CRC Press, Boca Raton, FL, 2009.
  • Q. Hou and T. Mansour, Kernel method and linear recurrence system, J. Comput. Appl. Math. 216(1) (2008), pp. 227–242.
  • A.D. Jaggard, Prefix exchanging and pattern avoidance for involutions, Electron. J. Combin. 9(2) (2003), #R16.
  • S. Kitaev, Patterns in Permutations and Words, Springer-Verlag, Heidelberg, 2011.
  • T. Mansour, Combinatorics of Set Partitions, CRC Press, Boca Raton, FL, 2012.
  • T. Mansour and M. Shattuck, Pattern avoidance in flattened permutations, Pure Math. Appl. (PU.M.A.) 22(1) (2011), pp. 75–86.
  • T. Mansour, M. Shattuck, and S. Wagner, Counting subwords in flattened partitions of sets, Discrete Math. 339(4) (2016), pp. 1368–1376.
  • T. Mansour, M. Shattuck, and S.H.F. Yan, Counting subwords in a partition of a set, Electron. J. Combin. 17 (2010), #R19.
  • T. Mansour and A. Vainshtein, Restricted permutations, continued fractions, and Chebyshev polynomials, Electron. J. Combin. 7 (2000), #R17.
  • T. Rivlin, Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory, John Wiley, New York, 1990.
  • M. Shattuck, Parity theorems for statistics on permutations and Catalan words, Integers 5 (2005), #A07.
  • R.P. Stanley, Differentiably finite power series, European. J. Combin. 1 (1980), pp. 175–188.
  • H. Wilf, generatingfunctionology, 3rd ed., CRC Press, Boca Raton, FL, 2005.
  • S. Wolfram, The Mathematica Book, 5th ed., Wolfram Media, Champaign, IL, 2003.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.