Concept

Polynôme de Laguerre

Publications associées (84)

Single and multiple recurrence along non-polynomial sequences

We establish new recurrence and multiple recurrence results for a rather large family of non-polynomial functions which contains tempered functions and (non-polynomial) functions from a Hardy field with polynomial growth. In particular, we show that, somew ...

2020

Multiple ergodic averages along functions from a Hardy field: convergence, recurrence and combinatorial applications

Florian Karl Richter

We obtain new results pertaining to convergence and recurrence of multiple ergodic averages along functions from a Hardy field. Among other things, we confirm some of the conjectures posed by Frantzikinakis in [Fra10; Fra16] and obtain combinatorial applic ...

2020

A gyrokinetic model for the plasma periphery of tokamak devices

Paolo Ricci, Paolo De Los Rios, Rogério Manuel Cabete De Jesus Jorge, Baptiste Jimmy Frei

A gyrokinetic model is presented that can properly describe large and small amplitude electromagnetic fluctuations occurring on scale lengths ranging from the electron Larmor radius to the equilibrium perpendicular pressure gradient scale length, and the a ...

2020

A gyrokinetic model for the plasma periphery of fusion devices

Paolo Ricci, Rogério Manuel Cabete De Jesus Jorge, Baptiste Jimmy Frei

Understanding the turbulent dynamics of the plasma in the periphery of fusion devices - the region extending from the external part of the closed flux surface region to the scrape-off layer - is of crucial importance on the way to fusion energy. Indeed, th ...

2019

Discontinuous Galerkin Discretizations of the Boltzmann Equations in 2D: semi-analytic time stepping and absorbing boundary layers

Jan Sickmann Hesthaven

We present an efficient nodal discontinuous Galerkin method for approximating nearly incompressible flows using the Boltzmann equations. The equations are discretized with Hermite polynomials in velocity space yielding a first order conservation law. A sta ...

2019

A generalization of Kátai's orthogonality criterion with applications

Florian Karl Richter

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of Kátai's orthogonality cri ...

2019

Option pricing with orthogonal polynomial expansions

Damir Filipovic, Damien Edouard Ackerer

We derive analytic series representations for European option prices in polynomial stochastic volatility models. This includes the Jacobi, Heston, Stein-Stein, and Hull-White models, for which we provide numerical case studies. We find that our polynomial ...

WILEY2019

Cryptanalysis of Plantlet

Subhadeep Banik, Khashayar Barooti

Plantlet is a lightweight stream cipher designed by Mikhalev, Armknecht and Muller in IACR ToSC 2017. It has a Grain-like structure with two state registers of size 40 and 61 bits. In spite of this, the cipher does not seem to lose in security against gene ...

2019

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Characteristic modes of vibration of Q-balls

Andrey Shkerin

In this report, based on [1], we study analytically small perturbations of classically stable Q-balls in 3+1 dimensions. Models with flat and polynomial potentials are considered. We find that large Q-balls in the model with the flat potential possess soft ...

EDP SCIENCES2018

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