Differential Posets
The author has introduced a class of partially ordered sets, called differential posets, with many remarkable combinatorial and algebraic properties. The problem is concerned with counting of saturated chains, \(x_ 1<x_ 2<...<x_ k\) or of ``Hasse walks \(x_ 1,x_ 2,...,x_ k\) with either \(x_{i+1}\) covers \(x_ i\) or \(x_ i\) covers \(x_{i+1}\), \(1\leq i\leq k-1\) with various properties. A basic tool in the theory of differential posets P is the use of two adjoint linear transformations U and D of vector space of linear combinations of elements of P. If \(x\in P\) then \(Ux\) (respectively, \(Dx\)) is the sum of all elements covering \(x\) (respectively, which \(x\) covers). A fundamental property of \(U\) and \(D\) is the commutative rule \(DU-UD=rI\) for some positive integer r. Thus differential posets may be regarded as yielding a representation of the ``Weyl algebra generated by \(U\) and \(D/r\). The spectrum of the operator \(UD\) and its eigenvectors are computed and the result is extended to more general functions of \(U\) and \(D\). The spectrum of \(UD\) is closely related to the spectrum of the adjacency matrix of certain finite graphs associated with differential posets. An example of a differential poset is Young's lattice Y, first studied by G. Kreweras. It is defined as the set of all partitions of all nonnegative integers n ordered by inclusion of Young diagrams. Thus if \(\lambda =(\lambda_ 1\geq \lambda_ 2\geq...)\) and \(\mu =(\mu_ 1,\mu_ 2,...)\) are parititions, \((\lambda_ 1\geq \lambda_ 2\geq..\). and \(\mu_ 1\geq \mu_ 2\geq...)\), then \(\mu\leq \lambda\) in Y if and only if \(\mu_ i\leq \lambda_ i\) for all i. Young's lattice is locally finite distributive lattice. In fact it is the lattice \(J_ f({\mathbb{N}}^ 2)\) of finite order ideals of the poset \({\mathbb{N}}^ 2\). If \(\lambda\in Y\) is a partition of n, it is indicated by \(| \lambda | =n\) or \(\lambda\vdash n\). Young's lattice is graded with rank function \(\rho\) given by \(\rho(\lambda)=| \lambda |\). Many remarkable enumerative properties of Y are consequences of the theory of symmetric functions, the representation theory of the symmetric group, the complex general linear group, and the Robinson-Schensted correspondence. A standard Young tableau (SYT) of shape \(\lambda\) may be identified with a Saturated Chain \(\phi =\lambda^ 0\subset \lambda^ 1\subset...\subset \lambda^ n\) of partitions from \(\phi\) to \(\lambda\). If \(f^{\lambda}\) denotes the number SYT of shape \(\lambda\), then \(\sum_{\lambda \vdash n}(f^{\lambda})^ 2=n!\) asserts that the number of sequences (or Hasse walks) \(\phi =\lambda^ 0<\lambda^ 1<...<\lambda^ n>\mu^{n- 1}>...>\mu^ 0=\phi,\) where \(\lambda^ i\) and \(\mu^ i\) are partitions of i, is equal to \(n!\). If P is a graded poset then \(\rho\) denotes its rank function, i.e., if \(x\in P\) then \(\rho(x)\) is the length \(\ell\) of the longest chain \(x_ 0<x_ 1<...<x_{\ell}=x\) in P with top element x. Write \(P_ i=\{x\in P:\quad \rho (x)=i\}\) so \(P=P_ 0\dot\cup P_ 1 \dot\cup...\) (disjoint union). The counting of chains in partially ordered sets is a well developed subject with many applications in enumerative combinatorics, probability theory and statistical mechanics besides other areas.
- A Schensted-type correspondence for the symplectic group
- Coxeter graphs and towers of algebras
- Graph theory with applications
- scientific article; zbMATH DE number 3766017 (Why is no real title available?)
- scientific article; zbMATH DE number 3513846 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3390954 (Why is no real title available?)
- On the decomposition of Brauer's centralizer algebras
- Ordered structures and partitions
- Quotients of Peck posets
- Rational generating functions for enumerating chains of partitions
- Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property
- Robinson-Schensted algorithms for skew tableaux
- Some Notes on Multiple-Boson Processes
- The stable behavior of some characters of SL1
- Theory and Application of Plane Partitions: Part 1
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- k-ribbon Fibonacci tableaux
- Commutation relations and Markov chains
- On the generating functions of the Young lattice
- Log-concavity and combinatorial properties of Fibonacci lattices
- Matrix units for centralizer algebras
- Some remarkable combinatorial matrices
- Counting paths in Young's lattice
- Down-up algebras
- Centers of down-up algebras
- Duality of graded graphs
- Schensted algorithms for dual graded graphs
- A bijection between maximal chains in Fibonacci posets
- Irreducible finite-dimensional modules of prime characteristic down-up algebras.
- Difference posets in the quantum structures background
- Symmetric Grothendieck polynomials, skew Cauchy identities, and dual filtered Young graphs
- Recurrence relations for Wronskian Hermite polynomials
- Difference operators for partitions and some applications
- Difference operators for partitions under the Littlewood decomposition
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Symplectic and orthogonal Robinson-Schensted algorithms
- Dual filtered graphs
- The automorphism group of the Fibonacci poset: A ``not too difficult problem of Stanley from 1988
- Order ideals in weak subposets of Young's lattice and associated unimodality conjectures
- Schur operators and Knuth correspondences
- Universal exponential solution of the Yang-Baxter equation
- Combinatorial Hopf algebras and towers of algebras -- dimension, quantization and functorality.
- The Martin boundary of the Young-Fibonacci lattice
- Quasi-differential posets and cover functions of distributive lattices. I: A conjecture of Stanley
- Polynomiality of certain average weights for oscillating tableaux
- Duality of graded graphs through operads
- Up- and down-operators on Young's lattice
- The algebra of Schur operators
- On the apparatus of differentiation DI-DV for posets
- Commutation and normal ordering for operators on symmetric functions
- Enumeration of paths in the Young-Fibonacci graph
- On \(q\)-symmetric functions and \(q\)-quasisymmetric functions
- Differential posets and restriction in critical groups
- Three theorems on the uniqueness of the Plancherel measure from different viewpoints
- Positive specializations of symmetric Grothendieck polynomials
- Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions
- Wronskian Appell polynomials and symmetric functions
- Differential posets have strict rank growth: a conjecture of Stanley
- Spectral analysis of finite Markov chains with spherical symmetries
- Markov chains on graded posets. Compatibility of up-directed and down-directed transition probabilities
- On the largest Kronecker and Littlewood-Richardson coefficients
- Signed differential posets and sign-imbalance
- Pieri's formula for generalized Schur polynomials
- Some remarks on sign-balanced and maj-balanced posets
- Rationality of the Möbius function of a composition poset
- Differential posets, Cayley graphs, and critical groups
- Complexity in Young's lattice
- On the kernels of the lowering operators for ranked posets.
- On the algorithm of differentiation D-IX for equipped posets.
- The Smith normal form of a matrix associated with Young's lattice
- Multi-ordered posets
- Crossings and nestings of matchings and partitions
- scientific article; zbMATH DE number 4160796 (Why is no real title available?)
- \(\mathfrak{sl}(2)\) operators and Markov processes on branching graphs
- The excedance algebra
- scientific article; zbMATH DE number 1332104 (Why is no real title available?)
- On the rank function of a differential poset
- Algebras Associated to the Young-Fibonacci Lattice
- Signed enumeration of ribbon tableaux: an approach through growth diagrams
- The efficient computation of Fourier transforms on the symmetric group
- Combinatorics of rooted trees and Hopf algebras
- A note on statistical averages for oscillating tableaux
- Schröder partitions, Schröder tableaux and weak poset patterns
- Hamiltonian systems, Toda lattices, solitons, Lax pairs on weighted Z-graded graphs
- Boolean function analysis on high-dimensional expanders
- Quantum generalized Heisenberg algebras and their representations
- Polynomial relations between operators on chains of representation rings
- New hook-content formulas for strict partitions
- Separation of variables and the computation of Fourier transforms on finite groups. II
- Recurrence relations for Wronskian Laguerre polynomials
- Dual graphs from noncommutative and quasisymmetric Schur functions
- From sequences to polynomials and back, via operator orderings
- Evacuation and a geometric construction for Fibonacci tableaux
- Sign balances and promotion order of Young-Fibonacci tableaux
- The Ungar games
- Boolean function analysis on high-dimensional expanders
- Theorems and conjectures on some rational generating functions
- The \(\mathbb{Z}_3\)-symmetric down-up algebra
- Noncommutative algebra and representation theory: symmetry, structure \& invariants
- Smith normal form of matrices associated with differential posets
- Representations of \(\mathbb{N}^{\infty}\)-type combinatorial categories
- The game of plates and olives
- Dual graded graphs and Bratteli diagrams of towers of groups
- Hochschild homology and cohomology of down-up algebras
- Random Fibonacci words via clone Schur functions
- Zigzags, contingency tables, and quotient rings
- Down-up algebras and chromatic symmetric functions
- Cylindric growth diagrams, walks in simplices, and exclusion processes
- Diagram model for the Okada algebra and monoid
- Ergodicity of the martin boundary of the Young-Fibonacci graph
- Further combinatorial properties of two Fibonacci lattices
- Path counting and rank gaps in differential posets
- Robinson-Schensted algorithms for skew tableaux
- Differential posets and Smith normal forms
- The induced subgraph order on unlabelled graphs
- Updown categories: generating functions and universal covers
This page was built for publication: Differential Posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3807216)