Results 1 to 10 of about 15,520,995 (329)
N-distance tests of uniformity on the hypersphere
Nonlinear Analysis, 2010 In this paper we propose an application of N-distance theory for testing the hypothesis of uniformity on hypersphere S p − 1. The work is a continuation of our research started in [1, 2]. Particular attention is devoted to p = 2, 3 cases.
A. Bakshaev
doaj +7 more sources
Probing the deuteron structure at small N-N distances by cumulative pion production [PDF]
The European Physical Journal A, 2002 The fragmentation of deuterons into pions emitted forward in the kinematic region forbidden for free nucleon-nucleon collisions is analyzed. It is shown that the inclusion of the non-nucleonic degrees of freedom in a deuteron results in a satisfactory ...
445 +14 more
core +2 more sources
Accurate measurement of ^{13}C - ^{15}N distances with solid-state NMR [PDF]
The Journal of Chemical Physics, 2006 Solid-state NMR technique for measureing distances between hetero-nuclei in static powder samples is described. It is based on a two-dimensional single-echo scheme enhanced with adiabatic cross-polarization. As an example, the results for intra-molecular
A. K. Khitrin +5 more
core +3 more sources
Nonstandard n-distances based on certain geometric constructions [PDF]
Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2022 The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical constructions. In particular, our study shows to which extent the computation of the best constant associated with an $n$
Gergely Kiss, Jean-Luc Marichal
openaire +5 more sources
Estimating the emissions potential of marine transportation using the Kra Canal
Maritime Transport Research, 2022 The Panama and Suez canals greatly reduced pollutant emissions from shipping through much reduced sailing distances. Another possible future canal is across the Kra isthmus in Thailand, reducing sailing distances for ships travelling from East Asia to ...
Po-Hsing Tseng, Nick Pilcher
doaj +1 more source
On the Configurations with n Points and Two Distances [PDF]
Mathematics Interdisciplinary Research, 2019 In this paper we investigate the geometric structures of M(n, 2) containing n points in R^3 having two distinct distances. We will show that up to pseudo-equivalence there are 5 constructible models for M(4, 2) and 17 constructible models for M(5, 2).
Ali Asghar Rezaei
doaj +1 more source
Computation of Gordian distances and H2-Gordian distances of knots [PDF]
Yugoslav Journal of Operations Research, 2015 One of the most complicated problems in Knot theory is to compute unknotting number. Hass, Lagarias and Pippenger proved that the unknotting problem is NP hard.
Zeković Ana
doaj +1 more source
Further Remarks on n-Distance-Balanced Graphs [PDF]
Journal of the Indonesian Mathematical Society, 2019 Throughout this paper, we present a new strong property of graph so-called nicely n-distance-balanced which is notably stronger than the concept of n-distance-balanced recently given by the authors. We also initially introduce a newgraph invariant which modies Szeged index and is suitable to study n-distance-balanced graphs.
Faghani, Morteza, Pourhadi, Ehsan
openaire +2 more sources
Distances in random Apollonian network structures [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper, we study the distribution of distances in random Apollonian network structures (RANS), a family of graphs which has a one-to-one correspondence with planar ternary trees. Using multivariate generating functions that express all information
Olivier Bodini +2 more
doaj +1 more source
On the best constants associated with n-distances
Acta Mathematica Hungarica, 2020 We pursue the investigation of the concept of $n$-distance, an $n$-variable version of the classical concept of distance recently introduced and investigated by Kiss, Marichal, and Teheux. We especially focus on the challenging problem of computing the best constant associated with a given $n$-distance. In particular, we define and investigate the best
Kiss, Gergely, Marichal, Jean-Luc
openaire +6 more sources