skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Compactness estimates for minimizers of the Alt-Phillips functional of negative exponents
Abstract We investigate the rigidity of global minimizers u ≥ 0 u\ge 0 of the Alt-Phillips functional involving negative power potentials ∫ Ω ( ∣ ∇ u ∣ 2 + u − γ χ { u > 0 } ) d x , γ ∈ ( 0 , 2 ) , \mathop{\int }\limits_{\Omega }(| \nabla u{| }^{2}+{u}^{-\gamma }{\chi }_{\left\{u\gt 0\right\}}){\rm{d}}x,\hspace{1.0em}\gamma \in \left(0,2), when the exponent γ \gamma is close to the extremes of the admissible values. In particular, we show that global minimizers in R n {{\mathbb{R}}}^{n} are one-dimensional if γ \gamma is close to 2 and n ≤ 7 n\le 7 , or if γ \gamma is close to 0 and n ≤ 4 n\le 4 .  more » « less
Award ID(s):
2055617
PAR ID:
10426093
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Advanced Nonlinear Studies
Volume:
23
Issue:
1
ISSN:
2169-0375
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Abstract Let $$u_{k}$$ u k be a solution of the Helmholtz equation with the wave number k , $$\varDelta u_{k}+k^{2} u_{k}=0$$ Δ u k + k 2 u k = 0 , on (a small ball in) either $${\mathbb {R}}^{n}$$ R n , $${\mathbb {S}}^{n}$$ S n , or $${\mathbb {H}}^{n}$$ H n . For a fixed point p , we define $$M_{u_{k}}(r)=\max _{d(x,p)\le r}|u_{k}(x)|.$$ M u k ( r ) = max d ( x , p ) ≤ r | u k ( x ) | . The following three ball inequality $$M_{u_{k}}(2r)\le C(k,r,\alpha )M_{u_{k}}(r)^{\alpha }M_{u_{k}}(4r)^{1-\alpha }$$ M u k ( 2 r ) ≤ C ( k , r , α ) M u k ( r ) α M u k ( 4 r ) 1 - α is well known, it holds for some $$\alpha \in (0,1)$$ α ∈ ( 0 , 1 ) and $$C(k,r,\alpha )>0$$ C ( k , r , α ) > 0 independent of $$u_{k}$$ u k . We show that the constant $$C(k,r,\alpha )$$ C ( k , r , α ) grows exponentially in k (when r is fixed and small). We also compare our result with the increased stability for solutions of the Cauchy problem for the Helmholtz equation on Riemannian manifolds. 
    more » « less
  2. Abstract Let u u be a nontrivial harmonic function in a domain D ⊂ R d D\subset {{\mathbb{R}}}^{d} , which vanishes on an open set of the boundary. In a recent article, we showed that if D D is a C 1 {C}^{1} -Dini domain, then, within the open set, the singular set of u u , defined as { X ∈ D ¯ : u ( X ) = 0 = ∣ ∇ u ( X ) ∣ } \left\{X\in \overline{D}:u\left(X)=0=| \nabla u\left(X)| \right\} , has finite ( d − 2 ) \left(d-2) -dimensional Hausdorff measure. In this article, we show that the assumption of C 1 {C}^{1} -Dini domains is sharp, by constructing a large class of non-Dini (but almost Dini) domains whose singular sets have infinite ℋ d − 2 {{\mathcal{ {\mathcal H} }}}^{d-2} -measures. 
    more » « less
  3. We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting J k −<#comment/> 1 ( s ) = ∫<#comment/> 0 s t k −<#comment/> 1 e −<#comment/> t 2 2 d t J_{k-1}(s)=\int ^s_0 t^{k-1} e^{-\frac {t^2}{2}}dt and c k −<#comment/> 1 = J k −<#comment/> 1 ( + ∞<#comment/> ) c_{k-1}=J_{k-1}(+\infty ) , we conjecture that the function F : [ 0 , 1 ] →<#comment/> R F:[0,1]\rightarrow \mathbb {R} , given by F ( a ) = ∑<#comment/> k = 1 n 1 a ∈<#comment/> E k ⋅<#comment/> ( β<#comment/> k J k −<#comment/> 1 −<#comment/> 1 ( c k −<#comment/> 1 a ) + α<#comment/> k ) \begin{equation*} F(a)= \sum _{k=1}^n 1_{a\in E_k}\cdot (\beta _k J_{k-1}^{-1}(c_{k-1} a)+\alpha _k) \end{equation*} (with an appropriate choice of a decomposition [ 0 , 1 ] = ∪<#comment/> i E i [0,1]=\cup _{i} E_i and coefficients α<#comment/> i , β<#comment/> i \alpha _i, \beta _i ) satisfies, for all symmetric convex sets K K and L L , and any λ<#comment/> ∈<#comment/> [ 0 , 1 ] \lambda \in [0,1] , F ( γ<#comment/> ( λ<#comment/> K + ( 1 −<#comment/> λ<#comment/> ) L ) ) ≥<#comment/> λ<#comment/> F ( γ<#comment/> ( K ) ) + ( 1 −<#comment/> λ<#comment/> ) F ( γ<#comment/> ( L ) ) . \begin{equation*} F\left (\gamma (\lambda K+(1-\lambda )L)\right )\geq \lambda F\left (\gamma (K)\right )+(1-\lambda ) F\left (\gamma (L)\right ). \end{equation*} We explain that this conjecture is “the most optimistic possible”, and is equivalent to the fact that for any symmetric convex set K K , itsGaussian concavity power p s ( K , γ<#comment/> ) p_s(K,\gamma ) is greater than or equal to p s ( R B 2 k ×<#comment/> R n −<#comment/> k , γ<#comment/> ) p_s(RB^k_2\times \mathbb {R}^{n-k},\gamma ) , for some k ∈<#comment/> { 1 , …<#comment/> , n } k\in \{1,\dots ,n\} . We call the sets R B 2 k ×<#comment/> R n −<#comment/> k RB^k_2\times \mathbb {R}^{n-k} round k k -cylinders; they also appear as the conjectured Gaussian isoperimetric minimizers for symmetric sets, see Heilman [Amer. J. Math. 143 (2021), pp. 53–94]. In this manuscript, we make progress towards this question, and show that for any symmetric convex set K K in R n \mathbb {R}^n , p s ( K , γ<#comment/> ) ≥<#comment/> sup F ∈<#comment/> L 2 ( K , γ<#comment/> ) ∩<#comment/> L i p ( K ) : ∫<#comment/> F = 1 ( 2 T γ<#comment/> F ( K ) −<#comment/> V a r ( F ) ) + 1 n −<#comment/> E X 2 , \begin{equation*} p_s(K,\gamma )\geq \sup _{F\in L^2(K,\gamma )\cap Lip(K):\,\int F=1} \left (2T_{\gamma }^F(K)-Var(F)\right )+\frac {1}{n-\mathbb {E}X^2}, \end{equation*} where T γ<#comment/> F ( K ) T_{\gamma }^F(K) is the F −<#comment/> F- torsional rigidity of K K with respect to the Gaussian measure.Moreover, the equality holds if and only if K = R B 2 k ×<#comment/> R n −<#comment/> k K=RB^k_2\times \mathbb {R}^{n-k} for some R > 0 R>0 and k = 1 , …<#comment/> , n k=1,\dots ,n .As a consequence, we get p s ( K , γ<#comment/> ) ≥<#comment/> Q ( E | X | 2 , E ‖<#comment/> X ‖<#comment/> K 4 , E ‖<#comment/> X ‖<#comment/> K 2 , r ( K ) ) , \begin{equation*} p_s(K,\gamma )\geq Q(\mathbb {E}|X|^2, \mathbb {E}\|X\|_K^4, \mathbb {E}\|X\|^2_K, r(K)), \end{equation*} where Q Q is a certain rational function of degree 2 2 , the expectation is taken with respect to the restriction of the Gaussian measure onto K K , ‖<#comment/> ⋅<#comment/> ‖<#comment/> K \|\cdot \|_K is the Minkowski functional of K K , and r ( K ) r(K) is the in-radius of K K . The result follows via a combination of some novel estimates, the L 2 L2 method (previously studied by several authors, notably Kolesnikov and Milman [J. Geom. Anal. 27 (2017), pp. 1680–1702; Amer. J. Math. 140 (2018), pp. 1147–1185;Geometric aspects of functional analysis, Springer, Cham, 2017; Mem. Amer. Math. Soc. 277 (2022), v+78 pp.], Kolesnikov and the author [Adv. Math. 384 (2021), 23 pp.], Hosle, Kolesnikov, and the author [J. Geom. Anal. 31 (2021), pp. 5799–5836], Colesanti [Commun. Contemp. Math. 10 (2008), pp. 765–772], Colesanti, the author, and Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139], Eskenazis and Moschidis [J. Funct. Anal. 280 (2021), 19 pp.]), and the analysis of the Gaussian torsional rigidity. As an auxiliary result on the way to the equality case characterization, we characterize the equality cases in the “convex set version” of the Brascamp-Lieb inequality, and moreover, obtain a quantitative stability version in the case of the standard Gaussian measure; this may be of independent interest. All the equality case characterizations rely on the careful analysis of the smooth case, the stability versions via trace theory, and local approximation arguments. In addition, we provide a non-sharp estimate for a function F F whose composition with γ<#comment/> ( K ) \gamma (K) is concave in the Minkowski sense for all symmetric convex sets. 
    more » « less
  4. The third Painlevé equation in its generic form, often referred to as Painlevé-III($$D_6$$), is given by $$ \frac{{\rm d}^2u}{{\rm d}x^2} =\frac{1}{u}\left(\frac{{\rm d}u}{{\rm d}x} \right)^2-\frac{1}{x} \frac{{\rm d}u}{{\rm d}x} + \frac{\alpha u^2 + \beta}{x}+4u^3-\frac{4}{u}, \qquad \alpha,\beta \in \mathbb C. $$ Starting from a generic initial solution $$u_0(x)$$ corresponding to parameters $$\alpha$$, $$\beta$$, denoted as the triple $$(u_0(x),\alpha,\beta)$$, we apply an explicit Bäcklund transformation to generate a family of solutions $$(u_n(x),\alpha + 4n,\beta + 4n)$$ indexed by $$n \in \mathbb N$$. We study the large $$n$$ behavior of the solutions $$(u_n(x), \alpha + 4n, \beta + 4n)$$ under the scaling $x = z/n$ in two different ways: (a) analyzing the convergence properties of series solutions to the equation, and (b) using a Riemann-Hilbert representation of the solution $$u_n(z/n)$$. Our main result is a proof that the limit of solutions $$u_n(z/n)$$ exists and is given by a solution of the degenerate Painlevé-III equation, known as Painlevé-III($$D_8$$), $$ \frac{{\rm d}^2U}{{\rm d}z^2} =\frac{1}{U}\left(\frac{{\rm d}U}{{\rm d}z}\right)^2-\frac{1}{z} \frac{{\rm d}U}{{\rm d}z} + \frac{4U^2 + 4}{z}.$$ A notable application of our result is to rational solutions of Painlevé-III($$D_6$$), which are constructed using the seed solution $(1,4m,-4m)$ where $$m \in \mathbb C \setminus \big(\mathbb Z + \frac{1}{2}\big)$$ and can be written as a particular ratio of Umemura polynomials. We identify the limiting solution in terms of both its initial condition at $z = 0$ when it is well defined, and by its monodromy data in the general case. Furthermore, as a consequence of our analysis, we deduce the asymptotic behavior of generic solutions of Painlevé-III, both $$D_6$$ and $$D_8$$ at $z = 0$. We also deduce the large $$n$$ behavior of the Umemura polynomials in a neighborhood of $z = 0$. 
    more » « less
  5. An \ell _p oblivious subspace embedding is a distribution over r \times n matrices \Pi such that for any fixed n \times d matrix A , \[ \Pr _{\Pi }[\textrm {for all }x, \ \Vert Ax\Vert _p \le \Vert \Pi Ax\Vert _p \le \kappa \Vert Ax\Vert _p] \ge 9/10,\] where r is the dimension of the embedding, \kappa is the distortion of the embedding, and for an n -dimensional vector y , \Vert y\Vert _p = (\sum _{i=1}^n |y_i|^p)^{1/p} is the \ell _p -norm. Another important property is the sparsity of \Pi , that is, the maximum number of non-zero entries per column, as this determines the running time of computing \Pi A . While for p = 2 there are nearly optimal tradeoffs in terms of the dimension, distortion, and sparsity, for the important case of 1 \le p \lt 2 , much less was known. In this article, we obtain nearly optimal tradeoffs for \ell _1 oblivious subspace embeddings, as well as new tradeoffs for 1 \lt p \lt 2 . Our main results are as follows: (1) We show for every 1 \le p \lt 2 , any oblivious subspace embedding with dimension r has distortion \[ \kappa = \Omega \left(\frac{1}{\left(\frac{1}{d}\right)^{1 / p} \log ^{2 / p}r + \left(\frac{r}{n}\right)^{1 / p - 1 / 2}}\right).\] When r = {\operatorname{poly}}(d) \ll n in applications, this gives a \kappa = \Omega (d^{1/p}\log ^{-2/p} d) lower bound, and shows the oblivious subspace embedding of Sohler and Woodruff (STOC, 2011) for p = 1 is optimal up to {\operatorname{poly}}(\log (d)) factors. (2) We give sparse oblivious subspace embeddings for every 1 \le p \lt 2 . Importantly, for p = 1 , we achieve r = O(d \log d) , \kappa = O(d \log d) and s = O(\log d) non-zero entries per column. The best previous construction with s \le {\operatorname{poly}}(\log d) is due to Woodruff and Zhang (COLT, 2013), giving \kappa = \Omega (d^2 {\operatorname{poly}}(\log d)) or \kappa = \Omega (d^{3/2} \sqrt {\log n} \cdot {\operatorname{poly}}(\log d)) and r \ge d \cdot {\operatorname{poly}}(\log d) ; in contrast our r = O(d \log d) and \kappa = O(d \log d) are optimal up to {\operatorname{poly}}(\log (d)) factors even for dense matrices. We also give (1) \ell _p oblivious subspace embeddings with an expected 1+\varepsilon number of non-zero entries per column for arbitrarily small \varepsilon \gt 0 , and (2) the first oblivious subspace embeddings for 1 \le p \lt 2 with O(1) -distortion and dimension independent of n . Oblivious subspace embeddings are crucial for distributed and streaming environments, as well as entrywise \ell _p low-rank approximation. Our results give improved algorithms for these applications. 
    more » « less