A combinatorial technique for simplicial complexes and some applications to finite groups

DOI10.1016/0012-365X(90)90204-UzbMath0727.20016MaRDI QIDQ803276

Hans Kurzweil

Publication date: 1990

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

finite groupssimplicial complexesorder complexesposetscontractibilityhomotopy equivalencesubgroup lattice

Mathematics Subject Classification ID

Series and lattices of subgroups (20D30) Combinatorics of partially ordered sets (06A07) Homotopy equivalences in algebraic topology (55P10) Classification of homotopy type (55P15) Simplicial sets and complexes in algebraic topology (55U10)

Related Items

On the poset of conjugacy classes of subgroups of π-power index ⋮ Collapsing along monotone poset maps ⋮ A lattice theoretic characterization of prefrattini subgroups

Cites Work

• Unnamed Item
• Unnamed Item
• A topological approach to evasiveness
• Fonction de Möbius d'un groupe fini et anneau de Burnside. (Möbius function of a finite group and the Burnside ring)
• Permutation representations arising from simplicial complexes
• Homotopy type and Euler characteristic of partially ordered sets
• Euler characteristics of groups: The \(p\)-fractional part
• Homotopy properties of the poset of nontrivial p-subgroups of a group
• A homotopy complementation formula for partially ordered sets
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]