Concept

Connectivité

Publications associées (15)

A full characterization of invariant embeddability of unimodular planar graphs

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...

WILEY2023

Voss surfaces: A design space for geodesic gridshells

Corentin Jean Dominique Fivet, Nicolas Robin Montagne, Olivier Baverel

The design of envelopes with complex geometries often leads to construction challenges. To overcome these difficulties, resorting to discrete differential geometry proved successful by establishing close links between mesh properties and the existence of g ...

2021

Smart Toys plus plus : Exploiting the Social Connectedness for Playing and Learning

Ayberk Özgür

Under the umbrella of smart toys, a myriad of interactive systems have addressed a variety of scenarios considering entertainment, education, sustainability, social and environmental learning through play. Tangibles and small toy robots prevail; but intera ...

ASSOC COMPUTING MACHINERY2021

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Yu Bai, Zhengwen Jiang, Yihe Zhao, Jie Li, Zichen Liu

A capacitive micromachined ultrasonic transducers (CMUTs) array with dual-mixed radii is designed to improve bandwidth and realize multi-modes operating for immersed ultrasonic applications. The two-size (TS) CMUT array is composed of two sub-arrays with d ...

IEEE2021

Voss Surfaces: A Design Space for Geodesic Gridshells

Corentin Jean Dominique Fivet, Nicolas Robin Montagne, Olivier Baverel

2020

Some regularity results for p-harmonic mappings between Riemannian manifolds

Changyu Guo

Let M be a C-2-smooth Riemannian manifold with boundary and N a complete C-2-smooth Riemannian manifold. We show that each stationary p-harmonic mapping u: M -> N, whose image lies in a compact subset of N, is locally C-1,C-alpha for some alpha is an eleme ...

2019

The Homotopy Theory Of Coalgebras Over Simplicial Comonads

Kathryn Hess Bellwald, Magdalena Kedziorek

We apply the Acyclicity Theorem of Hess, Kedziorek, Riehl, and Shipley (recently corrected by Garner, Kedziorek, and Riehl) to establishing the existence of model category structure on categories of coalgebras over comonads arising from simplicial adjuncti ...

INT PRESS BOSTON, INC2019

Essential connectedness and the rigidity problem for Gaussian symmetrization

Maria Colombo

We provide a geometric characterization of rigidity of equality cases in Ehrhard ' s symmetrization inequality for Gaussian perimeter. This condition is formulated in terms of a new measure-theoretic notion of connectedness for Borel sets, inspired by Fede ...

2017

Waldhausen K-theory of spaces via comodules

Kathryn Hess Bellwald

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 ...

Academic Press Inc Elsevier Science2016

Fundamental Group And Pluridifferentials On Compact Kahler Manifolds

Yohan Cédric Loup Brunebarbe

A compact Kahler manifold X is shown to be simply connected if its 'symmetric cotangent algebra' is trivial. Conjecturally, such a manifold should even be rationally connected. The relative version is also shown: a proper surjective connected holomorphic m ...

Independent Univ Moscow-Ium2016

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.

Connectez-vous pour utiliser Chat avec Graph Search