排序方式: 共有3条查询结果,搜索用时 93 毫秒
1
1.
Lattice congruences, fans and Hopf algebras 总被引:1,自引:0,他引:1
We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak order on a Coxeter group we construct a complete fan of convex cones with strong properties relative to the corresponding lattice quotient of the weak order. We show that if a family of lattice congruences on the symmetric groups satisfies certain compatibility conditions then the family defines a sub Hopf algebra of the Malvenuto–Reutenauer Hopf algebra of permutations. Such a sub Hopf algebra has a basis which is described by a type of pattern avoidance. Applying these results, we build the Malvenuto–Reutenauer algebra as the limit of an infinite sequence of smaller algebras, where the second algebra in the sequence is the Hopf algebra of non-commutative symmetric functions. We also associate both a fan and a Hopf algebra to a set of permutations which appears to be equinumerous with the Baxter permutations. 相似文献
2.
Janvier Nzeutchap 《Journal of Combinatorial Theory, Series A》2009,116(1):143-167
This work is first concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algebras associated to the Young-Fibonacci lattice. The original algorithm was introduced by Roby and we redefine it in such a way that both the insertion and recording tableaux of any permutation are conveniently interpreted as saturated chains in the Young-Fibonacci lattice. Using our conventions, we give a simpler proof of a property of Killpatrick's evacuation algorithm for Fibonacci tableaux. It also appears that this evacuation is no longer needed in making Roby's and Fomin's constructions coincide. We provide the set of Young-Fibonacci tableaux of size n with a structure of graded poset called tableauhedron, induced by the weak order of the symmetric group, and realized by transitive closure of elementary transformations on tableaux. We show that this poset gives a combinatorial interpretation of the coefficients of the transition matrix from the analogue of complete symmetric functions to analogue of the Schur functions in Okada's algebra associated to the Young-Fibonacci lattice. We prove a similar result relating usual Kostka numbers with four partial orders on Young tableaux, studied by Melnikov and Taskin. 相似文献
3.
Jonathan M. Bloom 《Advances in Mathematics》2011,(4):3216
To a link L⊂S3, we associate a spectral sequence whose E2 page is the reduced Khovanov homology of L and which converges to a version of the monopole Floer homology of the branched double cover. The pages Ek for k?2 depend only on the mutation equivalence class of L. We define a mod 2 grading on the spectral sequence which interpolates between the δ-grading on Khovanov homology and the mod 2 grading on Floer homology. We also derive a new formula for link signature that is well adapted to Khovanov homology.More generally, we construct new bigraded invariants of a framed link in a 3-manifold as the pages of a spectral sequence modeled on the surgery exact triangle. The differentials count monopoles over families of metrics parameterized by permutohedra. We utilize a connection between the topology of link surgeries and the combinatorics of graph-associahedra. This also yields simple realizations of permutohedra and associahedra, as refinements of hypercubes. 相似文献
1