More Like this

1. Inequalities for the Radon Transform on Convex Sets

   https://doi.org/10.1093/imrn/rnab122  

   Giannopoulos, Apostolos; Koldobsky, Alexander; Zvavitch, Artem (May 2021, International Mathematics Research Notices)

   Abstract We prove an inequality that unifies previous works of the authors on the properties of the Radon transform on convex bodies including an extension of the Busemann–Petty problem and a slicing inequality for arbitrary functions. Let $$K$$ and $$L$$ be star bodies in $${\mathbb R}^n,$$ let $0<k<n$ be an integer, and let $f,g$ be non-negative continuous functions on $$K$$ and $$L$$, respectively, so that $$\|g\|_\infty =g(0)=1.$$ Then $$\begin{align*} & \frac{\int_Kf}{\left(\int_L g\right)^{\frac{n-k}n}|K|^{\frac kn}} \le \frac n{n-k} \left(d_{\textrm{ovr}}(K,\mathcal{B}\mathcal{P}_k^n)\right)^k \max_{H} \frac{\int_{K\cap H} f}{\int_{L\cap H} g}, \end{align*}$$where $|K|$ stands for volume of proper dimension, $$C$$ is an absolute constant, the maximum is taken over all $(n-k)$-dimensional subspaces of $${\mathbb R}^n,$$ and $$d_{\textrm{ovr}}(K,\mathcal{B}\mathcal{P}_k^n)$$ is the outer volume ratio distance from $$K$$ to the class of generalized $$k$$-intersection bodies in $${\mathbb R}^n.$$ Another consequence of this result is a mean value inequality for the Radon transform. We also obtain a generalization of the isomorphic version of the Shephard problem. 

   more » « less
2. Constraining the clustering transition for colorings of sparse random graphs

   Anastos, M.; Frieze, A.; Pegden, W. (January 2018, The electronic journal of combinatorics)

   Let $$\Omega_q$$ denote the set of proper $[q]$-colorings of the random graph $$G_{n,m}, m=dn/2$$ and let $$H_q$$ be the graph with vertex set $$\Omega_q$$ and an edge $$\set{\s,\t}$$ where $$\s,\t$$ are mappings $$[n]\to[q]$$ iff $$h(\s,\t)=1$$. Here $$h(\s,\t)$$ is the Hamming distance $$|\set{v\in [n]:\s(v)\neq\t(v)}|$$. We show that w.h.p. $$H_q$$ contains a single giant component containing almost all colorings in $$\Omega_q$$ if $$d$$ is sufficiently large and $$q\geq \frac{cd}{\log d}$$ for a constant $c>3/2$. 

   more » « less
3. Independent dominating sets in graphs of girth five

   https://doi.org/10.1017/s0963548320000279  

   Harutyunyan, Ararat; Horn, Paul; Verstraete, Jacques (May 2021, Combinatorics, Probability and Computing)

   Abstract Let $$\gamma(G)$$ and $${\gamma _ \circ }(G)$$ denote the sizes of a smallest dominating set and smallest independent dominating set in a graph G, respectively. One of the first results in probabilistic combinatorics is that if G is an n -vertex graph of minimum degree at least d , then $$\begin{equation}\gamma(G) \leq \frac{n}{d}(\log d + 1).\end{equation}$$ In this paper the main result is that if G is any n -vertex d -regular graph of girth at least five, then $$\begin{equation}\gamma_(G) \leq \frac{n}{d}(\log d + c)\end{equation}$$ for some constant c independent of d . This result is sharp in the sense that as $$d \rightarrow \infty$$ , almost all d -regular n -vertex graphs G of girth at least five have $$\begin{equation}\gamma_(G) \sim \frac{n}{d}\log d.\end{equation}$$ Furthermore, if G is a disjoint union of $${n}/{(2d)}$$ complete bipartite graphs $$K_{d,d}$$ , then $${\gamma_\circ}(G) = \frac{n}{2}$$ . We also prove that there are n -vertex graphs G of minimum degree d and whose maximum degree grows not much faster than d log d such that $${\gamma_\circ}(G) \sim {n}/{2}$$ as $$d \rightarrow \infty$$ . Therefore both the girth and regularity conditions are required for the main result. 

   more » « less
4. Khintchine-type recurrence for 3-point configurations

   https://doi.org/10.1017/fms.2022.97  

   Ackelsberg, Ethan; Bergelson, Vitaly; Shalom, Or (January 2022, Forum of Mathematics, Sigma)

   Abstract The goal of this paper is to generalise, refine and improve results on large intersections from [2, 8]. We show that if G is a countable discrete abelian group and $$\varphi , \psi : G \to G$$ are homomorphisms, such that at least two of the three subgroups $$\varphi (G)$$ , $$\psi (G)$$ and $$(\psi -\varphi )(G)$$ have finite index in G , then $$\{\varphi , \psi \}$$ has the large intersections property . That is, for any ergodic measure preserving system $$\textbf {X}=(X,\mathcal {X},\mu ,(T_g)_{g\in G})$$ , any $$A\in \mathcal {X}$$ and any $$\varepsilon>0$$ , the set $$ \begin{align*} \{g\in G : \mu(A\cap T_{\varphi(g)}^{-1} A \cap T_{\psi(g)}^{-1} A)>\mu(A)^3-\varepsilon\} \end{align*} $$ is syndetic (Theorem 1.11). Moreover, in the special case where $$\varphi (g)=ag$$ and $$\psi (g)=bg$$ for $$a,b\in \mathbb {Z}$$ , we show that we only need one of the groups $aG$ , $bG$ or $(b-a)G$ to be of finite index in G (Theorem 1.13), and we show that the property fails, in general, if all three groups are of infinite index (Theorem 1.14). One particularly interesting case is where $$G=(\mathbb {Q}_{>0},\cdot )$$ and $$\varphi (g)=g$$ , $$\psi (g)=g^2$$ , which leads to a multiplicative version of the Khintchine-type recurrence result in [8]. We also completely characterise the pairs of homomorphisms $$\varphi ,\psi $$ that have the large intersections property when $$G = {{\mathbb Z}}^2$$ . The proofs of our main results rely on analysis of the structure of the universal characteristic factor for the multiple ergodic averages $$ \begin{align*} \frac{1}{|\Phi_N|} \sum_{g\in \Phi_N}T_{\varphi(g)}f_1\cdot T_{\psi(g)} f_2. \end{align*} $$ In the case where G is finitely generated, the characteristic factor for such averages is the Kronecker factor . In this paper, we study actions of groups that are not necessarily finitely generated, showing, in particular, that, by passing to an extension of $$\textbf {X}$$ , one can describe the characteristic factor in terms of the Conze–Lesigne factor and the $$\sigma $$ -algebras of $$\varphi (G)$$ and $$\psi (G)$$ invariant functions (Theorem 4.10). 

   more » « less
5. Large Deviation Estimates of Selberg’s Central Limit Theorem and Applications

   https://doi.org/10.1093/imrn/rnad176  

   Arguin, Louis-Pierre; Bailey, Emma (July 2023, International Mathematics Research Notices)

   Abstract For $$V\sim \alpha \log \log T$$ with $$0<\alpha <2$$, we prove $$\begin{align*} & \frac{1}{T}\textrm{meas}\{t\in [T,2T]: \log|\zeta(1/2+ \textrm{i} t)|>V\}\ll \frac{1}{\sqrt{\log\log T}} e^{-V^{2}/\log\log T}. \end{align*}$$This improves prior results of Soundararajan and of Harper on the large deviations of Selberg’s Central Limit Theorem in that range, without the use of the Riemann hypothesis. The result implies the sharp upper bound for the fractional moments of the Riemann zeta function proved by Heap, Radziwiłł, and Soundararajan. It also shows a new upper bound for the maximum of the zeta function on short intervals of length $$(\log T)^{\theta }$$, $$0<\theta <3$$, that is expected to be sharp for $$\theta> 0$$. Finally, it yields a sharp upper bound (to order one) for the moments on short intervals, below and above the freezing transition. The proof is an adaptation of the recursive scheme introduced by Bourgade, Radziwiłł, and one of the authors to prove fine asymptotics for the maximum on intervals of length $$1$$. 

   more » « less