More Like this

1. Green function estimates on complements of low-dimensional uniformly rectifiable sets

   https://doi.org/10.1007/s00208-022-02379-8  

   David, Guy; Feneuil, Joseph; Mayboroda, Svitlana (March 2022, Mathematische Annalen)

   Abstract It has been recently established in David and Mayboroda (Approximation of green functions and domains with uniformly rectifiable boundaries of all dimensions.arXiv:2010.09793) that on uniformly rectifiable sets the Green function is almost affine in the weak sense, and moreover, in some scenarios such Green function estimates are equivalent to the uniform rectifiability of a set. The present paper tackles a strong analogue of these results, starting with the “flagship degenerate operators on sets with lower dimensional boundaries. We consider the elliptic operators$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$ $L_{\beta ,\gamma }=-\text{div}{D}^{d+1+\gamma -n}\nabla$associated to a domain$$\Omega \subset {\mathbb {R}}^n$$ $\Omega \subset R^n$with a uniformly rectifiable boundary$$\Gamma $$ $\Gamma$of dimension$$d < n-1$$ $d<n-1$, the now usual distance to the boundary$$D = D_\beta $$ $D=D_{\beta }$given by$$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$ $D_{\beta }{\left(X\right)}^{-\beta }={\int }_{\Gamma }{|X-y|}^{-d-\beta }d\sigma \left(y\right)$for$$X \in \Omega $$ $X\in \Omega$, where$$\beta >0$$ $\beta >0$and$$\gamma \in (-1,1)$$ $\gamma \in (-1,1)$. In this paper we show that the Green functionGfor$$L_{\beta ,\gamma }$$ $L_{\beta ,\gamma }$, with pole at infinity, is well approximated by multiples of$$D^{1-\gamma }$$ $D^{1-\gamma }$, in the sense that the function$$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$ $|D\nabla (ln(\frac{G}{D^{1-\gamma }})){|}^2$satisfies a Carleson measure estimate on$$\Omega $$ $\Omega$. We underline that the strong and the weak results are different in nature and, of course, at the level of the proofs: the latter extensively used compactness arguments, while the present paper relies on some intricate integration by parts and the properties of the “magical distance function from David et al. (Duke Math J, to appear). 

   more » « less
2. Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization

   https://doi.org/10.1007/s10107-022-01875-8  

   Zhang, Shixuan; Sun, Xu Andy (August 2022, Mathematical Programming)

   Abstract In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization withnon-Lipschitzianvalue functions and multistage stochastic mixed-integer linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MS-MINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a$$(T+1)$$ $(T+1)$-stage stochastic MINLP satisfyingL-exact Lipschitz regularization withd-dimensional state spaces, to obtain an$$\varepsilon $$ $\epsilon$-optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by$${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$ $O\left({\left(\frac{2LT}{\epsilon }\right)}^d\right)$, and is lower bounded by$${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$ $O\left({\left(\frac{\mathrm{LT}}{4\epsilon }\right)}^d\right)$for the general case or by$${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/2-1})$$ $O\left({\left(\frac{\mathrm{LT}}{8\epsilon }\right)}^{d/2-1}\right)$for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity dependspolynomiallyon the number of stages. We further show that the iteration complexity dependslinearlyonT, if all the state spaces are finite sets, or if we seek a$$(T\varepsilon )$$ $\left(T\epsilon \right)$-optimal solution when the state spaces are infinite sets, i.e. allowing the optimality gap to scale withT. To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof. Shabbir Ahmed in the general setting of multistage stochastic mixed-integer optimization. 

   more » « less
3. Evaluation codes arising from symmetric polynomials

   https://doi.org/10.1007/s10623-025-01637-5  

   Gatti, Barbara; Korchmáros, Gábor; Nagy, Gábor P; Pallozzi_Lavorante, Vincenzo; Schulte, Gioia (May 2025, Designs, Codes and Cryptography)

   Abstract Datta and Johnsen (Des Codes Cryptogr 91:747–761, 2023) introduced a new family of evaluation codes in an affine space of dimension$$\ge 2$$ $\ge 2$over a finite field$${\mathbb {F}}_q$$ $F_q$where linear combinations of elementary symmetric polynomials are evaluated on the set of all points with pairwise distinct coordinates. In this paper, we propose a generalization by taking low dimensional linear systems of symmetric polynomials. Computation for small values of$$q=7,9$$ $q=7,9$shows that carefully chosen generalized Datta–Johnsen codes$$\left[ \frac{1}{2}q(q-1),3,d\right] $$ $\left(\frac{1}{2},q,(q-1),,,3,,,d\right)$have minimum distancedequal to the optimal value minus 1. 

   more » « less
4. Counting imaginary quadratic fields with an ideal class group of 5-rank at least 2

   https://doi.org/10.1007/s11139-025-01184-6  

   Bartz, Kollin; Levin, Aaron; Thamminana, Aman_Dhruva (August 2025, The Ramanujan Journal)

   Abstract We prove that there are$$\gg \frac{X^{\frac{1}{3}}}{(\log X)^2}$$ $\gg \frac{X^{\frac{1}{3}}}{{(logX)}^2}$imaginary quadratic fieldskwith discriminant$$|d_k|\le X$$ $|d_k|\le X$and an ideal class group of 5-rank at least 2. This improves a result of Byeon, who proved the lower bound$$\gg X^{\frac{1}{4}}$$ $\gg X^{\frac{1}{4}}$in the same setting. We use a method of Howe, Leprévost, and Poonen to construct a genus 2 curveCover$$\mathbb {Q}$$ $Q$such thatChas a rational Weierstrass point and the Jacobian ofChas a rational torsion subgroup of 5-rank 2. We deduce the main result from the existence of the curveCand a quantitative result of Kulkarni and the second author. 

   more » « less
5. Uniform stabilization in Besov spaces with arbitrary decay rates of the magnetohydrodynamic system by finite-dimensional interior localized static feedback controllers

   https://doi.org/10.1007/s40687-024-00490-7  

   Lasiecka, Irena; Priyasad, Buddhika; Triggiani, Roberto (December 2024, Research in the Mathematical Sciences)

   Abstract We consider thed-dimensional MagnetoHydroDynamics (MHD) system defined on a sufficiently smooth bounded domain,$$d = 2,3$$ $d=2,3$with homogeneous boundary conditions, and subject to external sources assumed to cause instability. The initial conditions for both fluid and magnetic equations are taken of low regularity. We then seek to uniformly stabilize such MHD system in the vicinity of an unstable equilibrium pair, in the critical setting of correspondingly low regularity spaces, by means of explicitly constructed, static, feedback controls, which are localized on an arbitrarily small interior subdomain. In additional, they will be minimal in number. The resulting space of well-posedness and stabilization is a suitable product space$$\displaystyle \widetilde{\textbf{B}}^{2- ^{2}\!/_{p}}_{q,p}(\Omega )\times \widetilde{\textbf{B}}^{2- ^{2}\!/_{p}}_{q,p}(\Omega ), \, 1< p < \frac{2q}{2q-1}, \, q > d,$$ ${\tilde{B}}_{q,p}^{2{-}^2{/}_p}\left(\Omega \right)\times {\tilde{B}}_{q,p}^{2{-}^2{/}_p}\left(\Omega \right),1<p<\frac{2q}{2q-1},q>d,$of tight Besov spaces for the fluid velocity component and the magnetic field component (each “close” to$$\textbf{L}^3(\Omega )$$ $L^3\left(\Omega \right)$for$$d = 3$$ $d=3$). Showing maximal$$L^p$$ $L^p$-regularity up to$$T = \infty $$ $T=\infty$for the feedback stabilized linear system is critical for the analysis of well-posedness and stabilization of the feedback nonlinear problem. 

   more » « less