Coxeter groups and nonuniform complexity

DOI10.1016/0196-8858(91)90010-GzbMath0761.05047MaRDI QIDQ1814266

Bernd Graw

Publication date: 25 June 1992

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

complexitysortingCoxeter groupsbipartite graphsCoxeter complexinformation systemgreedoidspermutation graphsdecision graph

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
• A topological approach to evasiveness
• Lower bounds on monotone complexity of the logical permanent
• Combinatorial geometries, convex polyhedra, and Schubert cells
• Bruhat order of Coxeter groups and shellability
• Buildings of spherical type and finite BN-pairs
• Some characterizations of Bruhat ordering on a Coxeter group and determination of the relation Möbius function
• Discrete groups generated by reflections
• Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
• Nonuniform complexity classes, decision graphs and homological properties of posets
• Lower bounds on the complexity of real-time branching programs
• The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1
• Combinatorics and commutative algebra

This page was built for publication: Coxeter groups and nonuniform complexity