Publications related to Interval (mathematics)

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, Massimo Sorella, Luigi De Rosa

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

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

Stochastic partial differential equations driven by Lévy white noises : generalized random processes, random field solutions and regularity

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

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Maria Walczak

Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...

Cambridge Univ Press2016

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Charles Stuart

We consider bifurcation from the line of trivial solutions for a nonlinear eigenvalue problem on a bounded open subset, Omega, of R-N with N >= 3, containing 0. The leading term is a degenerate elliptic operator of the form L(u) = del . A del u where A is ...

Pergamon-Elsevier Science Ltd2015

Elliptic equations with general singular lower order term and measure data

Linda Maria De Cave

In this paper we study a nonlinear elliptic boundary value problem with a general singular lower order term, whose model is {-Delta u = H(u)mu, in Omega, u = 0 on partial derivative Omega, u > 0 on Omega, where Omega is an open bounded subset of R-N, mu is ...

Pergamon-Elsevier Science Ltd2015

On Handling Cost Gradient Uncertainty in Real-Time Optimization

Dominique Bonvin, Timm Faulwasser, Martand Singhal

This paper deals with the real-time optimization of uncertain plants and proposes an approach based on surrogate models to reach the plant optimum when the plant cost gradient is imperfectly known. It is shown that, for processes with only box constraints, ...

2015

Ecomorphodynamic approaches to river anabranching patterns

Paolo Perona, Benoît Crouzy

We investigate the influence of vegetation on river morphological instabilities using an analytical framework. We first discuss the important role of the hydrological (flooding frequency) and biological (vegetation development rate) timescales. As long as ...

Elsevier2016

Sound Compilation of Reals

Viktor Kuncak, Eva Darulova

Writing accurate numerical software is hard because of many sources of unavoidable uncertainties, including finite numerical precision of implementations. We present a programming model where the user writes a program in a real-valued implementation and sp ...

ACM2014

Odd linking and bifurcation in gaps: the weakly indefinite case

In this paper, we consider nonlinear Schrodinger equations of the following type: -Delta u(x) + V (x) u(x) -q(x)|u(x)|sigma u(x) =lambda u(x), x is an element of R-N, u is an element of H-1(R-N) \ {0}, where N >= 2 and sigma > 0. We concentrate on situatio ...

Royal Society of Edinburgh Scotland Foundation, Cambridge2013

The Exact Hausdorff Measure of the Zero Set of Fractional Brownian Motion

Thomas Mountford, Driss Baraka

Let {X(t), t is an element of R-N} be a fractional Brownian motion in R-d of index H. If L(0,I) is the local time of X at 0 on the interval I subset of R-N, then there exists a positive finite constant c(=c(N,d,H)) such that ...

Springer US2011

Measuring shape rectangularity

Dragisa Zunic

A new method for measuring shape rectangularity is introduced. The new shape measure is invariant with respect to similarity transformations, ranges over the interval (0,1] and picks the value 1 if and only if the measured shape is a rectangle. The measure ...

2011

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

A Divide-and-Conquer Approach for Solving Interval Algebra Networks

Jingshi Li

Deciding consistency of constraint networks is a fundamental problem in qualitative spatial and temporal reasoning. In this paper we introduce a divide-and-conquer method that recursively partitions a given problem into smaller sub-problems in deciding con ...

2009

Interval propagation and search on directed acyclic graphs for numerical constraint solving

Xuan-Ha Vu

The fundamentals of interval analysis on directed acyclic graphs (DAGs) for global optimization and constraint propagation have recently been proposed in Schichl and Neumaier (J. Global Optim. 33, 541-562, 2005). For representing numerical problems, the au ...

Springer US2009

Some coloring and walking problems in graphs

Benjamin Leroy-Beaulieu

Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...

EPFL2008

Inversion de Fourier ponctuelle

Emanuel Enrico Seifert

Let f be an integrable function on RN, a a point in RN and B a complex number. If the mean value of f on the sphere of centre a and radius r tends to B when r tends to 0, we show that the Fourier integral at a of f is summable to B in Cesàro means of order ...

EPFL2007

Global continuation for ODE systems over the half-line and study of von Kármán's swirling flow problem

Gilles Evéquoz

This work is concerned with the global continuation for solutions (λ,u,ξ) ∈ R × C1{0}([0,∞), RN) × Rk of the following system of ordinary differential equations: where F: [0,∞) × RN × U × J → RN and φ: U × J → X1, for some open sets J ⊂ R and U ⊂ Rk, and w ...

EPFL2007