Abstract Let P be a closed convex cone in $\mathbb{R}^d$ which is assumed to spanning and contains no line. In this article, we consider family of CAR flows over study the decomposability associated product systems. We establish necessary sufficient condition for flow decomposable. As consequence, show that there are uncountable many cocycle conjugate corresponding CCR flows.

In this work we deal with the problem of how to squeeze multiple ciphertexts without losing original message information. To do so, we formalize the notion of decomposability for public-key encryption and investigate why adding decomposability is challenging. We construct an ElGamal encryption scheme over extension fields, and show that it supports the efficient decomposition. We then analyze s...

We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We apply it to give new sufficient conditions for indecomposability of polytopes, and then illustrate them with some examples.

The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to exte...

Naoki Miyagawa1,2 Hiroshi Teramoto1,3 Chun-Biu Li1,2,4 Tamiki Komatsuzaki1,3,4 1Research Institute for Electronic Science Hokkaido University, Sapporo 001-0020, Japan 2Department of Mathematics Hokkaido University, Sapporo 060-0810, Japan 3Graduate School of Life Science Hokkaido University, Sapporo 060-0810, Japan 4Research Center for Integrative Mathematics Hokkaido University, Sapporo 060-08...

In complex diversity analysis, specially arising in genetics, genomics, ecology and other high-dimensional (and sometimes low sample size) data models, typically subgroup-decomposability (analogous to ANOVA decomposability) arises. In groupdivergence of diversity measures in a high-dimension low sample size scenario, it is shown that Hamming distance-type statistics lead to a general class of q...