En poursuivant votre navigation sur ce site, vous acceptez l'utilisation d'un simple cookie d'identification. Aucune autre exploitation n'est faite de ce cookie. OK

Documents 68R99 2 results

Filter
Select: All / None
Q
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y

Expansions, fillings, and Morse sequences - Bertrand, Gilles (Author of the conference) | CIRM H

Multi angle

In a seminal paper Henry Whitehead introduced four elementary operators, collapses and expansions (the inverse of a collapse), perforations and fillings (the inverse of a perforation), which correspond to an homotopy equivalence between two simplicial complexes. In this talk, we consider some transformations which are obtained by the means of these four operators. The presentation is composed of two parts. We begin the first part by introducing a certain axiomatic approach for combinatorial topology, which is settled in the framework of completions. Completions are inductive properties which may be expressed in a declarative way and may be combined. Then, we present a transformation that is based solely on collapses and expansions. This transformation involves homotopic pairs, it may be seen as a refinement of simple homotopy, which takes as input a single object. A homotopic pair is a couple of objects (X, Y ) such that X is included in Y and (X, Y ) may be transformed to a trivial couple by collapses and expansions that keep X inside Y . Our main result states that the collection of all homotopic pairs may be fully described by four completions which correspond to four global properties. After, we consider a transformation that is based on collapses, expansions, perforations, and fillings. This transformation involves contractible pairs, which are extensions of homotopic pairs. Again we show that the collection of all contractible pairs may be fully described by four completions which correspond to four global properties. Three of these completions are the same as the ones describing homotopic pairs. In the second part of the presentation, we introduce the notion of a Morse sequence, which provides a very simple approach to discrete Morse theory. A Morse sequence is obtained by considering only expansions and fillings of a simplicial complex, or, in a dual manner, by considering only collapses and perforations. A Morse sequence may be seen as an alternative way to represent the gradient vector field of an arbitrary discrete Morse function. We introduce reference maps, which are maps that associate a set of critical simplexes to each simplex appearing in a Morse sequence. By considering the boundary of each critical simplex, we obtain a chain complex from these maps, which corresponds precisely to the Morse complex. Then, we define extension maps. We show that, when restricted to homology, an extension map is the inverse of a reference map. Also we show that these two maps allow us to recover directly the isomorphism theorem between the homology of an object and the homology of its Morse complex[-]
In a seminal paper Henry Whitehead introduced four elementary operators, collapses and expansions (the inverse of a collapse), perforations and fillings (the inverse of a perforation), which correspond to an homotopy equivalence between two simplicial complexes. In this talk, we consider some transformations which are obtained by the means of these four operators. The presentation is composed of two parts. We begin the first part by introducing ...[+]

13D99 ; 55N99 ; 68R99

Bookmarks Report an error
Déposez votre fichier ici pour le déplacer vers cet enregistrement.
y
Subshifts are set of colorings of a group by a finite alphabet that respect local constraints, given by some forbidden patterns ode m. The asymmetric version of Lovász local lemma reveals particularly useful to prove the existence of a coloring inside a subshift, i.e. a coloring that avoids all the forbidden patterns. In this talk I will present some sufficient conditions on the set of forbidden patterns to get at least one coloring. Then we will see as an application why every group possesses a strongly aperiodic subshift (joint work with Sebastián Barbieri and Stéphan Thomassé).[-]
Subshifts are set of colorings of a group by a finite alphabet that respect local constraints, given by some forbidden patterns ode m. The asymmetric version of Lovász local lemma reveals particularly useful to prove the existence of a coloring inside a subshift, i.e. a coloring that avoids all the forbidden patterns. In this talk I will present some sufficient conditions on the set of forbidden patterns to get at least one coloring. Then we ...[+]

37B10 ; 37B50 ; 68R99

Bookmarks Report an error