نتایج جستجو برای: strong arcs
تعداد نتایج: 380197 فیلتر نتایج به سال:
Statistics of lensed arcs in clusters of galaxies serve as a powerful probe of both the non-sphericity and the inner slope of dark matter halos. We develop a semi-analytic method to compute the number of arcs in triaxial dark matter halos. This combines the lensing cross section from the Monte Carlo ray-tracing simulations, and the probability distribution function (PDF) of the axis ratios eval...
Since the discovery of topological insulators a lot research effort has been devoted to magnetic materials, in which non-trivial spin properties can be controlled by fields, culminating wealth fundamental phenomena and possible applications. The main focus was on ferromagnetic materials that host Weyl fermions therefore textured Fermi arcs. recent arcs new bands splitting antiferromagnet (AFM) ...
An arc in a tournament T with n 3 vertices is called k-pancyclic, if it belongs to a cycle of length for all k n. In this paper, we show that each s-strong tournament with s 3 contains at least s + 1 vertices whose out-arcs are 4-pancyclic. © 2006 Elsevier B.V. All rights reserved.
We report on the results of a visual search for galaxy-scale strong gravitational lenses over 650 arcmin of HST/ACS imaging in the Extended Groth Strip (EGS). These deep F606Wand F814W-band observations are in the DEEP2-EGS field. In addition to a previously-known Einstein Cross also found by our search (the “Cross,” HSTJ141735+52264, with zlens = 0.8106 and a published zsource = 3.40), we iden...
Robustness of ecological flow networks under random failure of arcs is considered with respect to two different functionalities: coherence and circulation. In our previous work, we showed that each functionality is associated with a natural path notion: lateral path for the former and directed path for the latter. Robustness of a network is measured in terms of the size of the giant laterally c...
Let M be an additive abelian group. An M-strong-oriented coloring of an oriented graph G is a mapping φ from V (G) to M such that φ(u) 6= φ(v) whenever −→uv is an arc in G and φ(v)−φ(u) 6= −(φ(t)−φ(z)) whenever −→uv and zt are two arcs in G. The strong oriented chromatic number of an oriented graph is the minimal order of a group M such that G has an M-strong-oriented coloring. This notion was ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید