English
Related papers

Related papers: Bootstrapping partition regularity of linear syste…

200 papers

Let $m,n\ge 2$ be integers. Denote by $M_n$ the set of $n\times n$ complex matrices. Let $\|\cdot\|_{(p,k)}$ be the $(p,k)$ norm on $M_{mn}$ with $1\leq k\leq mn$ and $2<p<\infty$. We show that a linear map $\phi:M_{mn}\rightarrow M_{mn}$…

Functional Analysis · Mathematics 2023-08-24 Zejun Huang , Nung-Sing Sze , Run Zheng

The extremal functional method determines approximate solutions to the constraints of crossing symmetry, which saturate bounds on the space of unitary CFTs. We show that such solutions are characterized by extremality conditions, which may…

High Energy Physics - Theory · Physics 2016-05-27 Sheer El-Showk , Miguel F. Paulos

Consider the following model of strong-majority bootstrap percolation on a graph. Let r be some positive integer, and p in [0,1]. Initially, every vertex is active with probability p, independently from all other vertices. Then, at every…

Combinatorics · Mathematics 2015-03-31 Dieter Mitsche , Xavier Pérez-Giménez , Paweł Prałat

We consider MAP estimators for structured prediction with exponential family models. In particular, we concentrate on the case that efficient algorithms for uniform sampling from the output space exist. We show that under this assumption…

Machine Learning · Computer Science 2012-05-14 Shankar Vembu , Thomas Gartner , Mario Boley

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Number Theory · Mathematics 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into classes of colors and the packed items need to be ordered such…

Optimization and Control · Mathematics 2026-02-13 Fabio Ciccarelli , Alexander Helber , Erik Mühmer

Recently, Dvir, Golovnev, and Weinstein have shown that sufficiently strong lower bounds for linear data structures would imply new bounds for rigid matrices. However, their result utilizes an algorithm that requires an $NP$ oracle, and…

Computational Complexity · Computer Science 2019-10-29 Sivaramakrishnan Natarajan Ramamoorthy , Cyrus Rashtchian

The matrix $A:\mathbb{R}^n \to \mathbb{R}^m$ is $(\delta,k)$-regular if for any $k$-sparse vector $x$, $$ \left| \|Ax\|_2^2-\|x\|_2^2\right| \leq \delta \sqrt{k} \|x\|_2^2. $$ We show that if $A$ is $(\delta,k)$-regular for $1 \leq k \leq…

Statistics Theory · Mathematics 2021-03-10 Shahar Mendelson

It is shown that an elliptic scattering operator $A$ on a compact manifold with boundary with coefficients in the bounded operators of a bundle of Banach spaces of class (HT) and Pisier's property $(\alpha)$ has maximal regularity (up to a…

Analysis of PDEs · Mathematics 2007-05-23 Robert Denk , Thomas Krainer

We prove an integral version of the classical Albert-Brauer-Hasse-Noether theorem regarding quaternion algebras over number fields. Let $\mathfrak A$ be a quaternion algebra over a number field $K$ and assume that $\mathfrak A$ satisfies…

Number Theory · Mathematics 2012-02-14 Benjamin Linowitz

We consider the concatenation of $t$ uniformly random perfect matchings on $2n$ vertices, where the operation of concatenation is inspired by the multiplication of generators of the Brauer algebra $\mathfrak{B}_n(\delta)$. For the resulting…

Probability · Mathematics 2024-10-30 Fabian Burghart , Paul Thévenin

In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and…

Number Theory · Mathematics 2026-05-04 Kathrin Bringmann , Ben Kane , Anubhab Pahari , Larry Rolen

We exhibit a class of "relatively curved" $\vec{\gamma}(t) := (\gamma_1(t),\dots,\gamma_n(t))$, so that the pertaining multi-linear maximal function satisfies the sharp range of H\"{o}lder exponents, \[ \left\| \sup_{r > 0} \ \frac{1}{r}…

Classical Analysis and ODEs · Mathematics 2020-07-28 Ben Krause

We use numerical bootstrap techniques to study correlation functions of traceless symmetric tensors of $O(N)$ with two indexes $t_{ij}$. We obtain upper bounds on operator dimensions for all the relevant representations and several values…

High Energy Physics - Theory · Physics 2023-04-12 Marten Reehorst , Maria Refinetti , Alessandro Vichi

Let $X$ be a normal complex projective variety, $T\subseteq X$ a subvariety, $a\colon X\rightarrow A$ a morphism to an abelian variety such that $\rm{Pic}^0(A)$ injects into $\rm{Pic}^0(T)$ and let $L$ be a line bundle on $X$. Denote by…

Algebraic Geometry · Mathematics 2020-10-28 Miguel Ángel Barja , Rita Pardini , Lidia Stoppino

Let $1 \leq a \leq b$ be integers. A triple of the form $(x,ax+d,bx+2d)$, where $x,d$ are positive integers is called an {\em (a,b)-triple}. The {\em degree of regularity} of the family of all $(a,b)$-triples, denoted dor($a,b)$, is the…

Combinatorics · Mathematics 2007-05-23 Nikos Frantzikinakis , Bruce Landman , Aaron Robertson

Let $A$ be a $C^*$-algebra and $I$ be a closed ideal in $A$. For $x\in A$, its image under the canonical surjection $A\to A/I$ is denoted by $\dot x$, and the spectral radius of $x$ is denoted by $r(x)$. We prove that $$\max\{r(x), \|\dot…

Operator Algebras · Mathematics 2014-01-16 Terry Loring , Tatiana Shulman

Let the dimension $N$ of data and the sample size $T$ tend to $\infty$ with $N/T \to c > 0$. The spectral properties of a sample correlation matrix $\mathbf{C}$ and a sample covariance matrix $\mathbf{S}$ are asymptotically equal whenever…

Statistics Theory · Mathematics 2024-07-11 Yohji Akama , Peng Tian

The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs), given by $d$ variables with $n$ inequality constraints. A constraint is called \emph{redundant}, if…

Data Structures and Algorithms · Computer Science 2016-10-11 Komei Fukuda , May Szedlak

It is shown that the kernel of the BFKL equation for the octet color state of two Reggeized gluons satisfies the strong bootstrap condition in the next-to-leading order. This condition is much more restrictive than the one obtained from the…

High Energy Physics - Phenomenology · Physics 2015-06-25 V. S. Fadin , A. Papa