Symmetrically Avoided Sets in Combinatorics

• Symmetrically avoided sets are collections of combinatorial patterns whose avoidance classes exhibit symmetric quasisymmetric generating functions and often Schur-positivity.
• Classification results show that only monotone patterns and select inverse-descent classes yield symmetric avoidance, imposing sharp size bounds.
• Extensions to matrices, words, and tilings illustrate profound links between combinatorial pattern avoidance, algebraic combinatorics, and representation theory.

A symmetrically avoided set is a collection of combinatorial patterns—or, more generally, objects such as permutations or set-systems—whose associated avoidance classes exhibit a robust symmetry property. In the context of permutations, a set of patterns $\Pi$ is symmetrically avoided if, for all $n$, the set of permutations in $S_n$ avoiding all patterns in $\Pi$ has a quasisymmetric generating function that is symmetric in the sense of Gessel, and often Schur-positive. This notion has powerful connections to algebraic combinatorics, extremal set theory, the geometry of lattice path and matrix models, and the representation theory of symmetric groups via the Robinson–Schensted correspondence. The theory further extends to binary words, $(0,1)$-matrices, and combinatorial or geometric set-systems, all unified by the theme of symmetry under combinatorial operations or group actions.

1. Key Definitions and Formalism

Given a finite pattern set $\Pi \subseteq S_k$, the avoidance set in $S_n$ is $$\operatorname{Av}_n(\Pi) = \{ \sigma \in S_n : \sigma \text{ avoids every pattern in } \Pi \}$$. For such a class, the descent set $\mathrm{Des}(\sigma) \subseteq \{1,\ldots,n-1\}$ is the set of positions where a descent occurs. The fundamental quasisymmetric function $F_{n,S}$ associated to $\mathrm{Des}(\sigma)$ encodes the distribution of descents.

The quasisymmetric generating function for any $S \subseteq S_n$ is

$Q(S) = \sum_{w \in S} F_{n, \mathrm{Des}(w)},$

where $F_{n, S}$ is Gessel’s fundamental quasisymmetric function. $S$ is called symmetric if $Q(S)$ is a symmetric function and Schur-positive if its expansion in the Schur basis has nonnegative coefficients. The set $\Pi$ is symmetrically avoided (respectively, Schur-positively avoided) if $\operatorname{Av}_n(\Pi)$ is symmetric (respectively, Schur-positive) for all $n$ (Marmor, 2022, Le, 12 Jan 2026).

2. Structural Classification in the Permutation Case

The main research advances, notably by Bloom–Sagan, Marmor, and subsequent authors, have led to a classification of symmetrically avoided sets within the symmetric group:

• Singletons: Only the increasing and decreasing $k$-letter patterns ($\{12\cdots k\}$ or $\{k\cdots 21\}$) are symmetrically avoided as singletons for all $n$.
• Pairs: For $k \geq 4$, the only symmetric avoidance for $|\Pi|=2$ occurs for $\{12\cdots k, k\cdots 21\}$.
• Size bounds: For $k\ge4$, a nontrivial pattern set $\Pi \subseteq S_k$ (i.e., not monotone) is symmetrically avoided only if $|\Pi| \geq k-1$, and this bound is sharp (Marmor, 2022).
• Extremal examples: The minimal nontrivial symmetrically avoided sets are inverse-descent classes of size $k-1$, $D_{\{k-1\}}^{-1}$—permutations with inverse descent set $\{k-1\}$—which are pattern-Knuth closed and thus yield symmetric and Schur-positive avoidance classes (Marmor, 2022, Le, 12 Jan 2026).

A comprehensive theorem for $|\Pi| \leq k-1$ states that $\Pi$ is symmetrically avoided if and only if it is either a partial shuffle, its complement, or a subset of the two monotone patterns, with explicit combinatorial descriptions for partial shuffles (Le, 12 Jan 2026).

3. Proof Techniques and Extremal Set Theory

The step from avoidance symmetry to extremal combinatorics is articulated through the concept of harmonic set systems (also called descent-uniformity systems). The crucial argument is:

