Tight lower bound for pattern avoidance and symmetric functions

DOI10.1007/S11856-025-2783-5MaRDI QIDQ6885431zbMATH OpenFDO

Authors Avichai Marmor

Publication date 11 December 2025

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11856-025-2783-5

zbMATH Keywords

pattern avoidancequasisymmetric functionSchur functionshuffle

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05)

Cites work

• A combinatorial problem in geometry.
• A Note on Fisher's Inequality for Balanced Incomplete Block Designs
• Arc permutations
• Combinatory analysis. Vol. 2.
• Counting permutations with given cycle structure and descent set
• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• scientific article; zbMATH DE number 3895079 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Matrices, characters and descents
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• On t-designs
• Pattern avoidance and quasisymmetric functions
• Revisiting pattern avoidance and quasisymmetric functions
• The CRC handbook of combinatorial designs

This page was built for publication: Tight lower bound for pattern avoidance and symmetric functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885431)