Publications related to Limit set

Strong Subconvexity for Self-Dual GL(3) L-Functions

Yongxiao Lin, Ramon Moreira Nunes, Zhi Qi

In this paper, we prove strong subconvexity bounds for self-dual GL(3) L-functions in the t-aspect and for GL(3) x GL(2) L-functions in the GL(2)-spectral aspect. The bounds are strong in the sense that they are the natural limit of the moment method pione ...

OXFORD UNIV PRESS2022

Learning dynamical systems with bifurcations

Aude Billard, Farshad Khadivar, Ilaria Lauzana

Trajectory planning through dynamical systems (DS) provides robust control for robots and has found numerous applications from locomotion to manipulation. However, to date, DS for controlling rhythmic patterns are distinct from DS used to control point to ...

2021

Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problem

Lenka Zdeborová, Francesca Mignacco

In this paper we investigate how gradient-based algorithms such as gradient descent (GD), (multi-pass) stochastic GD, its persistent variant, and the Langevin algorithm navigate non-convex loss-landscapes and which of them is able to reach the best general ...

IOP PUBLISHING LTD2021

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Shaul Nadav Hallak

This paper introduces a method for computing points satisfying the second-order necessary optimality conditions for nonconvex minimization problems subject to a closed and convex constraint set. The method comprises two independent steps corresponding to t ...

SPRINGER/PLENUM PUBLISHERS2020

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

Search for B -> h nu(nu)over-bar decays with semileptonic tagging at Belle

Olivier Schneider, Yiming Li, Mingkui Wang, Chao Wang, Tagir Aushev, Sun Hee Kim, Tara Nanut, Jun Yong Kim, Ji Hyun Kim, Donghyun Kim, Dipanwita Dutta

We present the results of a search for the rare decays B -> h nu(nu) over bar, where h stands for K+, K-S(0), K*(+); K*(0); pi(+); pi(0), rho(+) and rho(0). The results are obtained with 772 x 10(6) B (B) over bar pairs collected with the Belle detector at ...

Amer Physical Soc2017

Accurate thermal conductivities from optimally short molecular dynamics simulations

Aris Marcolongo, Loris Ercole

The evaluation of transport coefficients in extended systems, such as thermal conductivity or shear viscosity, is known to require impractically long simulations, thus calling for a paradigm shift that would allow to deploy state-of-the-art quantum simulat ...

Nature Publishing Group2017

A self-consistent model for the saturation dynamics of the vortex shedding around the mean flow in the unstable cylinder wake

François Gallaire, Cristobal Manuel Arratia Martinez, Vladislav Mantic Lugo

The supercritical instability leading to the Benard-von Karman vortex street in a cylinder wake is a well known example of supercritical Hopf bifurcation: the steady solution becomes linearly unstable and saturates into a periodic limit cycle. Nonetheless, ...

Amer Inst Physics2015

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.

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

Limit set

Dynamical system approach to navigation around obstacles

Strong Subconvexity for Self-Dual GL(3) L-Functions

Automatic locking of a parametrically resonating, base-excited, nonlinear beam

Learning dynamical systems with bifurcations

Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problem

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Search for B -> h nu(nu)over-bar decays with semileptonic tagging at Belle

Accurate thermal conductivities from optimally short molecular dynamics simulations

A self-consistent model for the saturation dynamics of the vortex shedding around the mean flow in the unstable cylinder wake

Graph Chatbot

Chat with Graph Search

Strong Subconvexity for Self-Dual GL(3) L-Functions

Accurate thermal conductivities from optimally short molecular dynamics simulations

Automatic locking of a parametrically resonating, base-excited, nonlinear beam

A self-consistent model for the saturation dynamics of the vortex shedding around the mean flow in the unstable cylinder wake

Finding Second-Order Stationary Points in Constrained Minimization: A Feasible Direction Approach

Search for B -> h nu(nu)over-bar decays with semileptonic tagging at Belle

Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problem

Rationally almost periodic sequences, polynomial multiple recurrence and symbolic dynamics

Dynamical system approach to navigation around obstacles

Learning dynamical systems with bifurcations