Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe minimal spherical dispersion
56
0
0.0
(
0
)
Added by
Joscha Prochno
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this paper we prove upper and lower bounds on the minimal spherical dispersion. In particular, we see that the inverse $N(varepsilon,d)$ of the minimal spherical dispersion is, for fixed $varepsilon>0$, up to logarithmic terms linear in the dimension $d$. We also derive upper and lower bounds on the expected dispersion for points chosen independently and uniformly at random from the Euclidean unit sphere.
rate research
Read More
Multispecies contaminant transport in the Earths subsurface is commonly modelled using advection-dispersion equations coupled via first-order reactions. Analytical and semi-analytical solutions for such problems are highly sought after but currently limited to either one species, homogeneous media, certain reaction networks, specific boundary conditions or a combination thereof. In this paper, we develop a semi-analytical solution for the case of a heterogeneous layered medium and a general first-order reaction network. Our approach combines a transformation method to decouple the multispecies equations with a recently developed semi-analytical solution for the single-species advection-dispersion-reaction equation in layered media. The generalized solution is valid for arbitrary numbers of species and layers, general Robin-type conditions at the inlet and outlet and accommodates both distinct retardation factors across layers or distinct retardation factors across species. Four test cases are presented to demonstrate the solution approach with the reported results in agreement with previously published results and numerical results obtained via finite volume discretisation. MATLAB code implementing the generalized semi-analytical solution is made available.
This paper investigates the behaviour of the kissing number $kappa(n, r)$ of congruent radius $r > 0$ spheres in $mathbb{S}^n$, for $ngeq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $kappa(n, r)$ with relatively high accuracy by using new upper and lower bounds that are produced via semidefinite programming and by using spherical codes, respectively.
Let $mathfrak{M}$ be a class of metric spaces. A metric space $Y$ is minimal $mathfrak{M}$-universal if every $Xinmathfrak{M}$ can be isometrically embedded in $Y$ but there are no proper subsets of $Y$ satisfying this property. We find conditions under which, for given metric space $X$, there is a class $mathfrak{M}$ of metric spaces such that $X$ is minimal $mathfrak{M}$-universal. We generalize the notion of minimal $mathfrak{M}$-universal metric space to notion of minimal $mathfrak{M}$-universal class of metric spaces and prove the uniqueness, up to an isomorphism, for these classes. The necessary and sufficient conditions under which the disjoint union of the metric spaces belonging to a class $mathfrak{M}$ is minimal $mathfrak{M}$-universal are found. Examples of minimal universal metric spaces are constructed for the classes of the three-point metric spaces and $n$-dimensional normed spaces. Moreover minimal universal metric spaces are found for some subclasses of the class of metric spaces $X$ which possesses the following property. Among every three distinct points of $X$ there is one point lying between the other two points.
Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a homotopy between the two sets that maintains the uniqueness and the combinatorial structure of the Steiner minimal tree throughout the homotopy.
In this paper we present the results of computer searches using a variation of an energy minimization algorithm used by Kottwitz for finding good spherical codes. We prove that exact codes exist by representing the inner products between the vectors as algebraic numbers. For selected interesting cases, we include detailed discussion of the configurations. Of particular interest are the 20-point code in $mathbb{R}^6$ and the 24-point code in $mathbb{R}^7$, which are both the union of two cross polytopes in parallel hyperplanes. Finally, we catalogue all of the codes we have found.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
