- Sloane, N. J. A. (ed.). "Sequence A004115 (Number of
unlabeled rooted nonseparable graphs with n nodes)". The On-Line
Encyclopedia of
Integer Sequences...
- In
graph theory, a
biconnected graph is a
connected and "
nonseparable" graph,
meaning that if any one
vertex were to be removed, the
graph will remain...
- with
separable Hamiltonians with very
small error constants.
General nonseparable Hamiltonians can also be
explicitly and
symplectically integrated. To...
-
gradual development of
quantum mechanics.
Holism in
physics is the
nonseparability of
physical systems from
their parts,
especially quantum phenomena...
- of
labeled connected graphs with n
nodes and 0
cutpoints (blocks or
nonseparable graphs))". The On-Line
Encyclopedia of
Integer Sequences. OEIS Foundation...
-
constructive mathematics,
since many
theorems that can be
proved for
nonseparable spaces have
constructive proofs only for
separable spaces. Such constructive...
-
perceptron can
learn to
classify any half-space. It
cannot solve any
linearly nonseparable vectors, such as the
Boolean exclusive-or
problem (the
famous "XOR problem")...
- Note that the two σ-algebra are
equal for
separable spaces. For some
nonseparable spaces, some maps are ball
measurable even
though they are not Borel...
-
multidimensional (M-D) dual-tree C{\displaystyle \mathbb {C} }WT is
nonseparable but is
based on a com****tionally efficient,
separable filter bank (FB)...
- {\displaystyle X^{\prime \prime }/X} is infinite-dimensional, and even
nonseparable. However,
Robert C.
James has
constructed an
example of a non-reflexive...
