More Like this

1. Intersective sets for sparse sets of integers

   https://doi.org/10.1017/etds.2024.73  

   BIENVENU, PIERRE-YVES; GRIESMER, JOHN T; LE, ANH N; LÊ, THÁI HOÀNG (May 2025, Ergodic Theory and Dynamical Systems)

   Abstract For$$E \subset \mathbb {N}$$, a subset$$R \subset \mathbb {N}$$isE-intersectiveif for every$$A \subset E$$having positive relative density,$$R \cap (A - A) \neq \varnothing $$. We say thatRischromatically E-intersectiveif for every finite partition$$E=\bigcup _{i=1}^k E_i$$, there existsisuch that$$R\cap (E_i-E_i)\neq \varnothing $$. When$$E=\mathbb {N}$$, we recover the usual notions of intersectivity and chromatic intersectivity. We investigate to what extent the known intersectivity results hold in the relative setting when$$E = \mathbb {P}$$, the set of primes, or other sparse subsets of$$\mathbb {N}$$. Among other things, we prove the following: (1) the set of shifted Chen primes$$\mathbb {P}_{\mathrm {Chen}} + 1$$is both intersective and$$\mathbb {P}$$-intersective; (2) there exists an intersective set that is not$$\mathbb {P}$$-intersective; (3) every$$\mathbb {P}$$-intersective set is intersective; (4) there exists a chromatically$$\mathbb {P}$$-intersective set which is not intersective (and therefore not$$\mathbb {P}$$-intersective). 

   more » « less
2. Hyperbolic Metric Spaces and Stochastic Embeddings

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

   Gartland, Chris (February 2025, Forum of Mathematics, Sigma)

   Abstract Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of stochastic embeddings in the infinite setting with an aim toward applications to Lipschitz free space theory. We prove that proper metric spaces stochastically embedding into$$\mathbb {R}$$-trees have Lipschitz free spaces isomorphic to$$L^1$$-spaces. We then undergo a systematic study of stochastic embeddability of Gromov hyperbolic metric spaces into$$\mathbb {R}$$-trees by way of stochastic embeddability of their boundaries into ultrametric spaces. The following are obtained as our main results: (1) every snowflake of a compact, finite Nagata-dimensional metric space stochastically embeds into an ultrametric space and has Lipschitz free space isomorphic to$$\ell ^1$$, (2) the Lipschitz free space over hyperbolicn-space is isomorphic to the Lipschitz free space over Euclideann-space and (3) every infinite, finitely generated hyperbolic group stochastically embeds into an$$\mathbb {R}$$-tree, has Lipschitz free space isomorphic to$$\ell ^1$$, and admits a proper, uniformly Lipschitz affine action on$$\ell ^1$$. 

   more » « less
3. Rates of convergence for regression with the graph poly-Laplacian

   https://doi.org/10.1007/s43670-023-00075-5  

   Trillos, Nicolás García; Murray, Ryan; Thorpe, Matthew (December 2023, Sampling Theory, Signal Processing, and Data Analysis)

   Abstract In the (special) smoothing spline problem one considers a variational problem with a quadratic data fidelity penalty and Laplacian regularization. Higher order regularity can be obtained via replacing the Laplacian regulariser with a poly-Laplacian regulariser. The methodology is readily adapted to graphs and here we consider graph poly-Laplacian regularization in a fully supervised, non-parametric, noise corrupted, regression problem. In particular, given a dataset$$\{x_i\}_{i=1}^n$$ ${\left\{x_i\right\}}_{i=1}^n$ and a set of noisy labels$$\{y_i\}_{i=1}^n\subset \mathbb {R}$$ ${\left\{y_i\right\}}_{i=1}^n\subset R$ we let$$u_n{:}\{x_i\}_{i=1}^n\rightarrow \mathbb {R}$$ $u_n:{\left\{x_i\right\}}_{i=1}^n\to R$ be the minimizer of an energy which consists of a data fidelity term and an appropriately scaled graph poly-Laplacian term. When$$y_i = g(x_i)+\xi _i$$ $y_i=g\left(x_i\right)+{\xi }_i$ , for iid noise$$\xi _i$$ ${\xi }_i$ , and using the geometric random graph, we identify (with high probability) the rate of convergence of$$u_n$$ $u_n$ togin the large data limit$$n\rightarrow \infty $$ $n\to \infty$ . Furthermore, our rate is close to the known rate of convergence in the usual smoothing spline model. 

   more » « less
