A unified framework for Simplicial Kuramoto models
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
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 ...
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 ...
The temperature dependence of the gapped triplet excitations (triplons) in the 2D Shastry-Sutherland quantum magnet SrCu2(BO3)(2) is studied by means of inelastic neutron scattering. The excitation amplitude rapidly decreases as a function of temperature, ...
How about fastening a knot? not with ropes... but with timber panels. Timber Fabric
Structures (TFS) originate from such an inspiration. An architectural reinterpretation
of fabric techniques (mainly braiding) using building scale timber panels to design ...
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 ...
In this report, we use a variety of tools from differential geometry to propose a nonlinear extension of the principal components analysis (PCA) into manifolds setting. This extension, that we shall call principal geodesics analysis (PGA), attempts to find ...
This dissertation develops geometric variational models for different inverse problems in imaging that are ill-posed, designing at the same time efficient numerical algorithms to compute their solutions. Variational methods solve inverse problems by the fo ...
Fano resonances in hybridized systems formed from the interaction of bright modes only are reported. Despite precedent works, we demonstrate theoretically and experimentally that Fano resonances can be obtained by destructive interference between two brigh ...
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian ma ...
A network of coupled limit cycle oscillators with delayed interactions is considered. The parameters characterizing the oscillator’s frequency and limit cycle are allowed to self-adapt. Adaptation is due to time-delayed state variables thatmutually interac ...