Related papers: Query-Efficient Fixpoints of $\ell_p$-Contractions

We propose novel high-order algorithms for a class of $\ell_p$-structured non-monotone variational inequalities. In particular, work by Diakonikolas et al. (2021), which introduced the weak Minty variational inequality (weak-MVI) setting,…

We prove a single-value version of Reshetnyak's theorem. Namely, if a non-constant map $f \in W^{1,n}_{\text{loc}}(\Omega, \mathbb{R}^n)$ from a domain $\Omega \subset \mathbb{R}^n$ satisfies the estimate $\lvert Df(x) \rvert^n \leq K…

Consider a sequence of Riemannian manifolds $(M^n_i,g_i)$ with scalar curvatures and entropies bounded below by small constants $R_i,\mu_i \geq-\epsilon_i$. The goal of this paper is to understand notions of convergence and the structure of…

Let $ \lambda ^2 \in \mathbb N $, and in dimensions $ d\geq 5$, let $ A_{\lambda } f (x)$ denote the average of $ f \;:\; \mathbb Z ^{d} \to \mathbb R $ over the lattice points on the sphere of radius $\lambda$ centered at $x$. We prove $…

Let $\mathcal{P}$ be a simple polygon with $m$ vertices and let $P$ be a set of $n$ points inside $\mathcal{P}$. We prove that there exists, for any $\varepsilon>0$, a set $\mathcal{C} \subset P$ of size $O(1/\varepsilon^2)$ such that the…

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

In this present article, we get sufficient conditions for the existence and uniqueness of fixed points and common fixed points for single and double mapping satisfying various contractive conditions within the partially ordered…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

We suggest an approximation for the zero-balanced Appell hypergeometric function $F_1$ near the singular point $(1,1)$. Our approximation can be viewed as a generalization of Ramanujan's approximation for zero-balanced ${_2F_1}$ and is…

For $c\in(1,2)$ we consider the following operators \[ \mathcal{C}_{c}f(x) = \sup_{\lambda \in [-1/2,1/2)}\bigg| \sum_{n \neq 0}f(x-n) \frac{e^{2\pi i\lambda \lfloor |n|^{c} \rfloor}}{n}\bigg|\text{,}\quad \mathcal{C}^{\mathsf{sgn}}_{c}f(x)…

The entanglement entropy of spacetime regions $A$ in odd-dimensional conformal field theories (CFTs) contains a universal constant term, $(-1)^{\frac{d-1}{2}}F(A)$. This quantity can be robustly defined by considering the mutual information…

For Euclidean space ($\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\ell_p$ spaces $1 \le p…

The tensorial equations for non trivial fully interacting fixed points at lowest order in the $\varepsilon$ expansion in $4-\varepsilon$ and $3-\varepsilon$ dimensions are analysed for $N$-component fields and corresponding multi-index…

We use a method of Luczak (arXiv:1212.3231) to investigate the equilibrium distribution of a dynamic routing model on a network. In this model, there are $n$ nodes, each pair joined by a link of capacity $C$. For each pair of nodes, calls…

We prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty)$, for certain multi-parameter polynomial ergodic averages by establishing the corresponding multi-parameter maximal and oscillation inequalities. Our…

An extra-stabilised Morley finite element method (FEM) directly computes guaranteed lower eigenvalue bounds with optimal a priori convergence rates for the bi-Laplace Dirichlet eigenvalues. The smallness assumption…

Eigenmaps are important in analysis, geometry, and machine learning, especially in nonlinear dimension reduction. Approximation of the eigenmaps of a Laplace operator depends crucially on the scaling parameter $\epsilon$. If $\epsilon$ is…

We give a reduction from $(1+\varepsilon)$-approximate Earth Mover's Distance (EMD) to $(1+\varepsilon)$-approximate Closest Pair (CP). As a consequence, we improve the fastest known approximation algorithm for high-dimensional EMD. Here,…

We study edge-labelings of the complete bidirected graph $\overset{\tiny\leftrightarrow}{K}_n$ with functions from the set $[d] = \{1, \dots, d\}$ to itself. We call a cycle in $\overset{\tiny\leftrightarrow}{K}_n$ a fixed-point cycle if…

Recent years have seen great progress in the approximability of fundamental clustering and facility location problems on high-dimensional Euclidean spaces, including $k$-Means and $k$-Median. While they admit strictly better approximation…