4. Almost all orbits of the Collatz map attain almost bounded values

   https://doi.org/10.1017/fmp.2022.8  

   Tao, Terence (January 2022, Forum of Mathematics, Pi)

   Abstract Define theCollatz map$${\operatorname {Col}} \colon \mathbb {N}+1 \to \mathbb {N}+1$$on the positive integers$$\mathbb {N}+1 = \{1,2,3,\dots \}$$by setting$${\operatorname {Col}}(N)$$equal to$$3N+1$$whenNis odd and$$N/2$$whenNis even, and let$${\operatorname {Col}}_{\min }(N) := \inf _{n \in \mathbb {N}} {\operatorname {Col}}^n(N)$$denote the minimal element of the Collatz orbit$$N, {\operatorname {Col}}(N), {\operatorname {Col}}^2(N), \dots $$. The infamousCollatz conjectureasserts that$${\operatorname {Col}}_{\min }(N)=1$$for all$$N \in \mathbb {N}+1$$. Previously, it was shown by Korec that for any$$\theta> \frac {\log 3}{\log 4} \approx 0.7924$$, one has$${\operatorname {Col}}_{\min }(N) \leq N^\theta $$for almost all$$N \in \mathbb {N}+1$$(in the sense of natural density). In this paper, we show that foranyfunction$$f \colon \mathbb {N}+1 \to \mathbb {R}$$with$$\lim _{N \to \infty } f(N)=+\infty $$, one has$${\operatorname {Col}}_{\min }(N) \leq f(N)$$for almost all$$N \in \mathbb {N}+1$$(in the sense of logarithmic density). Our proof proceeds by establishing a stabilisation property for a certain first passage random variable associated with the Collatz iteration (or more precisely, the closely related Syracuse iteration), which in turn follows from estimation of the characteristic function of a certain skew random walk on a$$3$$-adic cyclic group$$\mathbb {Z}/3^n\mathbb {Z}$$at high frequencies. This estimation is achieved by studying how a certain two-dimensional renewal process interacts with a union of triangles associated to a given frequency. 

   more » « less
5. On the weight zero compactly supported cohomology of H_{g,n}

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

   Brandt, Madeline; Chan, Melody; Kannan, Siddarth (January 2024, Forum of Mathematics, Sigma)

   Abstract For$$g\ge 2$$and$$n\ge 0$$, let$$\mathcal {H}_{g,n}\subset \mathcal {M}_{g,n}$$denote the complex moduli stack ofn-marked smooth hyperelliptic curves of genusg. A normal crossings compactification of this space is provided by the theory of pointed admissible$$\mathbb {Z}/2\mathbb {Z}$$-covers. We explicitly determine the resulting dual complex, and we use this to define a graph complex which computes the weight zero compactly supported cohomology of$$\mathcal {H}_{g, n}$$. Using this graph complex, we give a sum-over-graphs formula for the$$S_n$$-equivariant weight zero compactly supported Euler characteristic of$$\mathcal {H}_{g, n}$$. This formula allows for the computer-aided calculation, for each$$g\le 7$$, of the generating function$$\mathsf {h}_g$$for these equivariant Euler characteristics for alln. More generally, we determine the dual complex of the boundary in any moduli space of pointed admissibleG-covers of genus zero curves, whenGis abelian, as a symmetric$$\Delta $$-complex. We use these complexes to generalize our formula for$$\mathsf {h}_g$$to moduli spaces ofn-pointed smooth abelian covers of genus zero curves. 

   more » « less