Related papers: Optimal stretching for lattice points under convex…
When computing bounds, spatial branch-and-bound algorithms often linearly outer approximate convex relaxations for non-convex expressions in order to capitalize on the efficiency and robustness of linear programming solvers. Considering…
A Poisson point process of unit intensity is placed in the square $[0,n]^2$. An increasing path is a curve connecting $(0,0)$ with $(n,n)$ which is non-decreasing in each coordinate. Its length is the number of points of the Poisson process…
Let $\theta\in\mathbb{R}^d$. We associate three objects to each approximation $(p,q)\in \mathbb{Z}^d\times \mathbb{N}$ of $\theta$: the projection of the lattice $\mathbb{Z}^{d+1}$ to the hyperplane of the first $d$ coordinates along the…
We study vortex stretching for the three-dimensional axisymmetric Euler equations without swirl in vorticity formulation. Danchin (2007) established global existence and uniqueness for bounded vorticity $\omega_0$ provided $\omega_0/r$ lies…
We consider a general model for representing and manipulating parametric curves, in which a curve is specified by a black box mapping a parameter value between 0 and 1 to a point in Euclidean d-space. In this model, we consider the…
The problem that we consider is the following: given an $n \times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must…
We consider the problem of determining the optimal block (or subsample) size for a spatial subsampling method for spatial processes observed on regular grids. We derive expansions for the mean square error of the subsampling variance…
We investigate the sharp endpoint extension inequality for the moment curve in finite fields. We determine the optimal constant and characterize the maximizers in two complementary regimes: (i) low dimensions $d\leq 20$; (ii) large field…
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…
For $p\ge 2$, and $\lambda>\max\{n|\tfrac 1p-\tfrac 12|-\tfrac12, 0\}$, we prove the pointwise convergence of cone multipliers, i.e. $$ \lim_{t\to\infty}T_t^\lambda(f)\to f \text{ a.e.},$$ where $f\in L^p(\mathbb R^n)$ satisfies $supp\…
We consider the problem of maximizing the first eigenvalue of the $p$-laplacian (possibly with non-constant coefficients) over a fixed domain $\Omega$, with Dirichlet conditions along $\partial\Omega$ and along a supplementary set $\Sigma$,…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
``Completeness'' (i.e. probability conservation) is not usually satisfied in the cumulant expansion of the Anderson lattice when a reduced state space is employed for $U\to \infty $. To understand this result, the well known ``Chain''…
In this paper, we continue the study of three close factorizations of an integer and correct a mistake of a previous result. This turns out to be related to lattice points close to the center point $(\sqrt{N}, \sqrt{N})$ of the hyperbola $x…
We prove the existence of an open set minimizing the first Dirichlet eigenvalue of an elliptic operator with bounded, measurable coefficients, over all open sets of a given measure. Our proof is based on a free boundary approach: we…
Optimal geometrical arrangements, such as the stacking of atoms, are of relevance in diverse disciplines. A classic problem is the determination of the optimal arrangement of spheres in three dimensions in order to achieve the highest…
We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…
The lattice size of a lattice polygon $P$ was introduced and studied by Schicho, and by Castryck and Cools in relation to the problem of bounding the total degree and the bi-degree of the defining equation of an algebraic curve. In this…
The goal of the present work is three-fold. The first goal is to set foundational results on optimal transport in Lorentzian (pre-)length spaces, including cyclical monotonicity, stability of optimal couplings and Kantorovich duality…
Motivated by the applications of routing in PCB buses, the Rectangle Escape Problem was recently introduced and studied. In this problem, we are given a set of rectangles $\mathcal{S}$ in a rectangular region $R$, and we would like to…