English
Related papers

Related papers: Approximate modularity: Kalton's constant is not s…

200 papers

The upper estimates for the optimal constants of the multilinear Bohnenblust--Hille inequality obtained in [J. Funct. Anal. 264 (2013), 429--463] are here improved to: {0.1cm} {enumerate} For real scalars:…

Functional Analysis · Mathematics 2013-02-05 D. Nunez-Alarcon , D. Pellegrino , J. B. Seoane-Sepulveda , D. M. Serrano-Rodriguez

For a finite abelian group $G$ with $\exp(G)=n$ and an integer $k\ge 2$, Balachandran and Mazumdar \cite{BM} introduced the extremal function $\fD_G(k)$ which is defined to be $\min\{|A|: \emptyset \neq A\subseteq[1,n-1]\textrm{\ with\…

Combinatorics · Mathematics 2019-12-17 Niranjan Balachandran , Eshita Mazumdar

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

We obtain all extreme and exposed points of the closed unit ball of the space of bilinear forms $T:\ell_{\infty}^{2}\times\ell_{\infty}^{2}\rightarrow \mathbb{R}.$ We also show that any (norm one) bilinear form $T:\ell_{\infty…

Functional Analysis · Mathematics 2016-08-04 Wasthenny Cavalcante , Daniel Pellegrino

In this paper we slightly improve the regularity theory for the so called optimal design problem. We first establish the uniform rectifiability of the boundary of the optimal set, for a larger class of minimizers, in any dimension. As an…

Optimization and Control · Mathematics 2025-05-29 Lorenzo Lamberti , Antoine Lemenant

In 1991, J. Thomson obtained celebrated structural results for $P^t(\mu).$ Later, J. Brennan (2008) generalized Thomson's theorem to $R^t(K,\mu)$ when the diameters of the components of $\mathbb C\setminus K$ are bounded below. The results…

Functional Analysis · Mathematics 2022-12-13 John B. Conway , Liming Yang

We continue the investigation into the computational status of the existence of moduli of regularity (and their use for rates of convergence) in the sense of Kohlenbach, Lopez and Nicolae (2019), carried out w.r.t. classical reverse…

Logic in Computer Science · Computer Science 2026-03-05 Ulrich Kohlenbach

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv

For a tuple $T$ of Hilbert space operators, the 'commuting dilation constant' is the smallest number $c$ such that the operators of $T$ are a simultaneous compression of commuting normal operators of norm at most $c$. We present numerical…

Functional Analysis · Mathematics 2026-03-17 Malte Gerhold , Marcel Scherer , Orr Shalit

Taking into account four universal constants, namely the Planck's constant $h$, the velocity of light $c$, the constant of gravitation $G$ and the Boltzmann's constant $k$ leads to structuring theoretical physics in terms of three theories…

High Energy Physics - Theory · Physics 2009-10-11 G. Cohen-Tannoudji

Let $f \geq 0$ be operator monotone on $[0, \infty)$. In this paper we prove that for any unitarily-invariant norm $|||-|||$ on $M_n(\mathbb{C})$ and matrices $A, B, X \in M_n(\mathbb{C})$ with $A, B \geq 0$ and $|||X||| \leq 1$,…

Functional Analysis · Mathematics 2023-11-30 David Herrera

A conjecture of Kadison and Kastler from 1972 asks whether sufficiently close operator algebras in a natural uniform sense must be small unitary perturbations of one another. For $n\geq 3$ and a free ergodic probability measure preserving…

Operator Algebras · Mathematics 2015-08-26 Jan Cameron , Erik Christensen , Allan M. Sinclair , Roger R. Smith , Stuart White , Alan D. Wiggins

The research problem in this work is the relaxation of maximizing non-negative submodular plus modular with the entire real number domain as its value range over a family of down-closed sets. We seek a feasible point $\mathbf{x}^*$ in the…

Data Structures and Algorithms · Computer Science 2022-04-13 Xin Sun , Chenchen Wu , Dachuan Xu , Yang Zhou

We prove that, for every rational $d\ne 0,\pm 1$ and every compact set $K\subset\{s\in\mathbb{C}:1/2<\Re(s)<1\}$ with connected complement, any analytic non-vanishing functions $f_1,f_2$ on $K$ can be approximated, uniformly on $K$, by the…

Number Theory · Mathematics 2015-03-25 Łukasz Pańkowski

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

Number Theory · Mathematics 2014-08-12 Mark Lewko , Maksym Radziwill

For $1\le t < \infty$, a compact subset $K\subset\mathbb C$, and a finite positive measure $\mu$ supported on $K$, $R^t(K, \mu)$ denotes the closure in $L^t(\mu)$ of rational functions with poles off $K$. Conway and Yang (2019) introduced…

Functional Analysis · Mathematics 2019-11-20 Liming Yang

The main result of this paper shows that "test configurations" give new lower bounds on the $L^{2}$ norm of the scalar curvature on a Kahler manifold. This is closely analogous to the analysis of the Yang-Mills functional over Riemann…

Differential Geometry · Mathematics 2007-05-23 S. K. Donaldson

Let $u\not\equiv -\infty$ be a subharmonic function on the complex plane $\mathbb C$. In 2016, we obtained a result on the existence of an entire function $f\neq 0$ satisfying the estimate $\log|f|\leq {\sf B}_u$ on $\mathbb C$, where…

Complex Variables · Mathematics 2020-04-27 Bulat N. Khabibullin

Let $K$ be a convex body in $\mathbb{R}^n$ and $f : \partial K \rightarrow \mathbb{R}_+$ a continuous, strictly positive function with $\int\limits_{\partial K} f(x) d \mu_{\partial K}(x) = 1$. We give an upper bound for the approximation…

Metric Geometry · Mathematics 2017-07-07 Julian Grote , Elisabeth M. Werner

Submodularity is one of the most important properties in combinatorial optimization, and $k$-submodularity is a generalization of submodularity. Maximization of a $k$-submodular function requires an exponential number of value oracle…

Data Structures and Algorithms · Computer Science 2019-07-31 Hiroki Oshima