We found an explicit construction of a representation of the positive quantum group and its modular double by positive essentially self-adjoint operators. Generalizing Lusztig's parametrization, we found a Gauss type decomposition for the totally positive quantum group parametrized by the standard decomposition of the longest element . Under this parametrization, we found explicitly the relations between the standard quantum variables, the relations between the quantum cluster variables, and realizing them using non-compact generators of the q-tori by positive essentially self-adjoint operators. The modular double arises naturally from the transcendental relations, and an space in the von Neumann setting can also be defined.

We construct the positive principal series representations for Uq(gR) where g is of type Bn, Cn, F4 or G2, parametrized by Rn where n is the rank of g. We show that under the representations, the generators of the Langlands dual group Uq(LgR) are related to the generators of Uq(gR) by the transcendental relations. This gives a new and very simple analytic relation between the Langlands dual pair. We define the modified quantum group Uqq(gR)=Uq(gR) ⊗ Uq(LgR) of the modular double and show that the representations of both parts of the modular double commute with each other, and there is an embedding into the q-tori polynomials.

We study the root of unity degeneration of cluster algebras and quantum dilogarithm identities. We prove identities for the cyclic dilogarithm associated with a mutation sequence of a quiver, and as a consequence new identities for the noncompact quantum dilogarithm at |$b=1$|⁠.Communicated by Michio Jimbo

Sure screening technique has been considered as a powerful tool to handle the ultrahigh dimensional variable selection problems, where the dimensionality p and the sample size n can satisfy the NP dimensionality logp =O(na) for some a>0[J. R. Stat. Soc. Ser. B. Stat. Methodol. 70 (2008) 849–911]. The current paper aims to simultaneously tackle the “universality” and “effectiveness” of sure screening procedures. For the “universality,” we develop a general and unified framework for nonparametric screening methods from a loss function perspective. Consider a loss function to measure the divergence of the response variable and the underlying nonparametric function of covariates. We newly propose a class of loss functions called conditional strictly convex loss, which contains, but is not limited to, negative log likelihood loss from one-parameter exponential families, exponential loss for binary classification and quantile regression loss. The sure screening property and model selection size control will be established within this class of loss functions. For the “effectiveness,” we focus on a goodness-of-fit nonparametric screening (Goffins) method under conditional strictly convex loss. Interestingly, we can achieve a better convergence probability of containing the true model compared with related literature. The superior performance of our proposed method has been further demonstrated by extensive simulation studies and some real scientific data example.

Classification of DNA sequences is an important issue in the bioinformatics study, yet most existing methods for phylogenetic analysis including Multiple Sequence Alignment (MSA) are time-consuming and computationally expensive. The alignment-free methods are popular nowadays, whereas the manual intervention in those methods usually decreases the accuracy. Also, the interactions among nucleotides are neglected in most methods. Here we propose a new Accumulated Natural Vector (ANV) method which represents each DNA sequence by a point in R18. By calculating the Accumulated Indicator Functions of nucleotides, we can further find an Accumulated Natural Vector for each sequence. This new Accumulated Natural Vector not only can capture the distribution of each nucleotide, but also provide the covariance among nucleotides. Thus global comparison of DNA sequences or genomes can be done easily in R18. The tests of ANV of datasets of different sizes and types have proved the accuracy and time-efficiency of the new proposed ANV method.