English
Related papers

Related papers: The universality of Hom complexes

200 papers

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…

Algebraic Topology · Mathematics 2012-07-20 Mark Grant , Gregory Lupton , John Oprea

We give a short, mostly elementary and self-contained proof of the classical result that the groups of diffeomorphisms, homeomorphisms, and homotopy equivalences of a surface have the same group of connected components.

General Topology · Mathematics 2009-08-18 Søren Kjærgaard Boldsen

Given a closed $n$-manifold, we consider the set of simple homotopy types of $n$-manifolds within its homotopy type, called its simple homotopy manifold set. We characterise it in terms of algebraic K-theory, the surgery obstruction map,…

Algebraic Topology · Mathematics 2026-04-13 Csaba Nagy , John Nicholson , Mark Powell

We prove that any group $G$ occurs as $\E(X)$, where $X$ is CW-complex of finite dimension and $\E(X)$ denotes its group of self-homotopy equivalence. Thus, we generalize a well know-theorem due to Costoya and Viruel \cite{CV} asserting…

Algebraic Topology · Mathematics 2025-02-25 Mahmoud Benkhalifa

\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…

Algebraic Topology · Mathematics 2023-08-17 Luigi Caputi , Daniele Celoria , Carlo Collari

Counting homomorphisms from a graph $H$ into another graph $G$ is a fundamental problem of (parameterized) counting complexity theory. In this work, we study the case where \emph{both} graphs $H$ and $G$ stem from given classes of graphs:…

Computational Complexity · Computer Science 2021-08-04 Marc Roth , Philip Wellnitz

A $(G,n)$-complex is an $n$-dimensional CW-complex with fundamental group $G$ and whose universal cover is $(n-1)$-connected. If $G$ has periodic cohomology then, for appropriate $n$, we show that there is a one-to-one correspondence…

Algebraic Topology · Mathematics 2024-07-24 John Nicholson

We establish certain conditions which imply that a map $f:X\to Y$ of topological spaces is null homotopic when the induced integral cohomology homomorphism is trivial; one of them is: $H^*(X)$ and $\pi_*(Y)$ have no torsion and $H^*(Y)$ is…

Algebraic Topology · Mathematics 2009-06-11 Samson Saneblidze

Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…

Discrete Mathematics · Computer Science 2024-02-14 Thomas Bellitto , Christopher Duffy , Gary MacGillivray

We study two simplicial complexes arising from a directed graph $G = (V, E)$ with two chosen vertices $s$ and $t$: the *path-free complex*, consisting of all subsets $F \subseteq E$ that contain no path from $s$ to $t$, and the…

Combinatorics · Mathematics 2025-06-12 Darij Grinberg , Lukas Katthän , Joel Brewster Lewis

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

Group Theory · Mathematics 2020-03-04 B. Akbari , Mark L. Lewis , J. Mirzajani , A. R. Moghaddamfar

In this article, we prove that, given two finite connected graphs $\Gamma_1$ and $\Gamma_2$, if the two right-angled Artin groups $A(\Gamma_1)$ and $A(\Gamma_2)$ are quasi-isometric, then the infinite pointed sums $\bigvee_\mathbb{N}…

Group Theory · Mathematics 2025-03-12 Carolyn Abbott , Anthony Genevois , Eduardo Martinez-Pedroza

We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying…

Combinatorics · Mathematics 2023-10-24 Phillippe Samer

We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…

Logic · Mathematics 2013-08-19 Saugata Basu , Andrei Gabrielov , Nicolai Vorobjov

In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…

Computational Complexity · Computer Science 2014-12-02 Christian Engels

We study the vertices of the polytopes of all affine maps (a.k.a. hom-polytopes) between higher dimensional simplices, cubes, and crosspolytopes. Systematic study of general hom-polytopes was initiated in [3]. The study of such vertices is…

Combinatorics · Mathematics 2014-03-04 Joseph Gubeladze , Jack Love

A Hom-group G is a nonassociative version of a group where associativity, invertibility, and unitality are twisted by a map \alpha: G\longrightarrow G. Introducing the Hom-group algebra KG, we observe that Hom-groups are providing examples…

Group Theory · Mathematics 2018-03-28 Mohammad Hassanzadeh

The independence complex of a graph is a simplicial complex whose faces correspond to the independent sets of $G$. While independence complexes have been studied extensively for many graph classes, including square grid graphs, relatively…

Combinatorics · Mathematics 2025-12-25 Himanshu Chandrakar , Anurag Singh

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link.…

Geometric Topology · Mathematics 2008-12-18 Helge Møller Pedersen