When is a Cleft Extension H-Azumaya?

We show which H ^op -cleft extensions of k for a dual quasi-triangular Hopf algebra (H, r) are H-Azumaya. The result is given in terms of bijectivity of a map defined in terms of the universal r-form r and the 2-cocycle σ, generalizing a well-known result for the commutative and co-commutative case. We illustrate the Theorem with an explicit computation for the Hopf algebras of type E(n).Presented by A. Verschoren     

On extremally disconnected topological groups

We introduce the notion of a partially selective ultrafilter and prove that (a) if G is an extremally disconnected topological group and p is a converging nonprincipal ultrafilter on G containing a countable discrete subset, then p is partially selective, and (b) the existence of a nonprincipal partially selective ultrafilter on a countable set implies the existence of a P-point in ω^∗. Thus it is consistent with ZFC that there is no extremally disconnected topological group containing a countable discrete nonclosed subset.     

Phase portraits of quadratic polynomial vector fields having a rational first integral of degree 2

We classify all the global phase portraits of the quadratic polynomial vector fields having a rational first integral of degree 2. In other words we characterize all the global phase portraits of the quadratic polynomial vector fields having all their orbits contained in conics. For such a vector field there are exactly 25 different global phase portraits in the Poincaré disc, up to a reversal of sense.     

甲基苯丙胺电化学检测条件的优化

采用电化学方法检测甲基苯丙胺,探讨了不同扫描速度、初始浓度、pH值、电极处理温度及干扰物对检测的影响,获得了甲基苯丙胺电化学检测的最佳条件.结果表明,工作电极为掺硼金刚石薄膜电极,扫描速度为50~100 m V/s,初始浓度小于100 mg/L,pH=7.0及电极处理温度为100℃时,甲基苯丙胺的检测速度最快,检测结果最好,同时干扰物对于电化学方法检测甲基苯丙胺无明显影响.     

Almost maximal spaces

A topological space X is called almost maximal if it is without isolated points and for every x∈X, there are only finitely many ultrafilters on X converging to x. We associate with every countable regular homogeneous almost maximal space X a finite semigroup Ult(X) so that if X and Y are homeomorphic, Ult(X) and Ult(Y) are isomorphic. Semigroups Ult(X) are projectives in the category F of finite semigroups. These are bands decomposing into a certain chain of rectangular components. Under MA, for each projective S in F, there is a countable almost maximal topological group G with Ult(G) isomorphic to S. The existence of a countable almost maximal topological group cannot be established in ZFC. However, there are in ZFC countable regular homogeneous almost maximal spaces X with Ult(X) being a chain of idempotents.     

One-step and extrapolation methods for differential-algebraic systems

Summary The paper analyzes one-step methods for differential-algebraic equations (DAE) in terms of convergence order. In view of extrapolation methods, certain perturbed asymptotic expansions are shown to hold. For the special DAE extrapolation solver based on the semi-implicit Euler discretization, the perturbed order pattern of the extrapolation tableau is derived in detail. The theoretical results lead to modifications of the known code. The efficiency of the modifications is illustrated by numerical comparisons over critical examples mainly from chemical combustion.     

On approximation and representation of K-regularized resolvent families

We study the problem of approximation and representation for a family of strongly continuous operators defined in a Banach space. It allows us to extend, and in some cases to improve results from the theory ofC ₀-semigroups of operators to, among others, the theories of cosine families, n-times integrated semigroups, resolvent families and k-generalized solutions by means of an unified method.The author was supported by FONDECYT grants 1980812; 1970722 and DICYT (USACH).     

Rank estimation in reduced-rank regression

Reduced rank regression assumes that the coefficient matrix in a multivariate regression model is not of full rank. The unknown rank is traditionally estimated under the assumption of normal responses. We derive an asymptotic test for the rank that only requires the response vector have finite second moments. The test is extended to the nonconstant covariance case. Linear combinations of the components of the predictor vector that are estimated to be significant for modelling the responses are obtained.     

On the Szeged and the Laplacian Szeged spectrum of a graph

For a given graph G its Szeged weighting is defined by w(e)=n_u(e)n_v(e), where e=uv is an edge of G,n_u(e) is the number of vertices of G closer to u than to v, and n_v(e) is defined analogously. The adjacency matrix of a graph weighted in this way is called its Szeged matrix. In this paper we determine the spectra of Szeged matrices and their Laplacians for several families of graphs. We also present sharp upper and lower bounds on the eigenvalues of Szeged matrices of graphs.