English
Related papers

Related papers: Extremal Problems for GCDs and LCMs in Higher Dime…

200 papers

Relatively supercuspidal representations are analogue of supercuspidal representations in the relative Langlands program. This work studies relatively supercuspidal representations using top degree Ext-groups via the Schneider-Stuhler…

Number Theory · Mathematics 2025-03-04 Li Cai , Yangyu Fan

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error…

Machine Learning · Computer Science 2012-07-02 Dongryeol Lee , Alexander G. Gray

By formulating the inverse problem of partial differential equations (PDEs) as a statistical inference problem, the Bayesian approach provides a general framework for quantifying uncertainties. In the inverse problem of PDEs, parameters are…

Numerical Analysis · Mathematics 2026-02-10 Haoyu Lu , Junxiong Jia , Deyu Meng

We give an FPTAS for computing the number of matchings of size $k$ in a graph $G$ of maximum degree $\Delta$ on $n$ vertices, for all $k \le (1-\delta)m^*(G)$, where $\delta>0$ is fixed and $m^*(G)$ is the matching number of $G$, and an…

Data Structures and Algorithms · Computer Science 2021-08-04 Vishesh Jain , Will Perkins , Ashwin Sah , Mehtaab Sawhney

In the Max-k-diameter problem, we are given a set of points in a metric space, and the goal is to partition the input points into k parts such that the maximum pairwise distance between points in the same part of the partition is minimized.…

Computational Geometry · Computer Science 2024-04-08 Henry Fleischmann , Kyrylo Karlov , Karthik C. S. , Ashwin Padaki , Stepan Zharkov

Consider a random matrix $H:\mathbb{R}^n\longrightarrow\mathbb{R}^m$. Let $D\geq2$ and let $\{W_l\}_{l=1}^{p}$ be a set of $k$-dimensional affine subspaces of $\mathbb{R}^n$. We ask what is the probability that for all $1\leq l\leq p$ and…

Functional Analysis · Mathematics 2013-08-14 Alon Dmitriyuk , Yehoram Gordon

Geometric (also known as spatial) quantiles, introduced by Chaudhury and representing one of the three principal approaches to defining multivariate quantiles, have been well studied in the literature. In this work, we focus on the extremal…

Statistics Theory · Mathematics 2026-03-05 Sibsankar Singha , Marie Kratz , Sreekar Vadlamani

Necessary conditions for existence of normal extremals in optimal control of systems subject to nonholonomic constraints are derived as solutions of a constrained second order variational problems. In this work, a geometric interpretation…

Optimization and Control · Mathematics 2017-02-08 Leonardo Colombo

We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

Number Theory · Mathematics 2023-04-07 Chiara Bellotti , Andrew Yang

In Bayesian inference, a widespread technique to compute integrals against a high-dimensional posterior is to use a Gaussian proxy to the posterior known as the Laplace approximation. We address the question of accuracy of the approximation…

Statistics Theory · Mathematics 2024-06-07 Anya Katsevich

We develop a principled way of identifying probability distributions whose independent and identically distributed (iid) realizations are compressible, i.e., can be well-approximated as sparse. We focus on Gaussian random underdetermined…

Statistics Theory · Mathematics 2012-04-27 Rémi Gribonval , Volkan Cevher , Mike E. Davies

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

Combinatorics · Mathematics 2025-10-08 Zijie Gu

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

Combinatorics · Mathematics 2014-02-25 Antal Balog , Oliver Roche-Newton

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

Number Theory · Mathematics 2020-02-28 Qinghai Zhong

We consider finite element solutions to optimization problems, where the state depends on the possibly constrained control through a linear partial differential equation. Basing upon a reduced and rescaled optimality system, we derive a…

Numerical Analysis · Mathematics 2025-03-18 Fernando Gaspoz , Christian Kreuzer , Andreas Veeser , Winnifried Wollner

We consider the existence and uniqueness of a minimizer of the extremal problem for weighted combined energy between two concentric annuli and obtain that the extremal mapping is a certain radial mapping. Meanwhile, this in turn implies a…

Complex Variables · Mathematics 2024-01-19 Xiaogao Feng , Ruyue Tang , Ting Peng

We study extensions of the GD tensor inverse using the M-product. The aim of current research is threefold. In the first place, the tensor GD inverse under the M-product is introduced and considered. We give the several properties and…

Numerical Analysis · Mathematics 2024-12-10 Hongwei Jin , Siran Chen , Shaowu Huang , Predrag S. Stanimirović

We describe an extremal property of the hexagonal lattice $\Lambda \subset \mathbb{R}^2$. Let $p$ denote the circumcenter of its fundamental triangle (a so-called deep hole) and let $A_r$ denote the set of lattice points that are at…

Metric Geometry · Mathematics 2019-08-27 Markus Faulhuber , Stefan Steinerberger

We study multivariate linear tensor product problems with some special properties in the worst case setting. We consider algorithms that use finitely many continuous linear functionals. We use a unified method to investigate tractability of…

Numerical Analysis · Mathematics 2024-12-20 Rong Guo , Heping Wang

The $k$-center problem is to choose a subset of size $k$ from a set of $n$ points such that the maximum distance from each point to its nearest center is minimized. Let $Q=\{Q_1,\ldots,Q_n\}$ be a set of polygons or segments in the…

Computational Geometry · Computer Science 2023-06-22 Vahideh Keikha , Sepideh Aghamolaei , Ali Mohades , Mohammad Ghodsi