CertainC*-algebras with real rank zero and their corona and multiplier algebras: II

We first determine the homotopy classes of nontrivial projections in a purely infinite simpleC*-algebraA, in the associated multiplier algebraM(A) and the corona algebraM A/A in terms ofK _*(A). Then we describe the generalized Fredholm indices as the group of homotopy classes of non-trivial projections ofA; consequently, we determine theK _*-groups of all hereditaryC*-subalgebras of certain corona algebras. Secondly, we consider a group structure of *-isomorphism classes of hereditaryC*-subalgebras of purely infinite simpleC*-algebras. In addition, we prove that ifA is aC*-algebra of real rank zero, then each unitary ofA, in caseA it unital, each unitary ofM(A) and ofM(A)/A, in caseA is nonunital but -unital, can be factored into a product of a unitary homotopic to the identity and a unitary matrix whose entries are all partial isometries (with respect to a decomposition of the identity).Partially supported by a grant from the National Science Foundation.     

半定矩阵秩极小的非凸精确松弛

本文主要研究半定矩阵秩极小问题(P)的非凸精确松弛及其性质.首先,为求解问题(P),我们引入其Schatten p-范数(0＜p＜1)松弛,记为(Sp).其次,通过定义半定限制等距常数和半定限制正交常数,我们给出了问题(P)有唯—解的充分条件.最后,利用半定限制等距性质,我们给出了问题(P)和(Sp)有相同唯一解的充分条件.特别地,对任意0＜p＜1,我们还得到—个一致的精确恢复条件.     

四川省市州经济发展差异的统计分析

采用因子分析研究四川省21市州之间的相关性,利用主因子计算出各个市州得分,以市州得分作为新变量进行集团排序,再将基于相对位置排序法引入到集团排序中,进而得到最终的市州分类结果,在统计分析的基础上对市州经济发展给出一些建议.     

Assessing the Calibration of High-Dimensional Ensemble Forecasts Using Rank Histograms

Any decision-making process that relies on a probabilistic forecast of future events necessarily requires a calibrated forecast. This article proposes new methods for empirically assessing forecast calibration in a multivariate setting where the probabilistic forecast is given by an ensemble of equally probable forecast scenarios. Multivariate properties are mapped to a single dimension through a prerank function and the calibration is subsequently assessed visually through a histogram of the ranks of the observation’s preranks. Average ranking assigns a prerank based on the average univariate rank while band depth ranking employs the concept of functional band depth where the centrality of the observation within the forecast ensemble is assessed. Several simulation examples and a case study of temperature forecast trajectories at Berlin Tegel Airport in Germany demonstrate that both multivariate ranking methods can successfully detect various sources of miscalibration and scale efficiently to high-dimensional settings. Supplemental material in form of computer code is available online.     

The minimum forcing number of perfect matchings in the hypercube

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of $M$. Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the $n$-dimensional hypercube is $2^{n?2}$, for all $n\ge 2$. This was revised by Riddle (2002), who conjectured that it is at least $2^{n?2}$, and proved it for all even $n$. We show that the revised conjecture holds for all $n\ge 2$. The proof is based on simple linear algebra.     

Uniqueness of Solution to Systems of Elliptic Operators and Application to Asymptotic Synchronization of Linear Dissipative Systems II: Case of Multiple Feedback Dampings

In this paper, the authors consider the asymptotic synchronization of a linear dissipative system with multiple feedback dampings. They ?rst show that under the observability of a scalar equation, Kalman’s rank condition is su?cient for the uniqueness of solution to a complex system of elliptic equations with mixedobservations. The authors then establish a general theory on the asymptotic stability and the asymptotic synchronization for the corresponding evolutional system subjected to mixed dampings of various natures. Some classic models are presented to illustrate the ?eld of applications of the abstract theory.     

Characterizing and Generating Bivariate Empirical Rank Distributions Satisfying Certain Positive Dependence Concepts

Abstract

This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class S_N of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of S_N that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of S_N. For example, the class of positively quadrant dependent permutations in S_N is characterized in this fashion.     

Groups with many subgroups having polycyclic-by-finite layers or derived subgroup

A group is called (PF)L if the subgroups generated by its elements having same order (finite or infinite) are polycyclic-by-finite. In the present paper we prove that a group is locally graded minimal non-((PF)L∪(𝔓𝔉)𝔄) if, and only if, it is non-perfect minimal non-FC, where (𝔓𝔉)𝔄 denotes the class of (polycyclic-by-finite)-by-abelian groups. We prove also that a group of infinite rank whose proper subgroups of infinite rank are in ((PF)L∪(𝔓𝔉)𝔄) is itself in ((PF)L∪(𝔓𝔉)𝔄) provided that it is locally (soluble-by-finite) without simple homomorphic images of infinite rank. Our last result concerns groups that satisfy the minimal condition on non-((PF)L∪(𝔓𝔉)𝔄)-subgroups.