AbstractThis work properly belongs to combinatorial group theory. But in its motivation and applications, it is concerned with the homotopy theory of two-dimensional cellular spaces. We describe both the combinatorial and homotopical aspects of this work in the following introduction
For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, 2015) establis...
AbstractWe study the question: given a morphism ƒ{(Xn, xn)}→{(Yn, yn)} in the category pro-(Poi nted...
Inspired by prior results by Stanley and Leroux showing what information can be recovered from an is...
AbstractThis work properly belongs to combinatorial group theory. But in its motivation and applicat...
The main work of this thesis starts with Chapter 2. The main problems of the thesis are the followin...
Given a group G, we provide a constructive method to get infinitely many (non-homotopy-equivalent) A...
Abstract. For any finite group G, we construct a finite poset (or equivalently, a finite T0-space) X...
AbstractLet N⩾dim(X) and let Aut♯N(X) denote the group of homotopy classes of self-maps of X, which ...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
AbstractWe explicitly compute the 2-group of self-equivalences and (homotopy classes of) chain homot...
The main work of this thesis starts with Chapter 2. The main problems of the thesis are the followin...
AbstractLet K and L be two finite 2-dimensional CW-complexes with the same fundamental group. If the...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
AbstractIt is shown that homotopy equivalence of finite topological spaces is polynomially equivalen...
AbstractFor any finite group G, we construct a finite poset (or equivalently, a finite T0-space) X, ...
For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, 2015) establis...
AbstractWe study the question: given a morphism ƒ{(Xn, xn)}→{(Yn, yn)} in the category pro-(Poi nted...
Inspired by prior results by Stanley and Leroux showing what information can be recovered from an is...
AbstractThis work properly belongs to combinatorial group theory. But in its motivation and applicat...
The main work of this thesis starts with Chapter 2. The main problems of the thesis are the followin...
Given a group G, we provide a constructive method to get infinitely many (non-homotopy-equivalent) A...
Abstract. For any finite group G, we construct a finite poset (or equivalently, a finite T0-space) X...
AbstractLet N⩾dim(X) and let Aut♯N(X) denote the group of homotopy classes of self-maps of X, which ...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
AbstractWe explicitly compute the 2-group of self-equivalences and (homotopy classes of) chain homot...
The main work of this thesis starts with Chapter 2. The main problems of the thesis are the followin...
AbstractLet K and L be two finite 2-dimensional CW-complexes with the same fundamental group. If the...
Given that a large graph admits a group of automorphisms isomorphic to the abstract group G, what is...
AbstractIt is shown that homotopy equivalence of finite topological spaces is polynomially equivalen...
AbstractFor any finite group G, we construct a finite poset (or equivalently, a finite T0-space) X, ...
For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, 2015) establis...
AbstractWe study the question: given a morphism ƒ{(Xn, xn)}→{(Yn, yn)} in the category pro-(Poi nted...
Inspired by prior results by Stanley and Leroux showing what information can be recovered from an is...
DOI
Add to ORKG