Abstract
Shi tableaux are special binary fillings of certain Young diagrams which arise in the study of Shi hyperplane arrangements related to classical root systems. For type A, the set \(\mathcal {T}\) of Shi tableaux naturally coincides with the set of Dyck paths, for which various notions of patterns have been introduced and studied over the years. In this paper we define a notion of pattern occurrence in \(\mathcal {T}\) which, although it can be regarded as a pattern on Dyck paths, it is motivated by the underlying geometric structure of the tableaux. Our main goal in this work is to study the poset of Shi tableaux defined by pattern-containment. More precisely, we determine explicit formulas for upper and lower covers for each \(T\in \mathcal {T}\), we consider pattern avoidance for the smallest non-trivial tableaux (size 2) and generalize these results to certain tableau of larger size. We conclude with open problems and possible future directions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
No datasets were generated or analysed during the current study.
References
Albert, M., Homberger, C., Pantone, J., Shar, N., Vatter, V.: Generating permutations with restricted containers. J. Combin. Theory Ser. A 157, 205–232 (2018)
Andrews, G., Krattenthaler, C., Orsina, L., Papi, P.: ad-nilpotent \(\mathfrak {b}\)-ideals in sl(n) having fixed class of nilpotence: combinatorics and enumeration. Trans. Amer. Math. Soc. 354(10), 3835–3853 (2002)
Armstrong, D.: Hyperplane arrangements and diagonal harmonics. J. Comb. 4(2), 157–190 (2002)
Bacher, A., Bernini, A., Ferrari, L., Gunby, B., Pinzani, R., West, J.: The Dyck pattern poset. Discrete Math. 321, 12–23 (2014)
Bernini, A., Cervetti, M., Ferrari, L., Steingrimsson, E.: Enumerative combinatorics of intervals in the Dyck pattern poset. Order. https://doi.org/10.1007/s11083-021-09552-9 (2020)
Bernini, A., Ferrari, L., Pinzani, R., West, J.: Pattern-avoiding Dyck paths. Discrete Math. Theor. Comput. Sci. Proc., vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (2013)
Bóna, M.: Combinatorics of Permutations. Discrete Mathematics and Its Applications, 2nd edn. Chapman & Hall/CRC, London (2004)
de Bruijn, N.G., Knuth, D.E., Rise, S.O.: The average height of planted plane trees. Graph Theory Comput., 15–22 (1972)
Fishel, S., Vazirani, M., Tzanaki, E.: Counting shi regions with a fixed separating wall. Ann. Combin. 17(4), 671–693 (2013)
Garsia, A.M., Haglund, J.: A proof of the q,t-catalan positivity conjecture. Discrete Math. 256, 677–717 (2002)
Haglund, J.: The q,t-catalan numbers and the space of diagonal harmonics. Univ. Lecture Ser. 41, 319–334 (2008)
Haglund, J.: Conjectured statistics for the q,t-catalan numbers. Adv. Math. 175, 319–334 (2013)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. 2(3), 326–336 (1952)
Karim, M.E., Parida, L., Lakhotia, A.: Using permutation patterns for content-based phylogeny. Pattern Recognit. Bioinform., 115–125 (2006)
Kitaev, S.: Patterns in Permutations and Words. Monographs in Theoretical Computer Science. Springer, Berlin (2011)
Knuth, D.E.: The Art of Computer Programming, I: Fundamental algorithms. Addison-Wesley Publishing Co., Reading (1969)
Krattenthaler, C.: Lattice Path Enumeration. Handbook of Enumerative Combinatorics, Chapter 10. CRC Press, Boca Raton (2015)
Krattenthaler, C., Orsina, L., Papi, P.: Enumeration of ad-nilpotent \(\mathfrak {b}\)-ideals for simple Lie algebras. Adv. Appl. Math. 28, 478–522 (2002)
Lackner, M.-L., Lackner, M.: On the likelihood of single-peaked preferences. Soc. Choice Welf. 48(4), 717–745 (2017)
Mohanty, S.G.: Lattice Path Counting and Applications. Probability and Mathematical Statistics. Academic Press, New York (1979)
Shi, J.-Y.: Alcoves corresponding to an affive Weyl group. J. London Math. Soc. 35, 42–55 (1987)
Simion, R., Schmidt, F.W.: Restricted permutations. European J. Combin. 6(4), 383–406 (1985)
Sloane, N.J.A.: The on-line encyclopedia of integer sequences. http://oeis.org (2017)
Spielman, D.A., Bóna, M.: An infinite antichain of permutations. Electron. J. Combin 7, # N2 (2000)
Spiridonov, A.: Pattern-avoidance in binary fillings of grid shapes. Discrete Math. Theor. Comput. Sci. Proc., 677–690 (2008)
Stanley, R.P.: Hyperplane arrangements, interval orders, and trees. Proc. Nat. Acad. Sci. U.S.A. 93(6), 2620–2625 (1996)
Stanley, R. P.: An introduction to hyperplane arrangements. In: Lecture Notes, Ias/Park City Mathematics Institute (2004)
Stanley, R.P.: Enumerative Combinatorics: Volume 1, 2nd edn. Cambridge University Press, New York (2011)
Acknowledgements
We would like to thank the anonymous referees for their careful reading and valuable comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kallipoliti, M., Sulzgruber, R. & Tzanaki, E. Patterns in Shi Tableaux and Dyck Paths. Order 39, 263–289 (2022). https://doi.org/10.1007/s11083-021-09573-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-021-09573-4