Results 11 to 20 of about 1,595,142 (164)
N-distance tests of uniformity on the hypersphere
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
The Modified Superomedial Pedicle Breast Reduction Technique for Cases with SN-N Distance Exceeding 33 cm. [PDF]
Abstract Background Symptomatic breast hypertrophy affects the quality of life of a large number of women globally. Many reduction mammoplasty techniques have been described for patients with breast hypertrophy. The aim of this study was to provide our clinic’s experience in utilizing the modified superomedial pedicle
Panopoulou G +3 more
europepmc +3 more sources
Nonstandard n-distances based on certain geometric constructions [PDF]
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
On the best constants associated with n-distances [PDF]
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 +5 more sources
Further Remarks on n-Distance-Balanced Graphs [PDF]
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
Mappings of preserving n-distance one in n-normed spaces [PDF]
11 ...
Xujian Huang, Dongni Tan
openaire +2 more sources
On $n$-norm preservers and the Aleksandrov conservative $n$-distance problem [PDF]
The goal of this paper is to point out that the results obtained in the recent papers [7,8,10,11] can be seriously strengthened in the sense that we can significantly relax the assumptions of the main results so that we still get the same conclusions.
openaire +6 more sources
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional expanders, in particular Ramanujan complexes.
Shai Evra, Tali Kaufman, Gilles Zémor
openaire +5 more sources
Probing the deuteron structure at small N-N distances by cumulative pion production [PDF]
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 description of the data for the inclusive pion spectrum and improves the description of the data about
Illarionov, Alexei Yu. +2 more
openaire +2 more sources
sMOOC: A pedagogical model for social inclusion
In this article, the results of analysing the sMOOC launched by European project E-learning, Communication, Open Data (ECO) are displayed, from the perspective of social inclusion.
Carmen Marta-Lazo +2 more
doaj +1 more source

