Collapse-invariant properties of spaces equipped with signals or directions
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Let X be a simplicial set. We construct a novel adjunction be- tween the categories RX of retractive spaces over X and ComodX+ of X+- comodules, then apply recent work on left-induced model category structures [5], [16] to establish the existence of a left ...
We establish improved versions of the Hardy and Caffarelli-Kohn-Nirenberg inequalities by replacing the standard Dirichlet energy with some nonlocal nonconvex functionals which have been involved in estimates for the topological degree of continuous maps f ...
In this work we apply the discontinuous Galekin (dG) spectral element method on meshes made of simplicial elements for the approximation of the elastodynamics equation. Our approach combines the high accuracy of spectral methods, the geometrical flexibilit ...
We consider two basic problems of algebraic topology: the extension problem and the computation of higher homotopy groups, from the point of view of computability and computational complexity. The extension problem is the following: Given topological space ...
For several computational problems in homotopy theory, we obtain algorithms with running time polynomial in the input size. In particular, for every fixed k >= 2, there is a polynomial-time algorithm that, for a 1-connected topological space X given as a f ...
Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...
The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...
Consider a fibration sequence of topological spaces which is preserved as such by some functor , so that is again a fibration sequence. Pull the fibration back along an arbitrary map into the base space. Does the pullback fibration enjoy the same property? ...
A method for achieving a representation of an object within a data structure for a Computer Aided Design system employing a Medial Axis Transformation (MAT), the representation of the object comprising a set of adjacent bounded surface elements called MAT ...
The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)
