We give the first (ZFC) dividing line in Keisler’s order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal λ for which there is μ < λ ≤ 2, we construct a regular ultrafilter D on λ such that (i) for any model M of a stable theory or of the random graph, M/D is λ-saturated but (ii) if Th(N) is not simple or not low then N/D is not λ-...

In this paper, we study cyclic stabiliser codes over Fp of length dividing p + 1 for some positive integer t. We call these t-Frobenius codes or just Frobenius codes for short. We give methods to construct them and show that they have efficient decoding algorithms. An important subclass of stabiliser codes are the linear stabiliser codes. For linear Frobenius codes we have stronger results: We ...

6 The increasing growth of data on protein-protein interaction (PPI) networks has boosted research 7 on their comparative analysis. In particular, recent studies proposed models and algorithms for 8 performing network alignment, that is, the comparison of networks across species for discovering 9 conserved functional complexes. In this paper, we present an algorithm for dividing PPI networks, 1...