More Like this

1. Evolution of the Interplanetary Turbulence and the Associated Turbulence Anisotropy in the Outer Heliosphere: VOYAGER 2 Observations

   https://doi.org/10.3847/1538-4357/ad2eae  

   Zhu, Xingyu; He, Jiansen; Zank, Gary P; Verscharen, Daniel; Zhao, Ling-Ling; Duan, Die; Lin, Rong (April 2024, The Astrophysical Journal)

   Abstract We study the radial evolution of the inertial-range solar wind plasma turbulence and its anisotropy in the outer heliosphere. We use magnetic field (B) measurements from the Voyager 2 spacecraft for heliocentric distancesRfrom 1 to 33 au. We find that the perpendicular and trace power spectral densities (PSDs) of the magnetic field ( $E_{{\mathrm{B}}_{\perp }}$and $E_{{\mathrm{B}}_{\mathrm{Tr}}}$) still follow a Kolmogorov-like spectrum until 33 au. The parallel magnetic field PSD, $E_{B_{\parallel }}$, transits from a power-law index of −2 to −5/3 as the distance crossesR∼ 10 au. The PSD at frequencies 0.01 Hz <f< 0.2 Hz flattens atR> 20 au, gradually approaching anf⁻¹spectrum, probably due to instrument noise. At 0.002 Hz <f< 0.1 Hz, quasi-parallel propagation dominates at 1 au <R< 7 au, with quasi-perpendicular propagation gradually emerging atR> 5 au. ForR> 7 au, oblique propagation becomes the primary mode of propagation. At smaller frequencies off< 0.01 Hz, $E_{{\mathrm{B}}_{\perp }}$increases with propagation angle at 1 au <R< 5 au, and in contrast decreases with propagation angle atR> 5 au due to the enhanced power level at propagation angles smaller than 20°. Such enhancement may derive from the injection of wave energy from the pickup ion source into the background turbulent cascade, and the injected wave energy is transferred across scales without leaving local enhancements in $E_{{\mathrm{B}}_{\perp }}$or $E_{{\mathrm{B}}_{\mathrm{Tr}}}$. 

   more » « less
2. Global well-posedness for 2D generalized parabolic Anderson model via paracontrolled calculus

   https://doi.org/10.1007/s40072-025-00358-z  

   Shen, Hao; Zhu, Rongchan; Zhu, Xiangchan (May 2025, Stochastics and Partial Differential Equations: Analysis and Computations)

   Abstract This article revisits the problem of global well-posedness for the generalized parabolic Anderson model on$$\mathbb {R}^+\times \mathbb {T}^2$$ $R^{+}\times T^2$within the framework of paracontrolled calculus (Gubinelli et al. in Forum Math, 2015). The model is given by the equation:$$\begin{aligned} (\partial _t-\Delta ) u=F(u)\eta \end{aligned}$$ $\begin{array}{c}({\partial }_t-\Delta )u=F\left(u\right)\eta \end{array}$where$$\eta \in C^{-1-\kappa }$$ $\eta \in C^{-1-\kappa }$with$$1/6>\kappa >0$$ $1/6>\kappa >0$, and$$F\in C_b^2(\mathbb {R})$$ $F\in C_b^2\left(R\right)$. Assume that$$\eta \in C^{-1-\kappa }$$ $\eta \in C^{-1-\kappa }$and can be lifted to enhanced noise, we derive new a priori bounds. The key idea follows from the recent work by Chandra et al. (A priori bounds for 2-d generalised Parabolic Anderson Model,,2024), to represent the leading error term as a transport type term, and our techniques encompass the paracontrolled calculus, the maximum principle, and the localization approach (i.e. high-low frequency argument). 

   more » « less
3. VC-Dimension of Hyperplanes Over Finite Fields

   https://doi.org/10.1007/s00373-025-02909-6  

   Ascoli, Ruben; Betti, Livia; Cheigh, Justin; Iosevich, Alex; Jeong, Ryan; Liu, Xuyan; McDonald, Brian; Milgrim, Wyatt; Miller, Steven_J; Romero_Acosta, Francisco; et al (March 2025, Graphs and Combinatorics)

   Abstract Let$$\mathbb {F}_q^d$$ $F_q^d$be thed-dimensional vector space over the finite field withqelements. For a subset$$E\subseteq \mathbb {F}_q^d$$ $E\subseteq F_q^d$and a fixed nonzero$$t\in \mathbb {F}_q$$ $t\in F_q$, let$$\mathcal {H}_t(E)=\{h_y: y\in E\}$$ $H_t\left(E\right)=\{h_y:y\in E\}$, where$$h_y:E\rightarrow \{0,1\}$$ $h_y:E\to \{0,1\}$is the indicator function of the set$$\{x\in E: x\cdot y=t\}$$ $\{x\in E:x·y=t\}$. Two of the authors, with Maxwell Sun, showed in the case$$d=3$$ $d=3$that if$$|E|\ge Cq^{\frac{11}{4}}$$ $\left|E\right|\ge C{q}^{\frac{11}{4}}$andqis sufficiently large, then the VC-dimension of$$\mathcal {H}_t(E)$$ $H_t\left(E\right)$is 3. In this paper, we generalize the result to arbitrary dimension by showing that the VC-dimension of$$\mathcal {H}_t(E)$$ $H_t\left(E\right)$isdwhenever$$E\subseteq \mathbb {F}_q^d$$ $E\subseteq F_q^d$with$$|E|\ge C_d q^{d-\frac{1}{d-1}}$$ $\left|E\right|\ge C_d{q}^{d-\frac{1}{d-1}}$. 

   more » « less
