We extend the group-theoretic notion of conditional flatness for a localization functor to any pointed category, and investigate it in the context of homological categories and of semi-abelian categories. In the presence of functorial fiberwise localizatio ...
In this thesis, we give a modern treatment of Dwyer's tame homotopy theory using the language of ∞-categories.
We introduce the notion of tame spectra and show it has a concrete algebraic description.
We then carry out a study of ∞-operads an ...
This contribution explores the combined capabilities of reduced basis methods and IsoGeometric Analysis (IGA) in the context of parameterized partial differential equations. The introduction of IGA enables a unified simulation framework based on a single g ...
We use birational geometry to show that the existence of rational points on proper rationally connected varieties over fields of characteristic 0 is a consequence of the existence of rational points on terminal Fano varieties. We discuss several consequenc ...
Let X /S be a flat algebraic stack of finite presentation. We define a new & eacute;tale fundamental pro-groupoid pi(1)(X /S), generalizing Grothendieck's enlarged & eacute;tale fundamental group from SGA 3 to the relative situation. When S is of equal pos ...
The immobilization of molecular catalysts imposes spatial constraints on their active site. We reveal that in bifunctional catalysis such constraints can also be utilized as an appealing handle to boost intrinsic activity through judicious control of the a ...
Because of their robustness, efficiency, and non intrusiveness, Monte Carlo methods are probably the most popular approach in uncertainty quantification for computing expected values of quantities of interest. Multilevel Monte Carlo (MLMC) methods signific ...
We consider a least-squares/relaxation finite element method for the numerical solution of the prescribed Jacobian equation. We look for its solution via a least-squares approach. We introduce a relaxation algorithm that decouples this least-squares proble ...
Unrefinement is a tool that allows to perform faster numerical simulations by controlling the level of precision in the specified area. We introduce an algorithm that creates a coarser geometry from an initial regular geometry, which is represented with re ...
We present GeoNeRF, a generalizable photorealistic novel view synthesis method based on neural radiance fields. Our approach consists of two main stages: a geometry reasoner and a renderer. To render a novel view, the geometry reasoner first constructs cas ...
