Concept

Interval (mathematics)

Related publications (34)

Unlikely intersections on the p-adic formal ball

We investigate generalizations along the lines of the Mordell-Lang conjecture of the author's p-adic formal Manin-Mumford results for n-dimensional p-divisible formal groups F. In particular, given a finitely generated subgroup (sic) of F(Q(p)) and a close ...

SPRINGER INT PUBL AG2023

Typicality results for weak solutions of the incompressible Navier-Stokes equations

Maria Colombo, Luigi De Rosa, Massimo Sorella

In this work we show that, in the class of L-infinity((0,T); L-2(T-3)) distributional solutions of the incompressible Navier-Stokes system, the ones which are smooth in some open interval of times are meagre in the sense of Baire category, and the Leray on ...

EDP SCIENCES S A2022

Functional estimation of anisotropic covariance and autocovariance operators on the sphere

Victor Panaretos, Julien René Pierre Fageot, Matthieu Martin Jean-André Simeoni, Alessia Caponera

We propose nonparametric estimators for the second-order central moments of possibly anisotropic spherical random fields, within a functional data analysis context. We consider a measurement framework where each random field among an identically distribute ...

2022

MATHICSE Technical Report: Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

Fabio Nobile, Yoshihito Kazashi

An existence result is presented for the dynamical low rank (DLR) approximation for random semi-linear evolutionary equations. The DLR solution approximates the true solution at each time instant by a linear combination of products of deterministic and sto ...

MATHICSE2020

Existence of dynamical low rank approximations for random semi-linear evolutionary equations on the maximal interval

Fabio Nobile, Yoshihito Kazashi

2020

An Inertial Parallel and Asynchronous Forward-Backward Iteration for Distributed Convex Optimization

Colin Neil Jones, Georgios Stathopoulos

Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...

SPRINGER/PLENUM PUBLISHERS2019

Path properties of the solution to the stochastic heat equation with Levy noise

Robert Dalang, Carsten Hao Ye Chong, Thomas Marie Jean-Baptiste Humeau

We consider sample path properties of the solution to the stochastic heat equation, in Rd or bounded domains of Rd, driven by a Levy space-time white noise. When viewed as a stochastic process in time with values in an infinite-dimensional space, the solut ...

SPRINGER2019

Hill chart modelling using the Hermite polynomial chaos expansion for the performance prediction of pumps running as turbines

François Avellan, Loïc Andolfatto, João Nuno Gomes Borga Delgado

Pumps running as turbines are suitable hydraulic machines for micro hydropower applications. The selection of the proper pumps to install in a given site still remains a major challenge, as pump manufacturers do not provide the characteristic curves data i ...

2019

A Stability Theorem On Cube Tessellations

János Pach

It is shown that if a d-dimensional cube is decomposed into n cubes, the side lengths of which belong to the interval (1 - n1/d+1; 1], then n is a perfect d-th power and all cubes are of the same size. This result is essentially tight. ...

CARLETON UNIV, DEPT MATHEMATICS & STATISTICS2018

Stochastic partial differential equations driven by Lévy white noises

Thomas Marie Jean-Baptiste Humeau

We study various aspects of stochastic partial differential equations driven by Lévy white noise. This driving noise, which is a generalization of Gaussian white noise, can be viewed either as a generalized random process or as an independently scattered r ...

EPFL2017

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.