Division and k-th root theorems for Q-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f:K→X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X2 and X×[0,1] are Q-manifolds as well. We construct a countable familyχof spaces with DDP and cd-AP such that no space X∈χis homeomorphic to the Hilbert cube Q whereas the product X×Y of any different spaces X, Y∈χis homeomorphic to Q. We also show that no uncountable familyχwith such properties exists.     

A classification of regular embeddings of hypercubes Q_(2m) with m odd

In this paper we give a classification of the orientable regular embeddings of Q_n for n=2m with m odd.Actually we prove that the known examples given by Kwon are the only regular maps of Q_n when n=2m (m odd).     

<Emphasis Type="Italic">Q</Emphasis>-measures on <Emphasis Type="Italic">Q</Emphasis><Subscript><Emphasis Type="Italic">κ</Emphasis></Subscript>λ

 We give a characterization of strongly compact cardinals in terms of Q _κ λ. We also prove that weakly normal Q-measures on Q _κ λ are ⊂κ-normal. Received: 29 September 2000 / Revised version: March 2002 Published online: 5 November 2002 This project is supported by the New Zealand Marsden Fund. The author wishes to thank the referee for numerous comments and suggestions which have been incorporated into this version of the paper.     

On <Emphasis Type="Italic">k</Emphasis>-Spaces and <Emphasis Type="Italic">k</Emphasis><Subscript><Emphasis Type="Italic">R</Emphasis></Subscript>-Spaces

In this note we study the relation between k _R -spaces and k-spaces and prove that a k _R -space with a σ-hereditarily closure-preserving k-network consisting of compact subsets is a k-space, and that a k _R -space with a point-countable k-network consisting of compact subsets need not be a k-space. This work was supported by the NSF of China (10271056).     

κ-Gorenstein Modules

Let A and F be artin algebras and ∧UГa paper, we first introduce the notion of k-Gorenstein faithfully balanced selforthogonal bimodule. In this modules with respect to ∧UГ and then characterize it in terms of the U-resolution dimension of some special injective modules and the property of the functors Ext^i （Ext^i （-, U）, U） preserving monomorphisms, which develops a classical result of Auslander. As an application, we study the properties of dual modules relative to Gorenstein bimodules. In addition, we give some properties of ∧UГwith finite left or right injective dimension.     

Knots and <Emphasis Type="Italic">k</Emphasis>-width

We investigate several natural invariants of curves and knots in \mathbbR³{\mathbb{R}^3} . These invariants generalize bridge number and width. As with bridge number, there are connections to the total curvature of a curve.     

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.     

Nonparametric inference for sequential <Emphasis Type="Italic">k</Emphasis>-out-of-<Emphasis Type="Italic">n</Emphasis> systems

The k-out-of-n model is commonly used in reliability theory. In this model the failure of any component of the system does not influence the components still at work. Sequential k-out-of-n systems have been introduced as an extension of k-out-of-n systems where the failure of some component of the system may influence the remaining ones. We consider nonparametric estimation of the cumulative hazard function, the reliability function and the quantile function of sequential k-out-of-n systems. Furthermore, nonparametric hypothesis testing for sequential k-out-of-n-systems is examined. We make use of counting processes to show strong consistency and weak convergence of the estimators and to derive the asymptotic distribution of the test statistics.     

Harnack estimate for the <Emphasis Type="Italic">H</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript>-flow

We obtain the Harnack estimate of the solution to Hk-flow in Euclidean space Rn 1,for k ＞ 0.By using this estimate,we get some corollaries about the translation soliton.     

Compatible Lie-Poisson brackets on the Lie algebras <Emphasis Type="Italic">e</Emphasis>(3) and <Emphasis Type="Italic">so</Emphasis>(4)

We completely classify the compatible Lie-Poisson brackets on the dual spaces of the Lie algebras e(3) and so(4). The corresponding bi-Hamiltonian systems are the spinning tops corresponding to the classical cases of integrability of the Euler equations, the Kirchhoff equations, and the Poincaré-Zhukovskii equations. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 151, No. 1, pp. 26–43, April, 2007.     

Intrinsic normalizations of a nonholonomic hypersurface with <Emphasis Type="Italic">m</Emphasis>-dimensional generators in affine space <Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

We consider some intrinsic normalizations of a nonholonomic hypersurface with m-dimensional generators in the n-dimensional affine spaced. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 3, pp. 532–562, October–December, 2007.     

<Emphasis Type="Italic">k</Emphasis>-factors in regular graphs

Plesnik in 1972 proved that an （m - 1）-edge connected m-regular graph of even order has a 1-factor containing any given edge and has another 1-factor excluding any given m - 1 edges. Alder et al. in 1999 showed that if G is a regular （2n ＋ 1）-edge-connected bipartite graph, then G has a 1-factor containing any given edge and excluding any given matching of size n. In this paper we obtain some sufficient conditions related to the edge-connectivity for an n-regular graph to have a k-factor containing a set of edges and （or） excluding a set of edges, where 1 ≤ k ≤n/2. In particular, we generalize Plesnik＇s result and the results obtained by Liu et al. in 1998, and improve Katerinis＇ result obtained 1993. Furthermore, we show that the results in this paper are the best possible.     

A parametric <Emphasis Type="Italic">k</Emphasis>-means algorithm

The k points that optimally represent a distribution (usually in terms of a squared error loss) are called the k principal points. This paper presents a computationally intensive method that automatically determines the principal points of a parametric distribution. Cluster means from the k-means algorithm are nonparametric estimators of principal points. A parametric k-means approach is introduced for estimating principal points by running the k-means algorithm on a very large simulated data set from a distribution whose parameters are estimated using maximum likelihood. Theoretical and simulation results are presented comparing the parametric k-means algorithm to the usual k-means algorithm and an example on determining sizes of gas masks is used to illustrate the parametric k-means algorithm.     

Cliques in <Emphasis Type="Italic">k</Emphasis>-connected graphs

The paper studies the existence of (n + 1)-cliques in k-connected graphs. It is proved that, in a k-connected graph G, such a clique exists, provided that the following conditions are fulfilled: (1) the vertices of every n-clique of G belong to a k-cutset; (2) the removal of certain pairs each of which consists of a vertex and an edge decreases the connectivity of the graph G by 2. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 340, 2006, pp. 76–86.     

Blocks in <Emphasis Type="Italic">k</Emphasis>-connected graphs

For a k-connected graph, we define the notion of a block by means of local vertex connectivity and prove some properties of blocks that generalize the properties of classical biconnected blocks of a connected graph. We investigate the structure of the decomposition of a k-connected graph by several cuts. Bibliography: 9 titles.Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 293, 2002, pp. 59–93.This revised version was published online in April 2005 with a corrected cover date and article title.     

Primitive <Emphasis Type="Italic">k</Emphasis>-free permutation groups

For a finite permutation group G acting on a set Ω, we say that G is k-free if the set-wise stabilizer of every k-subset of Ω is trivial. The purpose of this article is to describe, for all k, the primitive k-free permutation groups. Received: 20 February 2006     

<Emphasis Type="Italic">K</Emphasis>th Roots of <Emphasis Type="Italic">p</Emphasis>-Hyponormal Operators are Subscalar Operators of Order 4<Emphasis Type="Italic">k</Emphasis>

In this paper, we consider the special case of the question raised by Halmos (see below). In particular, we show that if T^k is p-hyponormal, then T is a subscalar operator of order 4k. As a corollary, we obtain that if T^k is p-hyponormal and σ(T) has nonempty interior in the plane, then T has a nontrivial invariant subspace.