More Like this

1. COVERING INTEGERS BY $x^2 + dy^2$

   https://doi.org/10.1017/S1474748024000513  

   Green, Ben; Soundararajan, Kannan (May 2025, Journal of the Institute of Mathematics of Jussieu)

   Abstract What proportion of integers$$n \leq N$$may be expressed as$$x^2 + dy^2$$for some$$d \leq \Delta $$, with$$x,y$$integers? Writing$$\Delta = (\log N)^{\log 2} 2^{\alpha \sqrt {\log \log N}}$$for some$$\alpha \in (-\infty , \infty )$$, we show that the answer is$$\Phi (\alpha ) + o(1)$$, where$$\Phi $$is the Gaussian distribution function$$\Phi (\alpha ) = \frac {1}{\sqrt {2\pi }} \int ^{\alpha }_{-\infty } e^{-x^2/2} dx$$. A consequence of this is a phase transition: Almost none of the integers$$n \leq N$$can be represented by$$x^2 + dy^2$$with$$d \leq (\log N)^{\log 2 - \varepsilon }$$, but almost all of them can be represented by$$x^2 + dy^2$$with$$d \leq (\log N)^{\log 2 + \varepsilon}\kern-1.5pt$$. 

   more » « less
2. Bipartite-ness under smooth conditions

   https://doi.org/10.1017/S0963548323000019  

   Jiang, Tao; Longbrake, Sean; Ma, Jie (February 2023, Combinatorics, Probability and Computing)

   Abstract Given a family$$\mathcal{F}$$of bipartite graphs, theZarankiewicz number$$z(m,n,\mathcal{F})$$is the maximum number of edges in an$$m$$by$$n$$bipartite graph$$G$$that does not contain any member of$$\mathcal{F}$$as a subgraph (such$$G$$is called$$\mathcal{F}$$-free). For$$1\leq \beta \lt \alpha \lt 2$$, a family$$\mathcal{F}$$of bipartite graphs is$$(\alpha,\beta )$$-smoothif for some$$\rho \gt 0$$and every$$m\leq n$$,$$z(m,n,\mathcal{F})=\rho m n^{\alpha -1}+O(n^\beta )$$. Motivated by their work on a conjecture of Erdős and Simonovits on compactness and a classic result of Andrásfai, Erdős and Sós, Allen, Keevash, Sudakov and Verstraëte proved that for any$$(\alpha,\beta )$$-smooth family$$\mathcal{F}$$, there exists$$k_0$$such that for all odd$$k\geq k_0$$and sufficiently large$$n$$, any$$n$$-vertex$$\mathcal{F}\cup \{C_k\}$$-free graph with minimum degree at least$$\rho (\frac{2n}{5}+o(n))^{\alpha -1}$$is bipartite. In this paper, we strengthen their result by showing that for every real$$\delta \gt 0$$, there exists$$k_0$$such that for all odd$$k\geq k_0$$and sufficiently large$$n$$, any$$n$$-vertex$$\mathcal{F}\cup \{C_k\}$$-free graph with minimum degree at least$$\delta n^{\alpha -1}$$is bipartite. Furthermore, our result holds under a more relaxed notion of smoothness, which include the families$$\mathcal{F}$$consisting of the single graph$$K_{s,t}$$when$$t\gg s$$. We also prove an analogous result for$$C_{2\ell }$$-free graphs for every$$\ell \geq 2$$, which complements a result of Keevash, Sudakov and Verstraëte. 

   more » « less
3. 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
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. Multi-linear forms, graphs, and $L^p$-improving measures in $${\Bbb F}_q^d$$

   https://doi.org/10.4153/S0008414X2300086X  

   Bhowmik, Pablo; Iosevich, Alex; Koh, Doowon; Pham, Thang (February 2025, Canadian journal of mathematics)

   Abstract The purpose of this paper is to introduce and study the following graph-theoretic paradigm. Let$$ \begin{align*}T_Kf(x)=\int K(x,y) f(y) d\mu(y),\end{align*} $$where$$f: X \to {\Bbb R}$$,Xa set, finite or infinite, andKand$$\mu $$denote a suitable kernel and a measure, respectively. Given a connected ordered graphGonnvertices, consider the multi-linear form$$ \begin{align*}\Lambda_G(f_1,f_2, \dots, f_n)=\int_{x^1, \dots, x^n \in X} \ \prod_{(i,j) \in {\mathcal E}(G)} K(x^i,x^j) \prod_{l=1}^n f_l(x^l) d\mu(x^l),\end{align*} $$where$${\mathcal E}(G)$$is the edge set ofG. Define$$\Lambda _G(p_1, \ldots , p_n)$$as the smallest constant$$C>0$$such that the inequality(0.1)$$ \begin{align} \Lambda_G(f_1, \dots, f_n) \leq C \prod_{i=1}^n {||f_i||}_{L^{p_i}(X, \mu)} \end{align} $$holds for all nonnegative real-valued functions$$f_i$$,$$1\le i\le n$$, onX. The basic question is, how does the structure ofGand the mapping properties of the operator$$T_K$$influence the sharp exponents in (0.1). In this paper, this question is investigated mainly in the case$$X={\Bbb F}_q^d$$, thed-dimensional vector space over the field withqelements,$$K(x^i,x^j)$$is the indicator function of the sphere evaluated at$$x^i-x^j$$, and connected graphsGwith at most four vertices. 

   more » « less