A discrete homotopy theory for binary reflexive structures
From MaRDI portal
Publication:1763635
DOI10.1016/j.aim.2003.11.011zbMath1061.06005OpenAlexW2078931235MaRDI QIDQ1763635
Publication date: 22 February 2005
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2003.11.011
Combinatorics of partially ordered sets (06A07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Homotopy groups (55Q99)
Related Items (8)
Recolouring homomorphisms to triangle-free reflexive graphs ⋮ Surjective polymorphisms of directed reflexive cycles ⋮ Ramsey classes of topological and metric spaces ⋮ Semilattice polymorphisms and chordal graphs ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Finite relational structure models of topological spaces and maps ⋮ On the localization genus of a direct product of metacyclic groups ⋮ A quasi-Mal'cev condition with unexpected application.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Homotopy properties of the poset of nontrivial p-subgroups of a group
- Homotopy theory of finite and locally finite \(T_ 0\) spaces
- From graphs to ortholattices and equivariant maps
- The complexity of solving equations over finite groups
- A nontrivial pairing of finite \(T_0\) spaces
- Singular homology groups and homotopy groups of finite topological spaces
- Homotopical algebra
- Finite posets and topological spaces in locally finite varieties
- The structure of finite algebras
- Varieties Obeying Homotopy Laws
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The Complexity of the Extendibility Problem for Finite Posets
- Finite Topological Spaces
This page was built for publication: A discrete homotopy theory for binary reflexive structures
