Related papers: Small cap decouplings
We extend previous work on the two-dimensional developable tangent surface to its higher dimensional analogues $\mathfrak{M} \subset \mathbb{R}^{n+1}$. The approach here similarly applies cylindrical approximate decoupling at its core,…
In communication networks, optimization is essential in enhancing performance metrics, e.g., network utility. These optimization problems often involve sum-of-products (or ratios) terms, which are typically non-convex and NP-hard, posing…
The computation of tunes and matched beam distributions are essential steps in the analysis of circular accelerators. If certain symmetries - like midplane symmetrie - are present, then it is possible to treat the betatron motion in the…
We consider the problem of sampling from the posterior distribution of a $d$-dimensional coefficient vector $\boldsymbol{\theta}$, given linear observations $\boldsymbol{y} = \boldsymbol{X}\boldsymbol{\theta}+\boldsymbol{\varepsilon}$. In…
We give some useful decompositions of sum-of-powers statistics, leading to decompositions for the sample mean, sample variance, sample skewness and sample kurtosis. We solve two related problems: computing these sample moments for a pooled…
The Dirichlet Laplacian in a curved three-dimensional tube built along a spatial (bounded or unbounded) curve is investigated in the limit when the uniform cross-section of the tube diminishes. Both deformations due to bending and twisting…
We introduce small cap square function estimates for parabola and cone, and prove the sharp estimates. More precisely, we study the inequalities of form \[ \|f\|_p\le C_{\alpha,p}(R)…
Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…
We study the construction and convergence of decoupling multistep schemes of higher order using the backward differentiation formulae for an elliptic-parabolic problem, which includes multiple-network poroelasticity as a special case. These…
Both complete decoupling and tangent decoupling are classical tools aiming to compare two random processes where one has a weaker dependence structure. We give a new proof for the complete decoupling inequality, which provides a lower bound…
We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users…
The subdiffusion model that involves a Caputo fractional derivative in time is widely used to describe anomalously slow diffusion processes. In this work we aim at recovering the locations of small conductivity inclusions in the model from…
We revisit the problem of finding small $\epsilon$-separation keys introduced by Motwani and Xu (2008). In this problem, the input is $m$-dimensional tuples $x_1,x_2,\ldots,x_n $. The goal is to find a small subset of coordinates that…
Due to the explosive growth of large-scale data sets, tensors have been a vital tool to analyze and process high-dimensional data. Different from the matrix case, tensor decomposition has been defined in various formats, which can be…
We give a new proof of $l^2$ decoupling for the parabola inspired from efficient congruencing. Making quantitative this proof matches a bound obtained by Bourgain for the discrete restriction problem for the parabola. We illustrate…
In this paper, we present a geometric approach to exponentially small splitting in zero-Hopf bifurcations of arbitrary co-dimension. In further details, we consider a family of problems that generalizes the third order…
For the iterative decoupling of elliptic-parabolic problems such as poroelasticity, we introduce time discretization schemes up to order $5$ based on the backward differentiation formulae. Its analysis combines techniques known from…
An improved estimate is obtained for the mean square of the modulus of the zeta function on the critical line. It is based on the decoupling techniques in harmonic analysis developed in [B-D]
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
We prove first-order convergence of the semi-explicit Euler scheme combined with a finite element discretization in space for elliptic-parabolic problems which are weakly coupled. This setting includes poroelasticity, thermoelasticity, as…