• Symmetry of $Q(S)$ imposes tight uniformity conditions on the fiber sizes of set-systems $$A_i := \{\sigma \in S : i \not\in \mathrm{Des}(\sigma)\}$$.
• The classification problem reduces to analyzing $k$-uniform, multi-intersecting families of subsets with specific intersection properties.
• A new extremal bound, generalized from Bose’s theorem, establishes that, unless $S$ includes monotone elements, the family size cannot exceed $n-1$; otherwise, harmonicity is lost and symmetry fails (Marmor, 2022).
• This is resolved using multilinear polynomial methods, linking algebraic and combinatorial constraints.

4. Enumerative and Algebraic Consequences

The structure of symmetrically avoided sets has implications for quasisymmetric generating functions and their Schur expansions:

• For extremal inverse-descent class examples, the generating function expands as a nonnegative integer combination of Schur functions, where coefficients are determined by the hook-content formula associated with irreducible characters of $S_k$ (Marmor, 2022).
• For small cardinality cases, explicit combinatorial and algebraic descriptions are available, and in all cases with $|S| \leq n-1$, symmetry implies Schur-positivity (Le, 12 Jan 2026).
• Large symmetric sets, avoiding both monotones, are constructed from unions of Knuth-equivalence classes of standard tableaux, with the gap structure in possible cardinalities fully determined for large $n$ (Le, 12 Jan 2026).

5. Extensions to Matrices, Words, and Set-Systems

The notion of symmetrically avoided sets extends beyond permutations:

• Matrices: For $(0,1)$-matrices avoiding identity submatrices ($I_k$-avoiding), maximal structures biject with plane partitions, and the symmetry classes under dihedral group actions induce product-form enumerations parallel to classical results in symmetric function theory (Eu et al., 30 Oct 2025).
• Words: In the context of binary words, “symmetrical” avoidance refers to simultaneously avoiding patterns such as squares, antisquares (of the form $x\overline{x}$), permuted squares, and general morphic squares $x h(x)$. Infinite words can be constructed to avoid all sufficiently long symmetric patterns via suitably uniform morphisms (Ng et al., 2019).
• Set-systems and geometric tilings: The rigorous theory for symmetric separated set-systems, based on involutive operations $X^*$ and Bruhat orders of type C, provides a geometric and combinatorial classification of maximal symmetrically avoided families via rhombus tilings, cubillages, and central/double flips, with a unique minimal and maximal element for each symmetry class (Danilov et al., 2021).

6. Geometric and Combinatorial Dynamics

Symmetric avoidance properties are reflected in the dynamic structure of the corresponding combinatorial objects:

• The family of symmetrically avoided set-systems forms a connected poset under symmetric flip operations (such as double hexagonal flips for strong separation in set families, or symmetric lens flips for weak separation).
• For matrices and zonotopal tilings, the symmetry corresponds to geometric involutions (e.g., reflection across the zonogon’s middle line) and to invariant spectrum under group actions.
• In all cases, extremal and intermediate structures can be transformed into each other by sequences of symmetry-preserving local moves, providing both an enumerative and algorithmic framework (Eu et al., 30 Oct 2025, Danilov et al., 2021).

7. Connections to Representation Theory and Open Problems

Symmetrically avoided sets interface with the deep structure of symmetric functions and the representation theory of symmetric groups:

• The connection to Knuth classes, standard Young tableaux, and the Robinson–Schensted–Knuth correspondence is foundational, with symmetry and Schur-positivity of generating functions directly linked to the structure of Young tableaux and the characters of $S_n$ (Marmor, 2022, Bloom et al., 2018).
• Open problems include extending the classification of higher-cardinality or compound Knuth-class avoidance sets, understanding further generalizations to more elaborate pattern-classes, and exploring connections to geometric models such as higher Bruhat orders and zonotopal tilings (Le, 12 Jan 2026, Danilov et al., 2021, Hamaker et al., 2018).

In summary, symmetrically avoided sets constitute a rich and highly structured class of pattern-avoidance problems unified by the presence of nontrivial symmetry at the level of generating functions or associated combinatorial/geometric realizations. Their classification, structure, and enumeration reveal deep algebraic and geometric phenomena underlying modern algebraic combinatorics.