Sign Up to like & get
recommendations!
1
Published in 2019 at "Acta Mathematica Sinica, English Series"
DOI: 10.1007/s10114-019-8058-5
Abstract: For a double array {Vm,n,m ≥ 1, n ≥ 1} of independent, mean 0 random elements in a real separable Rademacher type p (1 ≤ p ≤ 2) Banach space and an increasing double array…
read more here.
Keywords:
large numbers;
random elements;
banach space;
leq leq ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Advances in Mathematics"
DOI: 10.1016/j.aim.2018.10.043
Abstract: Let $d\geq 2$ be an integer and let $2d/(d-1) < q \leq \infty$. In this paper we investigate the sharp form of the mixed norm Fourier extension inequality \begin{equation*} \big\|\widehat{f\sigma}\big\|_{L^q_{{\rm rad}}L^2_{{\rm ang}}(\mathbb{R}^d)} \leq {\bf C}_{d,q}\,…
read more here.
Keywords:
restriction;
mixed norm;
leq leq;
norm spherical ... See more keywords
Sign Up to like & get
recommendations!
2
Published in 2023 at "Publications of the Astronomical Society of Australia"
DOI: 10.1017/pasa.2023.22
Abstract: Abstract A new determination of the temperature of the intergalactic medium (IGM) over $3.9 \leq z \leq 4.3$ is presented. We applied the curvature method on a sample of 10 high-resolution quasar spectra from the…
read more here.
Keywords:
leq leq;
leq;
intergalactic medium;
thermal history ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2018 at "Physical Review D"
DOI: 10.1103/physrevd.97.124011
Abstract: A large number of theoretically predicted waveforms are required by matched-filtering searches for the gravitational-wave signals produced by compact binary coalescence. In order to substantially alleviate the computational burden in gravitational-wave searches and parameter estimation…
read more here.
Keywords:
reduced order;
order;
leq leq;
fast prediction ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2017 at "Opuscula Mathematica"
DOI: 10.7494/opmath.2017.37.4.509
Abstract: Let \(G=(V,E)\) be a connected graph (or hypergraph) and let \(d(x,y)\) denote the distance between vertices \(x,y\in V(G)\). A subset \(W\subseteq V(G)\) is called a resolving set for \(G\) if for every pair of distinct…
read more here.
Keywords:
circulant graphs;
dimension;
dimension circulant;
leq leq ... See more keywords