The following pages link to On a problem of Rota (Q1246425):
Displaying 20 items.
- The absolute orders on the Coxeter groups \(A_n\) and \(B_n\) are Sperner (Q783067) (← links)
- On Whitney numbers of Dowling lattices (Q1126175) (← links)
- Maximum antichains of rectangular arrays (Q1133543) (← links)
- A simple counterexample to a conjecture of Rota (Q1136784) (← links)
- General lattice theory: 1979 problem update (Q1149456) (← links)
- The global theory of flows in networks (Q1157274) (← links)
- Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers (Q1162514) (← links)
- The local Kostant-PBW ordering (Q1175976) (← links)
- Maximum antichains in the partition lattice (Q1255496) (← links)
- The size of the largest antichain in the partition lattice (Q1269889) (← links)
- Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group (Q1272363) (← links)
- On the average rank of an element in a filter of the partition lattice (Q1317456) (← links)
- Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains (Q1317461) (← links)
- Pseudo-LYM inequalities and AZ identities (Q1384026) (← links)
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (Q1814142) (← links)
- Integer partitions and the Sperner property (Q1885046) (← links)
- Matchings, cutsets, and chain partitions in graded posets (Q1898341) (← links)
- Symmetric decompositions and the strong Sperner property for noncrossing partition lattices (Q2397710) (← links)
- Superantichains in the Lattice of Partitions of a Set (Q3347894) (← links)
- The symmetric group, ordered by refinement of cycles, is strongly Sperner (Q4990332) (← links)
