SearcharxivSearch

arXiv subjects

Jose Madrid

Publications and source records attributed to Jose Madrid.

6 recordsLinked to original sources

Carbery's inequality in the Schatten--von Neumann classes

Carbery posed a question of sharpened triangle inequalities for families of operators in the Schatten--von Neumann classes $S_p$, $p\geq 2$. He established a weaker form of the desired estimate for even integer values of $p$. In the commutative setting the corresponding sharp inequality (with optimal exponent $p'=\frac{p}{p-1}$) was recently obtained for all integer $p\geq 2$. In the present work we resolve Carbery's question completely in the non-commutative setting: we prove the sharp inequality $$ \Big\|\sum_{j} T_{j}\Big\|_{S_{p}}\leq \|(\alpha_{ij}^{p'})\|^{1/p'}_{\ell_{2}\to \ell_{2}} \Big( \sum_{j} \|T_{j}\|^{p}_{S_{p}}\Big)^{1/p} $$ for all $p\geq 2$ and all countable sequences of operators $(T_{j}) \subset S_{p}$, where $\alpha_{ij}$ are almost orthogonality coefficients. The proof is based on a block-operator reduction and a complex interpolation of the polar parts of the blocks.

math.FA

Almost-Orthogonality in Lp Spaces: A Case Study with Grok

Carbery proposed the following sharpened form of triangle inequality for many functions: for any $p\ge 2$ and any finite sequence $(f_j)_j\subset L^p$ we have \[ \Big\|\sum_j f_j\Big\|_p \ \le\ \left(\sup_{j} \sum_{k} \alpha_{jk}^{\,c}\right)^{1/p'} \Big(\sum_j \|f_j\|_p^p\Big)^{1/p}, \] where $c=2$, $1/p+1/p'=1$, and $\alpha_{jk}=\sqrt{\frac{\|f_{j}f_{k}\|_{p/2}}{\|f_{j}\|_{p}\|f_{k}\|_{p}}}$. In the first part of this paper we construct a counterexample showing that this inequality fails for every $p>2$. We then prove that if an estimate of the above form holds, the exponent must satisfy $c\le p'$. Finally, at the critical exponent $c=p'$, we establish the inequality for all integer values $p\ge 2$. In the second part of the paper we obtain a sharp three-function bound \[ \Big\|\sum_{j=1}^{3} f_j\Big\|_p \ \le\ \left(1+2\Gamma^{c(p)}\right)^{1/p'} \Big(\sum_{j=1}^{3} \|f_j\|_p^p\Big)^{1/p}, \] where $p \geq 3$, $c(p) = \frac{2\ln(2)}{(p-2)\ln(3)+2\ln(2)}$ and $\Gamma=\Gamma(f_1,f_2,f_3)\in[0,1]$ quantifies the degree of orthogonality among $f_1,f_2,f_3$. The exponent $c(p)$ is optimal, and improves upon the power $r(p) = \frac{6}{5p-4}$ obtained previously by Carlen, Frank, and Lieb. Some intermediate lemmas and inequalities appearing in this work were explored with the assistance of the large language model Grok.

math.CA

Periodicity and decidability of translational tilings by rational polygonal sets

The periodic tiling conjecture asserts that if a region $Σ\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was disproved in sufficiently high dimensions. In this paper, we study the periodic tiling conjecture for polygonal sets: bounded open sets in $\mathbb R^2$ whose boundary is a finite union of line segments. We prove the periodic tiling conjecture for any polygonal tile whose vertices are rational. As a corollary of our argument, we also obtain the decidability of tilings by rational polygonal sets. Moreover, we prove that any translational tiling by a rational polygonal tile is weakly-periodic, i.e., can be partitioned into finitely many singly-periodic pieces.

math.CO

Positive and Negative Square Energies of Graphs

The energy of a graph $G$ is the sum of the absolute values of the eigenvalues of the adjacency matrix of $G$. Let $s^+(G), s^-(G)$ denote the sum of the squares of the positive and negative eigenvalues of $G$, respectively. It was conjectured by [Elphick, Farber, Goldberg, Wocjan, Discrete Math. (2016)] that if $G$ is a connected graph of order $n$, then $s^+(G)\geq n-1$ and $s^-(G) \geq n-1$. In this paper, we show partial results towards this conjecture. In particular, numerous structural results that may help in proving the conjecture are derived, including the effect of various graph operations. These are then used to establish the conjecture for several graph classes, including graphs with certain fraction of positive eigenvalues and unicyclic graphs.

math.CO

New bounds for discrete lacunary spherical averages

We show that the discrete lacunary spherical maximal function is bounded on $l^p(\mathbb{Z}^d)$ for all $p >\frac{d+1}{d-1}$. Our range is new in dimension 4, where it appears that little was previously known for general lacunary radii. Our technique follows that of Kesler-Lacey-Mena, using the Kloosterman refinement to improve the estimates in several places, which leads to an overall improvement in dimension 4.

math.CA

Generalized Collatz Maps with Almost Bounded Orbits

If dividing by $p$ is a mistake, multiply by $q$ and translate, and so you'll live to iterate. We show that if we define a Collatz-like map in this form then, under suitable conditions on $p$ and $q$, almost all orbits of this map attain almost bounded values. This generalizes a recent breakthrough result of Tao for the original Collatz map (i.e., $p=2$ and $q=3$). In other words, given an arbitrary growth function $N\mapsto f(N)$ we show that almost every orbit of such map with input $N$ eventually attains a value smaller than $f(N)$.

math.DS