Concept

Null set

Related publications (115)

Stability of the Faber-Krahn inequality for the short-time Fourier transform

We prove a sharp quantitative version of the Faber–Krahn inequality for the short-time Fourier transform (STFT). To do so, we consider a deficit which measures by how much the STFT of a function fails to be optimally concentrated on an arbitrary set of pos ...

Springer Heidelberg2024

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano, Paolo Luzzini

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Diffusion in Style

Sabine Süsstrunk, Radhakrishna Achanta, Mahmut Sami Arpa, Martin Nicolas Everaert

We present Diffusion in Style, a simple method to adapt Stable Diffusion to any desired style, using only a small set of target images. It is based on the key observation that the style of the images generated by Stable Diffusion is tied to the initial lat ...

2023

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

Hoài-Minh Nguyên, Jean Louis-Alexandre Fornerod

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...

2021

Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution

Daniel Kuhn, Soroosh Shafieezadeh Abadeh, Bahar Taskesen

Semi-discrete optimal transport problems, which evaluate the Wasserstein distance between a discrete and a generic (possibly non-discrete) probability measure, are believed to be computationally hard. Even though such problems are ubiquitous in statistics, ...

2021

Model-Based Interpretation of Measurements for Fatigue Evaluation of Existing Reinforced Concrete Bridges

Ian Smith, Eugen Brühwiler, Sai Ganesh Sarvotham Pai, Imane Bayane

New methods are required for sustainable and economical management of bridges. Efficient management can be achieved by a detailed understanding of bridge behavior through monitoring and model-based data interpretation. This paper presents a methodology to ...

2021

Guidelines for performing lignin-first biorefining

Jeremy Luterbacher, Feng Wang

The valorisation of the plant biopolymer lignin is now recognised as essential to enabling the economic viability of the lignocellulosic biorefining industry. In this context, the "lignin-first" biorefining approach, in which lignin valorisation is conside ...

ROYAL SOC CHEMISTRY2021

On the constancy theorem for anisotropic energies through differential inclusions

Riccardo Tione

In this paper we study stationary graphs for functionals of geometric nature defined on currents or varifolds. The point of view we adopt is the one of differential inclusions, introduced in this context in the recent papers (De Lellis et al. in Geometric ...

2021

Chirok: a post-refinement tool to analyse absolute structure

Philip Pattison

Chirok is software for a post-refinement test of the absolute structure. The software allows a user to calculate a distribution of the measure of chirality based on intensity quotients and linked to the Flack parameter. The distribution is fitted by a set ...

2020

Zero-one laws for eventually always hitting points in in rapidly mixing systems

Florian Karl Richter

In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on systems where trans ...

2020

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.