Parallel multiple-input multiple-output (MIMO) broadcast channels are separable from an information theoretic point of view, i.e., the whole capacity region can be achieved with strategies that perform independent encoding and decoding on each carrier subject to a power allocation across carriers. However, recent research has revealed that such a separate transmission can become suboptimal if t...

Asymmetric steering is an effect whereby an inseparable bipartite system can be found to be described by either quantum mechanics or local hidden variable theories depending on which one of Alice or Bob makes the required measurements. We show that, even with an inseparable bipartite system, situations can arise where Gaussian measurements on one half are not sufficient to answer the fundamenta...

We investigate the coradical filtration of pointed coalgebras. First, we generalize a theorem of Taft and Wilson using techniques developed by Radford in [Rad78] and [Rad82]. We then look at the coradical filtration of duals of inseparable field extensions L∗ upon extension of the base field K, where K ⊆ L is a field extension. We reduce the problem to the case that the field extension is purel...

We prove that every place P of an algebraic function field F |K of arbitrary characteristic admits local uniformization in a finite extension F of F. We show that F|F can be chosen to be Galois, after a finite purely inseparable extension of the ground field K. Instead of being Galois, the extension can also be chosen such that the induced extension FP |F P of the residue fields is purely insep...

Domains of individual preferences for which the well-known impossibility Theorems of Gibbard-Satterthwaite and Muller-Satterthwaite do not hold are studied. First, we introduce necessary and sufficient conditions for a domain to admit non-dictatorial, Pareto efficient and either strategy-proof or Maskin monotonic social choice rules. Next, to comprehend the limitations the two Theorems imply fo...

Normal support vector machine (SVM) is not suitable for classification of large data sets because of high training complexity. Convex hull can simplify the SVM training. However, the classification accuracy becomes lower when there exist inseparable points. This paper introduces a novel method for SVM classification, called convex–concave hull SVM (CCH-SVM). After grid processing, the convex hu...