The theoretical framework of General Recognition Theory (GRT; Ashby & Townsend, Psychological Review, 93, 154-179, 1986) coupled with the empirical analysis tools of Multidimensional Signal Detection Analysis (MSDA; Kadlec & Townsend, Multidimensional models of perception and recognition, pp. 181-228, 1992) have become one important method for assessing dimensional interactions in perceptual de...

We discuss residual finiteness and several related separability conditions for the class of monoid acts, namely weak subact separability, strong complete separability. For each these four conditions, we investigate which monoids have property that all their (finitely generated) acts satisfy condition. In particular, prove that: over a finite are completely separable (and hence other three condi...

In aggregation theory, the admissibility condition for clustering together components to be aggregated is blockwise weak separability, which also is the condition needed to separate out sectors of the economy. Although weak separability is thereby of central importance in aggregation and index number theory and in econometrics, prior attempts to produce statistical tests of weak separability ha...

When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory consisting of both the data and the constraints. Query answering in such a context is called ontological query answering. Commonly adopted database constraints in this field are tuple-generating dependencies (TGDs) and e...

When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory consisting of both the data and the constraints. Query answering in such a context is called ontological query answering. Commonly adopted database constraints in this field are tuple-generating dependencies (TGDs) and e...

The study of the separability of the Hamilton–Jacobi and the corresponding scalar field equations in a curved spacetime has a long history. Robertson [1] and Eisenhart [2] discussed general conditions for such a separability in spaces which admit a complete set of mutually orthogonal families of hypersurfaces. An important class of 4-dimensional separable spacetimes, including several type D me...

The notion of linear separability is widely used in machine learning research. Learning algorithms that use this concept to learn include neural networks (Single Layer Perceptron and Recursive Deterministic Perceptron), and kernel machines (Support Vector Machines). Several algorithms for testing linear separability exist. Some of these methods are computationally intense. Also, several of them...

By using the “subtracting projectors” method in proving the separability of PPT states on multiple quantum spaces, we derive a canonical form of PPT states in C1 ⊗CK2 ⊗· · ·⊗CKm ⊗CN composite quantum systems with rank N , from which a sufficient separability condition for these states is presented. As the key resource in quantum information processing [1], quantum entanglement has resulted in t...

One approach to monitoring a dynamic system relies on decomposition of the system into weakly interacting subsystems. An earlier paper introduced a notion of weak interaction called separability, and showed that it leads to exact propagation of marginals for prediction. This paper addresses two questions left open by the earlier paper: can we define a notion of approximate separability that occ...

We propose the Wigner separability entropy as a measure of complexity of a quantum state. This quantity measures the number of terms that effectively contribute to the Schmidt decomposition of the Wigner function with respect to a chosen phase-space decomposition. We prove that the Wigner separability entropy is equal to the operator space entanglement entropy, measuring entanglement in the spa...