Concept

Espace dénombrablement compact

Publications associées (49)

NbN films with high kinetic inductance for high-quality compact superconducting resonators

Edoardo Charbon, Pasquale Scarlino, Fabrizio Minganti, Simone Frasca, Marco Scigliuzzo, Vincent Jean Yves Jouanny, Fabian Oppliger, Roberto Musio

Niobium nitride (NbN) is a particularly promising material for quantum technology applications, as it shows the degree of reproducibility necessary for large-scale superconducting circuits. We demonstrate that resonators based on NbN thin films present a o ...

2023

Compact, Spatial-mode-interaction-free, Ultralow-loss, Nonlinear photonic integrated circuits

Tobias Kippenberg, Rui Ning Wang, Xinru Ji, Zheru Qiu, Junqiu Liu, Jijun He

We implement Euler bends to build compact high-Q Si3N4 racetrack microresonators, featuring a small footprint of only 0.21 mm(2) for 19.8 GHz FSR. We demonstrate that these multi-mode microresonators can be operated in the single-mode regime and generate a ...

IEEE2022

Localization errors of the stochastic heat equation

David Jean-Michel Candil

In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space

\R^d.

We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...

EPFL2022

Maximizing friction by liquid flow clogging in confinement

Ignacio Pagonabarraga Mora, Xiaoqi Zhang, Shan Chen

In the nanoscale regime, flow behaviors for liquids show qualitative deviations from bulk expectations. In this work, we reveal by molecular dynamics simulations that plug flow down to nanoscale induces molecular friction that leads to a new flow structure ...

SPRINGER2022

Estimate on the Dimension of the Singular Set of the Supercritical Surface Quasigeostrophic Equation

Maria Carola Colombo, Silja Noëmi Aline Haffter

We consider the SQG equation with dissipation given by a fractional Laplacian of order α

2021

A combinatorial proof of a sumset conjecture of Furstenberg

Florian Karl Richter

We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if

\log r / \log s

is irrational and

X

and

Y

are

\times r

- and

\times s

-invariant subsets of

[0,1]

, respectively, then $\dim_\text{ ...

2021

Experimental Evaluation of Steel Columns under Seismic Hazard-Consistent Collapse Loading Protocols

Dimitrios Lignos

This paper presents results from 21 large-scale experiments on steel columns that examined their collapse behavior as related to steel moment resisting frames (MRFs). The test specimens included wide-flange and square hollow structural shapes (HSS) and wer ...

ASCE-AMER SOC CIVIL ENGINEERS2021

Reaching Paris Agreement Goal through CDR/DAC Development: A Compact OR Model

Marc Vielle, Frédéric Louis François Babonneau, Alain Haurie

A compact operations research (OR) model is proposed to analyse the prospects of meeting the Paris Agreement targets when direct air capture technologies can be used or not. The main features of the model are (i) the representation of the economy and energ ...

2021

Property FW, differentiable structures and smoothability of singular actions

Yash Lodha, Nicolas Matte Bon

We provide a smoothening criterion for group actions on manifolds by singular diffeomorphisms. We prove that if a countable group Gamma has the fixed point property FW for walls (for example, if it has property(T)), every aperiodic action of Gamma by diffe ...

WILEY2020

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...

ELSEVIER SCIENCE BV2019

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