<Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-nearest neighbor estimators of entropy

For estimating the entropy of an absolutely continuous multivariate distribution, we propose nonparametric estimators based on the Euclidean distances between the n sample points and their k _n -nearest neighbors, where {k _n : n = 1, 2, …} is a sequence of positive integers varying with n. The proposed estimators are shown to be asymptotically unbiased and consistent.      

κ-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.     

Localization of <Emphasis Type="Italic">LM</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-algebras

The aim of this paper is to define the localization LM _n -algebra of an LM _n —algebra L with respect to a topology F on L; in Section 5 we prove that the maximal LM _n -algebra of fractions (defined in [3]) and the LM _n -algebra of fractions relative to an Λ—closed system (defined in Section 2) are LM _n -algebras of localization.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-mixed intersection bodies

In this paper the author first introduce a new concept of L _p -dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of L _p intersection body to L _p -mixed intersection body. Inequalities for L _p -dual mixed volumes of L _p -mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities. This work was supported by the Natural Science Foundation of Zhejiang Province of China (Grant No. Y605065) and the Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

<Emphasis Type="Italic">∂</Emphasis>-operations and <Emphasis Type="Italic">H</Emphasis><Subscript><Emphasis Type="Italic">V</Emphasis></Subscript>-fields

The hyperoperations, called theta-operations （δ）, are motivated from the usual property, which the derivative has on the derivation of a product of functions. Using any map on a set, one can define δ-operations. In this paper, we continue our study on the δ-operations on groupoids, rings, fields and vector spaces or on the corresponding hyperstructures. Using δ-operations one obtains, mainly, Hwstructures, which form the largest class of the hyperstructures. For representation theory of hyperstructures, by hypermatrices, one needs special Hv-rings or Hy-fields, so these hyperstructures can be used. Moreover, we study the relation of these δ-structures with other classes of hyperstructures, especially with the Hv-structures.     

<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.     

Reliability formula &; limit law of the failure time of “<Emphasis Type="Italic">m</Emphasis>-consecutive-<Emphasis Type="Italic">k</Emphasis>-out-of-<Emphasis Type="Italic">n</Emphasis>:<Emphasis Type="Italic">F</Emphasis> system”

An “m-consecutive-k-out-of-n:F system” consists of n components ordered on a line; the system fails if and only if there are at least m nonoverlapping runs of k consecutive failed components. In this paper, we give a recursive formula to compute the reliability of such a system. Thereafter, we state two asymptotic results concerning the failure time Z _n of the system. The first result concerns a limit theorem for Z _n when the failure times of components are not necessarily with identical failure distributions. In the second one, we prove that, for an arbitrary common failure distribution of components, the limit system failure distribution is always of the Poisson class.      

The <Emphasis Type="Italic">k</Emphasis>-point exponent set of primitive digraphs with girth 2

Let D = （V, E） be a primitive digraph. The vertex exponent of D at a vertex v∈ V, denoted by expD（v）, is the least integer p such that there is a v →u walk of length p for each u ∈ V. Following Brualdi and Liu, we order the vertices of D so that exPD（V1） ≤ exPD（V2） …≤ exPD（Vn）. Then exPD（Vk） is called the k- point exponent of D and is denoted by exPD （k）, 1≤ k ≤ n. In this paper we define e（n, k） ：= max{expD （k） ｜ D ∈ PD（n, 2）} and E（n, k） ：= {exPD（k）｜ D ∈ PD（n, 2）}, where PD（n, 2） is the set of all primitive digraphs of order n with girth 2. We completely determine e（n, k） and E（n, k） for all n, k with n ≥ 3 and 1 ≤ k ≤ n.     

On <Emphasis Type="Italic">k</Emphasis>-pairable graphs from trees

The concept of the k-pairable graphs was introduced by Zhibo Chen (On k-pairable graphs, Discrete Mathematics 287 (2004), 11–15) as an extension of hypercubes and graphs with an antipodal isomorphism. In the same paper, Chen also introduced a new graph parameter p(G), called the pair length of a graph G, as the maximum k such that G is k-pairable and p(G) = 0 if G is not k-pairable for any positive integer k. In this paper, we answer the two open questions raised by Chen in the case that the graphs involved are restricted to be trees. That is, we characterize the trees G with p(G) = 1 and prove that p(G □ H) = p(G) + p(H) when both G and H are trees.     

<Emphasis Type="Italic">LJ</Emphasis>-spaces

In this paper LJ-spaces are introduced and studied. They are a common generalization of Lindelöf spaces and J-spaces researched by E. Michael. A space X is called an LJ-space if, whenever {A, B} is a closed cover of X with A ∩ B compact, then A or B is Lindelöf. Semi-strong LJ-spaces and strong LJ-spaces are also defined and investigated. It is demonstrated that the three spaces are different and have interesting properties and behaviors.     

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.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

