Poc-Sets and Dual Graphs in Combinatorial Algebra

• Poc-sets and dual graphs are finite structures where composition posets are organized via specific algebraic operators and partial orders.
• They employ four operator families, including box-removing and box-adding operators, derived from Pieri rules to build graded and filtered graph frameworks.
• Dual graded graphs emerge when up and down operators satisfy precise commutation relations, ensuring a robust duality that underpins combinatorial and algebraic symmetry.

A poc-set (partially ordered composition set) is a finite set of compositions of positive integers equipped with a partial order, typically constructed from algebraic or combinatorial operations such as those arising from the Pieri rules of noncommutative and quasisymmetric Schur functions. Dual graphs, in this context, refer to pairs of graded or filtered graphs on the same underlying set, endowed with up and down operators whose commutation relations encode deep combinatorial and algebraic structures. The theory of poc-sets and their dual graph structures provides an essential framework for understanding the interplay between combinatorics of compositions and algebraic structures such as (quasi)symmetric functions (Willigenburg, 2019).

1. Compositions and Fundamental Operators

A composition is defined as a finite sequence of positive integers $\alpha=(\alpha_1,\dots,\alpha_\ell)$, with its size given by $|\alpha| = \sum_{i=1}^\ell \alpha_i$. Allowing weak compositions (possibly containing zeroes) enables the natural extension of various operators critical for the construction of poc-sets and dual graphs.

Four principal families of linear operators act on (weak) compositions, indexed by $i\geq 0$:

• Box-removing operators $d_i$: $d_i(\alpha)$ subtracts 1 from the rightmost part equal to $i$, if it exists; $d_0$ is the identity.
• Appending operators $a_i$: $a_i(\alpha)$ appends $i$ to the end.
• Jeu-de-taquin (jdt) operators $|\alpha| = \sum_{i=1}^\ell \alpha_i$0: Defined as $|\alpha| = \sum_{i=1}^\ell \alpha_i$1, where $|\alpha| = \sum_{i=1}^\ell \alpha_i$2.
• Box-adding operators $|\alpha| = \sum_{i=1}^\ell \alpha_i$3: For $|\alpha| = \sum_{i=1}^\ell \alpha_i$4, prepends 1; for $|\alpha| = \sum_{i=1}^\ell \alpha_i$5, increments the leftmost part equal to $|\alpha| = \sum_{i=1}^\ell \alpha_i$6 by 1.

These operators satisfy a system of commutation relations, such as $|\alpha| = \sum_{i=1}^\ell \alpha_i$7 for $|\alpha| = \sum_{i=1}^\ell \alpha_i$8 and $|\alpha| = \sum_{i=1}^\ell \alpha_i$9, which are instrumental in establishing the dual graph structures.

2. Partial Orders and Composition Posets

Three principal partial orders—or poc-sets—are constructed on the set of compositions using the above operators, each graded by composition size:

• Right composition poset ($i\geq 0$0): $i\geq 0$1 covers $i\geq 0$2 if $i\geq 0$3 for some $i\geq 0$4.
• Left composition poset ($i\geq 0$5): $i\geq 0$6 covers $i\geq 0$7 if $i\geq 0$8 for some $i\geq 0$9.
• Quasisymmetric composition poset ($d_i$0): $d_i$1 covers $d_i$2 if $d_i$3 for some $d_i$4.

A deformation of $d_i$5, denoted $d_i$6, is defined by allowing all possible box-removal sets: $d_i$7 iff $d_i$8, for nonempty $d_i$9. This deformation gives rise to strong filtered graph structures, where edges can join vertices across or within ranks.

3. Up and Down Operators

To analyze graded or filtered graphs on the set $d_i(\alpha)$0 of all (weak) compositions, one introduces corresponding vector spaces $d_i(\alpha)$1 over a characteristic-zero field $d_i(\alpha)$2. For a graded (or filtered) graph, linear up ($d_i(\alpha)$3) and down ($d_i(\alpha)$4) operators are defined as follows: $d_i(\alpha)$5 where $d_i(\alpha)$6 denotes the number of edges from $d_i(\alpha)$7 to $d_i(\alpha)$8.

Specific instances include:

• On $d_i(\alpha)$9: $i$0
• On $i$1: $i$2
• On $i$3: $i$4, $i$5
• On $i$6: $i$7

The structure and interplay of these operators on poc-sets are foundational to the duality properties of the associated graphs.

4. Dual Graded and Filtered Graphs

Dual graded graphs arise from pairs of graded graphs $i$8 on the same vertex set with operators $i$9, $d_0$0 satisfying the commutator identity: $d_0$1 Key dual graded graph pairs include $d_0$2 and $d_0$3. The proof relies on commutation relations between up and down operators, such as $d_0$4 for $d_0$5, and a case analysis for $d_0$6. Specifically, the $d_0$7 pair satisfies

$d_0$8

Filtered dual graphs generalize this structure. In this setting, weak and strong filtered graphs are defined based on the allowable edge directions in rank. Dual filtered graphs satisfy

$d_0$9

The strong filtered graph $a_i$0 (arising from deforming $a_i$1 to allow multiple simultaneous removals) admits $a_i$2 and $a_i$3 as dual filtered pairs.

5. Illustrative Small-Rank Examples

Explicit Hasse diagrams at low rank clarify the dual structures:

• Weight 0: Only the empty composition $a_i$4.
• Weight 1: $a_i$5.
• Weight 2: $a_i$6 and $a_i$7.

For $a_i$8 at rank 2:

• $a_i$9: $a_i(\alpha)$0 and $a_i(\alpha)$1
• $a_i(\alpha)$2: $a_i(\alpha)$3, $a_i(\alpha)$4

The commutation relations ensure that the up-down commutator yields the identity on these elements.

6. General Framework and Significance

The emergence of dual graded or filtered graph structures is closely linked to the existence of commutation relations among raising and lowering operators derived from algebraic structures. Differential posets and dual graded graphs are characterized by collections of operators $a_i(\alpha)$5 satisfying

$a_i(\alpha)$6

Within the context of symmetric or quasisymmetric functions, Pieri rules govern the addition of one-part functions, guiding the structure of the operators and enabling the deduction of dual graph frameworks. In particular:

• $a_i(\alpha)$7 and $a_i(\alpha)$8 correspond to the right and left Pieri rules of noncommutative Schur functions.
• $a_i(\alpha)$9 corresponds to the classical Pieri rule for quasisymmetric Schur functions.
• $i$0 arises as the natural “all–subsets” deformation of $i$1.

The established commutation relations among $i$2, $i$3, and $i$4 guarantee dual graded structure for $i$5 and $i$6, and dual filtered structure for $i$7 and $i$8. This framework answers the structural question: a poset with Pieri-type add-box and remove-box operators admits dual (filtered) graph structure precisely when those operators satisfy the classical commutation relations (Willigenburg, 2019).