Given a suitable solution
We investigate the properties of a special class of singular solutions for a self-gravitating perfect fluid in general relativity: the singular isothermal sphere. For arbitrary constant equation-of-state parameter
- NSF-PAR ID:
- 10307773
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- General Relativity and Gravitation
- Volume:
- 53
- Issue:
- 11
- ISSN:
- 0001-7701
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract V (t ,x ) to the Korteweg–de Vries equation on the real line, we prove global well-posedness for initial data . Our conditions on$$u(0,x) \in V(0,x) + H^{-1}(\mathbb {R})$$ V do include regularity but do not impose any assumptions on spatial asymptotics. We show that periodic profiles satisfy our hypotheses. In particular, we can treat localized perturbations of the much-studied periodic traveling wave solutions (cnoidal waves) of KdV. In the companion paper Laurens (Nonlinearity. 35(1):343–387, 2022.$$V(0,x)\in H^5(\mathbb {R}/\mathbb {Z})$$ https://doi.org/10.1088/1361-6544/ac37f5 ) we show that smooth step-like initial data also satisfy our hypotheses. We employ the method of commuting flows introduced in Killip and Vişan (Ann. Math. (2) 190(1):249–305, 2019.https://doi.org/10.4007/annals.2019.190.1.4 ) where . In that setting, it is known that$$V\equiv 0$$ is sharp in the class of$$H^{-1}(\mathbb {R})$$ spaces.$$H^s(\mathbb {R})$$ -
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 associated to a domain$$L_{\beta ,\gamma } =- {\text {div}}D^{d+1+\gamma -n} \nabla $$ with a uniformly rectifiable boundary$$\Omega \subset {\mathbb {R}}^n$$ of dimension$$\Gamma $$ , the now usual distance to the boundary$$d < n-1$$ given by$$D = D_\beta $$ for$$D_\beta (X)^{-\beta } = \int _{\Gamma } |X-y|^{-d-\beta } d\sigma (y)$$ , where$$X \in \Omega $$ and$$\beta >0$$ . In this paper we show that the Green function$$\gamma \in (-1,1)$$ G for , with pole at infinity, is well approximated by multiples of$$L_{\beta ,\gamma }$$ , in the sense that the function$$D^{1-\gamma }$$ satisfies a Carleson measure estimate on$$\big | D\nabla \big (\ln \big ( \frac{G}{D^{1-\gamma }} \big )\big )\big |^2$$ . 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).$$\Omega $$ -
Abstract Let us fix a prime
p and a homogeneous system ofm linear equations for$$a_{j,1}x_1+\dots +a_{j,k}x_k=0$$ with coefficients$$j=1,\dots ,m$$ . Suppose that$$a_{j,i}\in \mathbb {F}_p$$ , that$$k\ge 3m$$ for$$a_{j,1}+\dots +a_{j,k}=0$$ and that every$$j=1,\dots ,m$$ minor of the$$m\times m$$ matrix$$m\times k$$ is non-singular. Then we prove that for any (large)$$(a_{j,i})_{j,i}$$ n , any subset of size$$A\subseteq \mathbb {F}_p^n$$ contains a solution$$|A|> C\cdot \Gamma ^n$$ to the given system of equations such that the vectors$$(x_1,\dots ,x_k)\in A^k$$ are all distinct. Here,$$x_1,\dots ,x_k\in A$$ C and are constants only depending on$$\Gamma $$ p ,m andk such that . The crucial point here is the condition for the vectors$$\Gamma in the solution$$x_1,\dots ,x_k$$ to be distinct. If we relax this condition and only demand that$$(x_1,\dots ,x_k)\in A^k$$ are not all equal, then the statement would follow easily from Tao’s slice rank polynomial method. However, handling the distinctness condition is much harder, and requires a new approach. While all previous combinatorial applications of the slice rank polynomial method have relied on the slice rank of diagonal tensors, we use a slice rank argument for a non-diagonal tensor in combination with combinatorial and probabilistic arguments.$$x_1,\dots ,x_k$$ -
Abstract We study the sparsity of the solutions to systems of linear Diophantine equations with and without non-negativity constraints. The sparsity of a solution vector is the number of its nonzero entries, which is referred to as the
-norm of the vector. Our main results are new improved bounds on the minimal$$\ell _0$$ -norm of solutions to systems$$\ell _0$$ , where$$A\varvec{x}=\varvec{b}$$ ,$$A\in \mathbb {Z}^{m\times n}$$ and$${\varvec{b}}\in \mathbb {Z}^m$$ is either a general integer vector (lattice case) or a non-negative integer vector (semigroup case). In certain cases, we give polynomial time algorithms for computing solutions with$$\varvec{x}$$ -norm satisfying the obtained bounds. We show that our bounds are tight. Our bounds can be seen as functions naturally generalizing the rank of a matrix over$$\ell _0$$ , to other subdomains such as$$\mathbb {R}$$ . We show that these new rank-like functions are all NP-hard to compute in general, but polynomial-time computable for fixed number of variables.$$\mathbb {Z}$$ -
Abstract Recent spectacular advances by AI programs in 3D structure predictions from protein sequences have revolutionized the field in terms of accuracy and speed. The resulting “folding frenzy” has already produced predicted protein structure databases for the entire human and other organisms’ proteomes. However, rapidly ascertaining a predicted structure’s reliability based on measured properties in solution should be considered. Shape-sensitive hydrodynamic parameters such as the diffusion and sedimentation coefficients (
,$${D_{t(20,w)}^{0}}$$ ) and the intrinsic viscosity ([$${s_{{\left( {{20},w} \right)}}^{{0}} }$$ η ]) can provide a rapid assessment of the overall structure likeliness, and SAXS would yield the structure-related pair-wise distance distribution functionp (r ) vs.r . Using the extensively validated UltraScan SOlution MOdeler (US-SOMO) suite, a database was implemented calculating from AlphaFold structures the corresponding ,$${D_{t(20,w)}^{0}}$$ , [$${s_{{\left( {{20},w} \right)}}^{{0}} }$$ η ],p (r ) vs.r , and other parameters. Circular dichroism spectra were computed using the SESCA program. Some of AlphaFold’s drawbacks were mitigated, such as generating whenever possible a protein’s mature form. Others, like the AlphaFold direct applicability to single-chain structures only, the absence of prosthetic groups, or flexibility issues, are discussed. Overall, this implementation of the US-SOMO-AF database should already aid in rapidly evaluating the consistency in solution of a relevant portion of AlphaFold predicted protein structures.