57,066 research outputs found
Partial Covering Arrays: Algorithms and Asymptotics
A covering array is an array with entries
in , for which every subarray contains each
-tuple of among its rows. Covering arrays find
application in interaction testing, including software and hardware testing,
advanced materials development, and biological systems. A central question is
to determine or bound , the minimum number of rows of
a . The well known bound
is not too far from being
asymptotically optimal. Sensible relaxations of the covering requirement arise
when (1) the set need only be contained among the rows
of at least of the subarrays and (2) the
rows of every subarray need only contain a (large) subset of . In this paper, using probabilistic methods, significant
improvements on the covering array upper bound are established for both
relaxations, and for the conjunction of the two. In each case, a randomized
algorithm constructs such arrays in expected polynomial time
On the Asymptotic Dynamics of a Quantum System Composed by Heavy and Light Particles
We consider a non relativistic quantum system consisting of heavy and
light particles in dimension three, where each heavy particle interacts with
the light ones via a two-body potential . No interaction is assumed
among particles of the same kind. Choosing an initial state in a product form
and assuming sufficiently small we characterize the asymptotic
dynamics of the system in the limit of small mass ratio, with an explicit
control of the error. In the case K=1 the result is extended to arbitrary
. The proof relies on a perturbative analysis and exploits a
generalized version of the standard dispersive estimates for the
Schr\"{o}dinger group. Exploiting the asymptotic formula, it is also outlined
an application to the problem of the decoherence effect produced on a heavy
particle by the interaction with the light ones.Comment: 38 page
- …