English
Related papers

Related papers: Computing simplicial representatives of homotopy g…

200 papers

Given topological spaces X and Y, a fundamental problem of algebraic topology is understanding the structure of all continuous maps X -> Y . We consider a computational version, where X, Y are given as finite simplicial complexes, and the…

Computational Geometry · Computer Science 2014-01-31 Martin Čadek , Marek Krčál , Jiří Matoušek , Francis Sergeraert , Lukáš Vokřínek , Uli Wagner

For $X$ a connected finite simplicial complex we consider $\Delta^d(X,n)$ the space of configurations of $n$ ordered points of $X$ such that no $d+1$ of them are equal, and $B^d(X,n)$ the analogous space of configurations of unordered…

Algebraic Topology · Mathematics 2016-11-16 Sadok Kallel , Ines Saihi

Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…

Algebraic Topology · Mathematics 2016-10-10 Martin Čadek , Marek Krčál , Lukáš Vokřínek

The realization problem asks: When does an algebraic complex arise, up to homotopy, from a geometric complex? In the case of 2- dimensional algebraic complexes, this is equivalent to the D2 problem, which asks when homological methods can…

Algebraic Topology · Mathematics 2023-12-22 Wajid Mannan

Recently it was shown that, for every fixed k>1, given a finite simply connected simplicial complex X, the kth homotopy group \pi_k(X) can be computed in time polynomial in the number n of simplices of X. We prove that this problem is…

Computational Complexity · Computer Science 2013-04-30 Jiri Matousek

In this article we consider the homotopy theory of stratified spaces through a simplicial point of view. We first consider a model category of filtered simplicial sets over some fixed poset $P$, and show that it is a simplicial…

Algebraic Topology · Mathematics 2020-03-24 Sylvain Douteau

The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…

Algebraic Topology · Mathematics 2021-12-24 Preston Cranford , Peter Rowley

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

Algebraic Topology · Mathematics 2007-05-23 Marco Grandis

Let $X$ be a homogeneous space of a connected linear algebraic group $G$ defined over the field of complex numbers $\mathbb C$. Let $x\in X({\mathbb C})$ be a point. We denote by $H$ the stabilizer of $x$ in $G$. When $H$ is connected, we…

Algebraic Geometry · Mathematics 2023-03-03 Mikhail Borovoi

For a pointed topological space $X$, we use an inductive construction of a simplicial resolution of $X$ by wedges of spheres to construct a "higher homotopy structure" for $X$ (in terms of chain complexes of spaces). This structure is then…

Algebraic Topology · Mathematics 2021-11-10 David Blanc , Mark W. Johnson , James M. Turner

This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a (non-unique)…

Discrete Mathematics · Computer Science 2011-05-24 Rocio Gonzalez-Diaz , Maria Jose Jimenez , Belen Medrano , Pedro Real

This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…

Algebraic Topology · Mathematics 2025-11-06 Sanjay Mishra

Given a simplicial complex $X$, we construct a simplicial complex $\Omega X$ that may be regarded as a combinatorial version of the based loop space of a topological space. Our construction explicitly describes the simplices of $\Omega X$…

Algebraic Topology · Mathematics 2025-07-17 Gregory Lupton , Jonathan Scott

The topological fundamental group $\pi_{1}^{top}$ is a homotopy invariant finer than the usual fundamental group. It assigns to each space a quasitopological group and is discrete on spaces which admit universal covers. For an arbitrary…

Algebraic Topology · Mathematics 2020-04-14 Jeremy Brazas

We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…

Algebraic Topology · Mathematics 2022-11-28 Marek Filakovský , Lukáš Vokřínek

This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f, g from X to Y and the second computes the group $[\Sigma X,Y]^*$ of pointed…

Algebraic Topology · Mathematics 2013-12-10 Marek Filakovský , Lukáš Vokřínek

Let $X$ be a simplicial complex on vertex set $V$. We say that $X$ is $d$-representable if it is isomorphic to the nerve of a family of convex sets in $\mathbb{R}^d$. We define the $d$-boxicity of $X$ as the minimal $k$ such that $X$ can be…

Combinatorics · Mathematics 2020-08-25 Alan Lew

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

Logic · Mathematics 2022-02-11 Djamel Eddine Amir , Mathieu Hoyrup

We compare the structure of a mapping cone in the category Top^D of spaces under a space D with differentials in algebraic models like crossed complexes and quadratic complexes. Several subcategories of Top^D are identified with algebraic…

Algebraic Topology · Mathematics 2010-05-27 Hans-Joachim Baues , Beatrice Bleile

For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k>1, there is a polynomial-time algorithm that, for a 1-connected topological space X…

Computational Geometry · Computer Science 2014-05-29 Martin Cadek , Marek Krcal , Jiri Matousek , Lukas Vokrinek , Uli Wagner
‹ Prev 1 2 3 10 Next ›