Cc （X） Spaces with X Locally Compact

In this paper, we show, among other results, that if X is a [separable] locally compact space X [satisfying the first countability axiom] then the space Cc （X） has countable tightness [if and only if it has bounding tightness] if and only if it is Frechet-Urysohn, if and only if Cc （X） contains a dense （LM） subspace and if and only if X is a-compact.     

The <Emphasis Type="Italic">k</Emphasis>-domatic number of a graph

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-dominating set of the graph G is a subset D of V (G) such that every vertex of V (G)-D is adjacent to at least k vertices in D. A k-domatic partition of G is a partition of V (G) into k-dominating sets. The maximum number of dominating sets in a k-domatic partition of G is called the k-domatic number d _k (G). In this paper, we present upper and lower bounds for the k-domatic number, and we establish Nordhaus-Gaddum-type results. Some of our results extend those for the classical domatic number d(G) = d ₁(G).      

A new multivariable <Subscript><Emphasis Type="BoldItalic">6</Emphasis></Subscript><Emphasis Type="BoldItalic">ψ</Emphasis><Subscript><Emphasis Type="BoldItalic">6</Emphasis></Subscript> summation formula

By multidimensional matrix inversion, combined with an A _r extension of Jackson’s ₈ φ ₇ summation formula by Milne, a new multivariable ₈ φ ₇ summation is derived. By a polynomial argument this ₈ φ ₇ summation is transformed to another multivariable ₈ φ ₇ summation which, by taking a suitable limit, is reduced to a new multivariable extension of the nonterminating ₆ φ ₅ summation. The latter is then extended, by analytic continuation, to a new multivariable extension of Bailey’s very-well-poised ₆ ψ ₆ summation formula. Partly supported by FWF Austrian Science Fund grants P17563-N13, and S9607 (the second is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”).     

<Emphasis Type="Italic">k</Emphasis>-Free-like groups

The following results are proved. In Theorem 1, it is stated that there exist both finitely presented and not finitely presented 2-generated nonfree groups which are k-free-like for any k ⩾ 2. In Theorem 2, it is claimed that every nonvirtually cyclic (resp., noncyclic and torsion-free) hyperbolic m-generated group is k-free-like for every k ⩾ m + 1 (resp., k ⩾ m). Finally, Theorem 3 asserts that there exists a 2-generated periodic group G which is k-free-like for every k ⩾ 3. Supported by NSF (grant Nos. DMS 0455881 and DMS-0700811). (A. Yu. Olshanskii, M. V. Sapir) Supported by RFBR project No. 08-01-00573. (A. Yu. Olshanskii) Supported by BSF grant (USA–Israel). (M. V. Sapir) Translated from Algebra i Logika, Vol. 48, No. 2, pp. 245–257, March–April, 2009.     

Iterative approximation of <Emphasis Type="Italic">k</Emphasis>-limited polling systems

The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, service and setup distributions. The interest for this model is fueled by an application in the field of logistics. Knowledge of the queue length distributions is needed to operate the system properly. The multi-queue polling system is decomposed into single-queue vacation systems with k-limited service and state-dependent vacations, for which the vacation distributions are computed in an iterative approximate manner. These vacation models are analyzed via matrix-analytic techniques. The accuracy of the approximation scheme is verified by means of an extensive simulation study. The developed approximation turns out to be accurate, robust and computationally efficient. This research is supported by the Technology Foundation STW, applied science division of NWO and the technology programme of the Dutch Ministry of Economic Affairs.     

A New Inequality for Weakly （K1, K2）-Quasiregular Mappings

We obtain a new inequality for weakly （K1,K2）-quasiregular mappings by using the McShane extension method. This inequality can be used to derive the self-improving regularity of （K1, K2）-Quasiregular Mappings.     

Local and variable neighborhood search for the <Emphasis Type="Italic">k</Emphasis>-cardinality subgraph problem

The minimum weighted k-cardinality subgraph problem consists of finding a connected subgraph of a given graph with exactly k edges whose sum of weights is minimum. For this NP-hard combinatorial problem, only constructive types of heuristics have been suggested in the literature. In this paper we propose a new heuristic based on variable neighborhood search metaheuristic rules. This procedure uses a new local search developed by us. Extensive numerical results that include graphs with up to 5,000 vertices are reported. It appears that VNS outperforms all previous methods.     

<Emphasis Type="Italic">ω</Emphasis>-Convergence theory of filters in <Emphasis Type="Italic">Lω</Emphasis> -spaces

In this paper, an ω-convergence theory of filters in an Lω-space is established. By means of the ω-convergence theory, some important characterizations with respective to the ω-closed sets, ω T ₂ separation and (ω ₁, ω ₂)-continuous mappings are obtained. Moreover, the mutual relationships among ω-convergence of molecular nets, ω-convergence of ideals and ω-convergence of filters are given.