More Like this

1. Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane

   https://doi.org/10.4230/LIPICS.SOCG.2024.4  

   Agarwal, Pankaj K; Ezra, Esther; Sharir, Micha (January 2024, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)

   Mulzer, Wolfgang; Phillips, Jeff M (Ed.)

   Let P be a set of m points in ℝ², let Σ be a set of n semi-algebraic sets of constant complexity in ℝ², let (S,+) be a semigroup, and let w: P → S be a weight function on the points of P. We describe a randomized algorithm for computing w(P∩σ) for every σ ∈ Σ in overall expected time O^*(m^{2s/(5s-4)}n^{(5s-6)/(5s-4)} + m^{2/3}n^{2/3} + m + n), where s > 0 is a constant that bounds the maximum complexity of the regions of Σ, and where the O^*(⋅) notation hides subpolynomial factors. For s ≥ 3, surprisingly, this bound is smaller than the best-known bound for answering m such queries in an on-line manner. The latter takes O^*(m^{s/(2s-1)}n^{(2s-2)/(2s-1)} + m + n) time. Let Φ: Σ × P → {0,1} be the Boolean predicate (of constant complexity) such that Φ(σ,p) = 1 if p ∈ σ and 0 otherwise, and let Σ_Φ P = {(σ,p) ∈ Σ× P ∣ Φ(σ,p) = 1}. Our algorithm actually computes a partition ℬ_Φ of Σ_Φ P into bipartite cliques (bicliques) of size (i.e., sum of the sizes of the vertex sets of its bicliques) O^*(m^{2s/(5s-4)}n^{(5s-6)/(5s-4)} + m^{2/3}n^{2/3} + m + n). It is straightforward to compute w(P∩σ) for all σ ∈ Σ from ℬ_Φ. Similarly, if η: Σ → S is a weight function on the regions of Σ, ∑_{σ ∈ Σ: p ∈ σ} η(σ), for every point p ∈ P, can be computed from ℬ_Φ in a straightforward manner. We also mention a few other applications of computing ℬ_Φ. 

   more » « less
2. Some sharp inequalities of Mizohata–Takeuchi-type

   https://doi.org/10.4171/RMI/1463  

   Carbery, Anthony; Iliopoulou, Marina; Wang, Hong (June 2024, Revista Matemática Iberoamericana)

   Let\Sigmabe a strictly convex, compact patch of aC^{2}hypersurface in\mathbb{R}^{n}, with non-vanishing Gaussian curvature and surface measured\sigmainduced by the Lebesgue measure in\mathbb{R}^{n}. The Mizohata–Takeuchi conjecture states that \int |\widehat{g d\sigma}|^{2} w \leq C \|Xw\|_{\infty} \int |g|^{2} for allg\in L^{2}(\Sigma)and all weightsw \colon \mathbb{R}^{n}\rightarrow [0,+\infty), whereXdenotes theX-ray transform. As partial progress towards the conjecture, we show, as a straightforward consequence of recently-established decoupling inequalities, that for every\varepsilon>0, there exists a positive constantC_{\varepsilon}, which depends only on\Sigmaand\varepsilon, such that for allR \geq 1and all weightsw \colon \mathbb{R}^{n}\rightarrow [0,+\infty), we have \int_{B_R}|\widehat{g d\sigma}|^{2} w \leq C_{\varepsilon} R^{\varepsilon} \sup_{T} \Big(\int_{T} w^{(n+1)/2}\Big)^{2/(n+1)}\int |g|^{2}, whereTranges over the family of tubes in\mathbb{R}^{n}of dimensionsR^{1/2}\times \cdots \times R^{1/2}\times R. From this we deduce the Mizohata–Takeuchi conjecture with anR^{(n-1)/(n+1)}-loss; i.e., that \int_{B_R}|\widehat{g d\sigma}|^{2} w \leq C_{\varepsilon} R^{\frac{n-1}{n+1}+ \varepsilon}\|Xw\|_{\infty} \int |g|^{2} for any ballB_{R}of radiusRand any\varepsilon>0. The power(n-1)/(n+1)here cannot be replaced by anything smaller unless properties of\widehat{g d\sigma}beyond ‘decoupling axioms’ are exploited. We also provide estimates which improve this inequality under various conditions on the weight, and discuss some new cases where the conjecture holds. 

   more » « less