4. Dimension-free discretizations of the uniform norm by small product sets

   https://doi.org/10.1007/s00222-024-01306-9  

   Becker, Lars; Klein, Ohad; Slote, Joseph; Volberg, Alexander; Zhang, Haonan (December 2024, Inventiones mathematicae)

   Abstract Let$$f$$ $f$be an analytic polynomial of degree at most$$K-1$$ $K-1$. A classical inequality of Bernstein compares the supremum norm of$$f$$ $f$over the unit circle to its supremum norm over the sampling set of the$$K$$ $K$-th roots of unity. Many extensions of this inequality exist, often understood under the umbrella of Marcinkiewicz–Zygmund-type inequalities for$$L^{p},1\le p\leq \infty $$ $L^p,1\le p\le \infty$norms. We study dimension-free extensions of these discretization inequalities in the high-dimension regime, where existing results construct sampling sets with cardinality growing with the total degree of the polynomial. In this work we show that dimension-free discretizations are possible with sampling sets whose cardinality is independent of$$\deg (f)$$ $deg\left(f\right)$and is instead governed by the maximumindividualdegree of$$f$$ $f$;i.e., the largest degree of$$f$$ $f$when viewed as a univariate polynomial in any coordinate. For example, we find that for$$n$$ $n$-variate analytic polynomials$$f$$ $f$of degree at most$$d$$ $d$and individual degree at most$$K-1$$ $K-1$,$$\|f\|_{L^{\infty }(\mathbf{D}^{n})}\leq C(X)^{d}\|f\|_{L^{\infty }(X^{n})}$$ ${\parallel f\parallel }_{L^{\infty }\left(D^n\right)}\le C{\left(X\right)}^d{\parallel f\parallel }_{L^{\infty }\left(X^n\right)}$for any fixed$$X$$ $X$in the unit disc$$\mathbf{D}$$ $D$with$$|X|=K$$ $\left|X\right|=K$. The dependence on$$d$$ $d$in the constant is tight for such small sampling sets, which arise naturally for example when studying polynomials of bounded degree coming from functions on products of cyclic groups. As an application we obtain a proof of the cyclic group Bohnenblust–Hille inequality with an explicit constant$$\mathcal{O}(\log K)^{2d}$$ $O{(logK)}^{2d}$. 

   more » « less
5. Hardness and approximation of submodular minimum linear ordering problems

   https://doi.org/10.1007/s10107-023-02038-z  

   Farhadi, Majid; Gupta, Swati; Sun, Shengding; Tetali, Prasad; Wigal, Michael C (December 2023, Mathematical Programming)

   Abstract The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to minimize an aggregated cost$$f(\cdot )$$ $f(·)$due to an ordering$$\sigma $$ $\sigma$of the items (say [n]), i.e.,$$\min _{\sigma } \sum _{i\in [n]} f(E_{i,\sigma })$$ ${min}_{\sigma }{\sum }_{i\in \left[n\right]}f\left(E_{i,\sigma }\right)$, where$$E_{i,\sigma }$$ $E_{i,\sigma }$is the set of items mapped by$$\sigma $$ $\sigma$to indices [i]. Despite an extensive literature on MLOP variants and approximations for these, it was unclear whether the graphic matroid MLOP was NP-hard. We settle this question through non-trivial reductions from mininimum latency vertex cover and minimum sum vertex cover problems. We further propose a new combinatorial algorithm for approximating monotone submodular MLOP, using the theory of principal partitions. This is in contrast to the rounding algorithm by Iwata et al. (in: APPROX, 2012), using Lovász extension of submodular functions. We show a$$(2-\frac{1+\ell _{f}}{1+|E|})$$ $(2-\frac{1+{\ell }_f}{1+\left|E\right|})$-approximation for monotone submodular MLOP where$$\ell _{f}=\frac{f(E)}{\max _{x\in E}f(\{x\})}$$ ${\ell }_f=\frac{f\left(E\right)}{{max}_{x\in E}f\left(\left\{x\right\}\right)}$satisfies$$1 \le \ell _f \le |E|$$ $1\le {\ell }_f\le \left|E\right|$. Our theory provides new approximation bounds for special cases of the problem, in particular a$$(2-\frac{1+r(E)}{1+|E|})$$ $(2-\frac{1+r\left(E\right)}{1+\left|E\right|})$-approximation for the matroid MLOP, where$$f = r$$ $f=r$is the rank function of a matroid. We further show that minimum latency vertex cover is$$\frac{4}{3}$$ $\frac{4}{3}$-approximable, by which we also lower bound the integrality gap of its natural LP relaxation, which might be of independent interest. 

   more » « less