We prove non-existence of C-smooth embeddings of n-dimensional discs to R such that the tangent spaces at distinct points are pairwise disjoint.

We analyze the structure of the imaginary part of the two-loop Euler-Heisenberg QED effective Lagrangian for a constant self-dual background. The novel feature of the two-loop result, compared to one-loop, is that the prefactor of each exponential (instanton) term in the imaginary part has itself an asymptotic expansion. We also perform a high-precision test of Borel summation techniques applie...

Current research proposes a natural environment for the space-time codes and in this context it is obtained a new design criterion for space-time codes in multi-antenna communication channels. The objective of this criterion is to minimize the pairwise error probability of the maximum likelihood decoder, endowed with the matrix spectrum norm. The random matrix theory is used and an approximatio...

In this paper, we propose a new pairwise key agreement, TLPKA (Tangent Line Pairwise Key Agreement), for establishing a secure link between members in an ad hoc network. With pairwise keys, data transmitted in ad hoc networks can be protected from the eavesdropping of outsiders. These pairwise keys can also be used to authenticate members in ad hoc networks. In addition, due to the property of ...

in this paper, the use of weighted pairwise likelihood instead of the full likelihood in estimating the parameters of the multivariate ar(1) is investigated. a closed formula for typical elements of the godambe information(sandwich information) is presented. some efficiency calculations are also given to discuss the feasibility andcomputational advantages of the weighted pairwise likelihood app...

With each sequence α = (αn)n∈N of pairwise distinct and non-zero points which are such that the canonical product

Given a set V of n elements we wish to linearly order them given pairwise preference labels which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly order the elements while disagreeing with as few pairwise preference labels as possible. Our performance is measured by two parameters: The number of disagreements (loss) and the query complexity (number of pai...

Ranking from pairwise comparisons is a ubiquitous problem and has been studied in disciplines ranging from statistics to operations research and from theoretical computer science to machine learning. Here we consider a general setting where outcomes of pairwise comparisons between items i and j are drawn probabilistically by flipping a coin with unknown bias Pij , and ask under what conditions ...