3. Weighted estimates for one-sided martingale transforms

   https://doi.org/10.1090/proc/14665  

   Chen, Wei; Han, Rui; Lacey, Michael T. (October 2019, Proceedings of the American Mathematical Society)

   Let $$ Tf =\sum _{I} \varepsilon _I \langle f,h_{I^+}\rangle h_{I^-}$$. Here, $$ \lvert \varepsilon _I\rvert =1 $$, and $$ h_J$$ is the Haar function defined on dyadic interval $ J$. We show that, for instance, $$\displaystyle \lVert T \rVert _{L ^{2} (w) \to L ^{2} (w)} \lesssim [w] _{A_2 ^{+}} .$$ Above, we use the one-sided $$ A_2$$ characteristic for the weight $ w$. This is an instance of a one-sided $$ A_2$$ conjecture. Our proof of this fact is difficult, as the very quick known proofs of the $$ A_2$$ theorem do not seem to apply in the one-sided setting. 

   more » « less
4. Universal Geometric Graphs

   https://doi.org/10.1007/978-3-030-60440-0_14  

   Frati, Fabrizio; Hoffmann, Michael; Toth, Csaba D. (October 2020, Graph-Theoretic Concepts in Computer Science (WG 2020))

   null (Ed.)

   We introduce and study the problem of constructing geometric graphs that have few vertices and edges and that are universal for planar graphs or for some sub-class of planar graphs; a geometric graph is universal for a class H of planar graphs if it contains an embedding, i.e., a crossing-free drawing, of every graph in H . Our main result is that there exists a geometric graph with n vertices and O(nlogn) edges that is universal for n-vertex forests; this extends to the geometric setting a well-known graph-theoretic result by Chung and Graham, which states that there exists an n-vertex graph with O(nlogn) edges that contains every n-vertex forest as a subgraph. Our O(nlogn) bound on the number of edges is asymptotically optimal. We also prove that, for every h>0 , every n-vertex convex geometric graph that is universal for the class of the n-vertex outerplanar graphs has Ωh(n2−1/h) edges; this almost matches the trivial O(n2) upper bound given by the n-vertex complete convex geometric graph. Finally, we prove that there is an n-vertex convex geometric graph with n vertices and O(nlogn) edges that is universal for n-vertex caterpillars. 

   more » « less
5. Duality for Optimal Couplings in Free Probability

   https://doi.org/10.1007/s00220-022-04480-0  

   Gangbo, Wilfrid; Jekel, David; Nam, Kyeongsik; Shlyakhtenko, Dimitri (December 2022, Communications in Mathematical Physics)

   Abstract We study the free probabilistic analog of optimal couplings for the quadratic cost, where classical probability spaces are replaced by tracial von Neumann algebras, and probability measures on $${\mathbb {R}}^m$$ R m are replaced by non-commutative laws of m -tuples. We prove an analog of the Monge–Kantorovich duality which characterizes optimal couplings of non-commutative laws with respect to Biane and Voiculescu’s non-commutative $$L^2$$ L 2 -Wasserstein distance using a new type of convex functions. As a consequence, we show that if ( X ,  Y ) is a pair of optimally coupled m -tuples of non-commutative random variables in a tracial $$\mathrm {W}^*$$ W ∗ -algebra $$\mathcal {A}$$ A , then $$\mathrm {W}^*((1 - t)X + tY) = \mathrm {W}^*(X,Y)$$ W ∗ ( ( 1 - t ) X + t Y ) = W ∗ ( X , Y ) for all $$t \in (0,1)$$ t ∈ ( 0 , 1 ) . Finally, we illustrate the subtleties of non-commutative optimal couplings through connections with results in quantum information theory and operator algebras. For instance, two non-commutative laws that can be realized in finite-dimensional algebras may still require an infinite-dimensional algebra to optimally couple. Moreover, the space of non-commutative laws of m -tuples is not separable with respect to the Wasserstein distance for $$m > 1$$ m > 1 . 

   more » « less