English
Related papers

Related papers: Tight lower bound on $|A+\lambda A|$ for algebraic…

200 papers

For any reduced free product $\mathrm{C}^*$-algebra $(A, \varphi) =(A_1, \varphi_1) \star (A_2, \varphi_2)$, we prove a boundary rigidity result for the embedding of $A$ into its associated $\mathrm{C}^*$-algebra $\Delta \mathbf{T}(A,…

Operator Algebras · Mathematics 2018-08-01 Kei Hasegawa

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Combinatorics · Mathematics 2009-07-14 Saugata Basu , Richard Pollack , Marie-Francoise Roy

Rigidity results for asymptotically locally hyperbolic manifolds with lower bounds on scalar curvature are proved using spinor methods related to the Witten proof of the positive mass theorem. The argument is based on a study of the Dirac…

dg-ga · Mathematics 2011-07-21 L. Andersson , M. Dahl

We determine the border subrank of higher order structure tensors of several families of algebras, and in particular obtain the following results. (1) We determine tight bounds on the border subrank of $k$-fold matrix multiplication and…

Algebraic Geometry · Mathematics 2026-04-23 Chia-Yu Chang , Fulvio Gesmundo , Jeroen Zuiddam

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

Combinatorics · Mathematics 2022-06-22 Polona Durcik , Mario Stipčić

The recent proof of the sharp weighted bound for Calder\'on-Zygmund operators has led to much investigation in sharp mixed bounds for operators and commutators, that is, a sharp weighted bound that is a product of at least two different…

Classical Analysis and ODEs · Mathematics 2014-01-10 Theresa C. Anderson , Wendolín Damián

It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…

Classical Analysis and ODEs · Mathematics 2023-04-21 Laurestine Bradford , Hannah Kohut , Yuveshen Mooroogen

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…

Optimization and Control · Mathematics 2015-09-09 Etienne de Klerk , Monique Laurent , Zhao Sun

For integers $1 < k < d-1$ and $r \ge k+2$, we establish new lower bounds on the maximum number of points in $[n]^d$ such that no $r$ lie in a $k$-dimensional affine (or linear) subspace. These bounds improve on earlier results of…

Combinatorics · Mathematics 2025-09-09 Anubhab Ghosal , Ritesh Goenka , Peter Keevash

Let $0\le \alpha \le \beta\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = \alpha$ and $\bar{d}(A+B) = \beta$, where $\underline{d}(A+ B)$ and…

Combinatorics · Mathematics 2022-07-05 Hung Viet Chu

In this paper, we prove a quantitative relative index theorem. It provides a conceptual framework for studying some conjectures and open questions of Gromov on positive scalar curvature. More precisely, we prove a $\lambda$-Lipschitz…

Differential Geometry · Mathematics 2021-06-28 Zhizhang Xie

Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…

Optimization and Control · Mathematics 2017-05-17 Jean-Bernard Lasserre

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…

Data Structures and Algorithms · Computer Science 2016-08-22 Alexandr Andoni , Thijs Laarhoven , Ilya Razenshteyn , Erik Waingarten

Assuming that Siegel zeros exist, we prove a hybrid version of the Chowla and Hardy--Littlewood prime tuples conjectures. Thus, for an infinite sequence of natural numbers $x$, and any distinct integers $h_1,\dots,h_k,h'_1,\dots,h'_\ell$,…

Number Theory · Mathematics 2023-01-13 Terence Tao , Joni Teräväinen

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

Functional Analysis · Mathematics 2009-12-22 Daniel Li , Hervé Queffélec , Luis Rodriguez-Piazza

In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators $Re(\lambda)^\einhalb C(\lambda+A)^{-1}, \qquad Re(\lambda)>0$ on the complex right half plane and weak Lebesgue…

Optimization and Control · Mathematics 2012-06-25 Bernhard Hermann Haak

Consider the discrete maximal function acting on finitely supported functions on the integers, \[ \mathcal{C}_\Lambda f(n) := \sup_{\lambda \in \Lambda} | \sum_{p \in \pm \mathbb{P}} f(n-p) \log |p| \frac{e^{2\pi i \lambda p}}{p} |,\] where…

Classical Analysis and ODEs · Mathematics 2016-05-02 Laura Cladek , Kevin Henriot , Ben Krause , Izabella Laba , Malabika Pramanik

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

Combinatorics · Mathematics 2007-05-23 Ben Green , Terence Tao

We introduce a large cardinal property which is consistent with L and show that for every superatomic Boolean algebra B and every cardinal lambda with the large cardinal property, if tightness^+(B) >= lambda^+, then depth (B) >= lambda.…

Logic · Mathematics 2016-09-07 Saharon Shelah , Otmar Spinas

Let $A = \{0 = a_0 < a_1 < \cdots < a_{\ell + 1} = b\}$ be a finite set of non-negative integers. We prove that the sumset $NA$ has a certain easily-described structure, provided that $N \geqslant b-\ell$, as recently conjectured by Shakan…

Number Theory · Mathematics 2021-04-01 Andrew Granville , Aled Walker