On semisymmetric cubic graphs of order 6p~2

A graph r is said to be G-semisymmetric if it is regular and there exists a subgroup G of A := Aut(Г) acting transitively on its edge set but not on its vertex set. In the case of G. = A, we call r a semisymmetric graph. The aim of this paper is to investigate (G-)semisymmetric graphs of prime degree. We give a group-theoretical construction of such graphs, and give a classification of semisymmetric cubic graphs of order 6p2 for an odd prime p.     

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

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

Lacunary Strong (<Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">σ</Emphasis></Subscript><Emphasis Type="Italic">, p</Emphasis>)-Convergence

The definition of lacunary strongly convergence is extended to the definition of lacunary strong (A _σ , p)-convergence with respect to invariant mean when A is an infinite matrix and p = (p _i ) is a strictly positive sequence. We study some properties and inclusion relations.     

A note on <Emphasis Type="Italic">f</Emphasis><Subscript><Emphasis Type="Italic">I</Emphasis></Subscript>-sets and <Emphasis Type="Italic">f</Emphasis><Subscript><Emphasis Type="Italic">I</Emphasis></Subscript> -continuous functions

Summary In [6] we introduced and investigated the notions of f_I -sets and f_I -continuous functions in ideal topological spaces. In this paper, we investigate their further important properties.     

The <Emphasis Type="Italic">p</Emphasis>-rank of Ext<Subscript>ℤ</Subscript>(<Emphasis Type="Italic">G</Emphasis>, ℤ) in certain models of <Emphasis Type="Italic">ZFC</Emphasis>

We prove that if the existence of a supercompact cardinal is consistent with ZFC, then it is consistent with ZFC that the p-rank of Ext _ℤ(G, ℤ) is as large as possible for every prime p and for any torsion-free Abelian group G. Moreover, given an uncountable strong limit cardinal μ of countable cofinality and a partition of Π (the set of primes) into two disjoint subsets Π₀ and Π₁, we show that in some model which is very close to ZFC, there is an almost free Abelian group G of size 2^μ = μ⁺ such that the p-rank of Ext _ℤ(G, ℤ) equals 2^μ = μ⁺ for every p ∈ Π₀ and 0 otherwise, that is, for p ∈ Π₁. Number 874 in Shelah’s list of publications. Supported by the German-Israeli Foundation for Scientific Research & Development project No. I-706-54.6/2001. Supported by a grant from the German Research Foundation DFG. __________ Translated from Algebra i Logika, Vol. 46, No. 3, pp. 369–397, May–June, 2007.     

<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">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-Cohomology and Normal Solvability

We consider some problems concerning the L _p,q -cohomology of Riemannian manifolds. In the first part, we study the question of the normal solvability of the operator of exterior derivation on a surface of revolution M considered as an unbounded linear operator acting from L_p^k (M) into L^k+1_q (M). In the second part, we prove that the first L _p,q-cohomology of the general Heisenberg group is nontrivial, provided that p < q. Received: 17 January 2006 Supported by INTAS (Grant 03–51–3251) and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grants NSh 311.2003.1, NSh 8526.2006.1).     

Recognizability of finite simple groups <Emphasis Type="Italic">L</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) and <Emphasis Type="Italic">U</Emphasis><Subscript>4</Subscript>(2<Superscript>m</Superscript>) by spectrum

It is proved that finite simple groups L₄(2^m), m ⩾ 2, and U₄(2^m), m ⩾ 2, are, up to isomorphism, recognized by spectra, i.e., sets of their element orders, in the class of finite groups. As a consequence the question on recognizability by spectrum is settled for all finite simple groups without elements of order 8. Supported by RFBR (grant Nos. 05-01-00797 and 06-01-39001), by SB RAS (Complex Integration project No. 1.2), and by the Ministry of Education of China (Project for Retaining Foreign Expert). Supported by NSF of Chongqing (CSTC: 2005BB8096). __________ Translated from Algebra i Logika, Vol. 47, No. 1, pp. 83–93, January–February, 2008.     

On <Emphasis Type="Italic">l</Emphasis><Subscript>2,<Emphasis Type="Italic">p</Emphasis></Subscript>-circle numbers

Circle numbers are defined to reflect the Euclidean area-content and, for p ≠ 2, suitably defined non-Euclidean circumference properties of the l _2,p -circles, p ∈ [1, ∞]. The resulting function is continuous, increasing, and takes all values from [2, 4]. The actually chosen dual l _2,p -geometry for measuring the arc-length is closely connected with a generalization of the method of indivisibles of Cavalieri and Torricelli in the sense that integrating such arc-lengths means measuring area content. Moreover, this approach enables one to look in a new way into the co-area formula of measure theory which says that integrating Euclidean arc-lengths does not yield area content except for p = 2. The new circle numbers play a natural role, e.g., as norming constants in geometric measure representation formulae for p-generalized uniform probability distributions on l _2,p -circles.     

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.     

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.     

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.     

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

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.     

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.      

Zeros in Tables of Characters for the Groups <Emphasis Type="Italic">S</Emphasis><Subscript>n</Subscript> and <Emphasis Type="Italic">A</Emphasis><Subscript>n</Subscript>. II

Let P(n) be the set of all partitions of a natural number n. In the representation theory of symmetric groups, for every partition α ∈ P(n), the partition h(α) ∈ P(n) is defined so as to produce a certain set of zeros in the character table for S_n. Previously, the analog f(α) of h(α) was obtained pointing out an extra set of zeros in the table mentioned. Namely, h(α) is greatest (under the lexicographic ordering ≤) of the partitions β of n such that χ^α(g_β) ≠ 0, and f(α) is greatest of the partitions γ of n that are opposite in sign to h(α) and are such that χ^α(g_γ) ≠ 0, where χ^α is an irreducible character of S_n, indexed by α, and g_β is an element in the conjugacy class of S_n, indexed by β. For α ∈ P(n), under some natural restrictions, here, we construct new partitions h′(α) and f′(α) of n possessing the following properties. (A) Let α ∈ P(n) and n ⩾ 3. Then h′(α) is identical is sign to h(α), χ^α(g_h′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of h(α), and h′(α) < γ < h(α). (B) Let α ∈ P(n), α ≠ α′, and n ⩾ 4. Then f′(α) is identical in sign to f(α), χ^α(g_f′(α)) ≠ 0, but χ^α(g_γ) = 0 for all γ ∈ P(n) such that the sign of γ coincides with one of f(α), and f′(α) < γ < f(α). The results obtained are then applied to study pairs of semiproportional irreducible characters in A_n. Supported by RFBR grant No. 04-01-00463. __________ Translated from Algebra i Logika, Vol. 44, No. 6, pp. 643–663, November–December, 2005.     

On the basis property of eigenelements of ordinary linear differential operators in a space of the type <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>, <Emphasis Type="Italic">p</Emphasis> ≥ 2

For a linear differential expression with matrix coefficients in the class L _p , p ≥ 2, and with a parameter λ, we consider a boundary value problem with boundary conditions at the endpoints of the interval [a, b]. Under the condition that the problem is regular, we obtain a formula for the Fourier series expansion of an arbitrary vector function of the class L _p in the root functions of the problem.     

2-(<Emphasis Type="Italic">v,k</Emphasis>,1) Designs and PSL (3,<Emphasis Type="Italic">q</Emphasis>) where <Emphasis Type="Italic">q</Emphasis> is ODD

Let G be a block-primitive automorphism group of a 2-(v,k,1) design. If G is isomorphic to PSL (3,q) where q is odd, then G is also point-primitive. Supported by the National Natural Science Foundation of China (10171089).