Concept

Stirling numbers of the first kind

Publications associées (19)

New particle formation event detection with Mask R-CNN

Atmospheric new particle formation (NPF) is an important source of climate-relevant aerosol particles which has been observed at many locations globally. To study this phenomenon, the first step is to identify whether an NPF event occurs or not on a given ...

2022

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Florian Karl Richter

A set

R\subset \mathbb{N}

is called rational if it is well approximable by finite unions of arithmetic progressions, meaning that for every

\unicode[STIX]{x1D716}>0

there exists a set

B=\bigcup _{i=1}^{r}a_{i}\mathbb{N}+b_{i}

, where $a_{1},\ldots ,a_ ...

2019

Polynomiality of Hurwitz numbers, Bouchard-Marino conjecture, and a new proof of the ELSV formula

Nicolas Gerson Orantin

In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV formul ...

Academic Press Inc Elsevier Science2015

A Multi-domain Spectral Method for Time-fractional Differential Equations

Jan Sickmann Hesthaven

This paper proposes an approach for high-order time integration within a multi-domain setting for time- fractional differential equations. Since the kernel is singular or nearly singular, two main difficulties arise after the domain decomposition: how to p ...

Elsevier2015

Reconciling Utility with Privacy in Genomics

Jean-Pierre Hubaux, Mathias Jacques Jean-Marc Humbert, Amalio Telenti, Erman Ayday

Direct-to-consumer genetic testing makes it possible for everyone to learn their genome sequences. In order to contribute to medical research, a growing number of people publish their genomic data on the Web, sometimes under their real identities. However, ...

2014

Reconciling Utility with Privacy in Genomics

Jean-Pierre Hubaux, Mathias Jacques Jean-Marc Humbert, Amalio Telenti, Erman Ayday

2014

Designing complexity, The relationship between obsolescence systems and densification strategies for large-scale intermodal hubs in contemporary European cities

Mathieu Louis Pierre Mercuriali

The metropolis can be analysed as an infrastructure in perpetual motion, composed of built elements – the system “hardware” – and social networks – the system “software”. The emergence of an overall city-scale infrastructure composed not of a single unit b ...

LIAT / ENSA Paris Malaquais2013

DynaProg for Scala

Thierry Coppey

Dynamic programming is an algorithmic technique to solve problems that follow the Bellman’s principle: optimal solutions depends on optimal sub-problem solutions. The core idea behind dynamic programming is to memoize intermediate results into matrices to ...

2013

Snakes With an Ellipse-Reproducing Property

Michaël Unser, Philippe Thévenaz, Ricard Delgado Gonzalo, Chandra Sekhar Seelamantula

We present a new class of continuously defined parametric snakes using a special kind of exponential splines as basis functions. We have enforced our bases to have the shortest possible support subject to some design constraints to maximize efficiency. Whi ...

IEEE2012

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

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of

1_{E}

into an almost periodic and a pseudo-random part ...

2020