Implicative hyper <Emphasis Type="Italic">K</Emphasis>-algebras

In this note we first define the notions of (weak, strong) implicative hyper K-algebras. Then we show by examples that these notions are different. After that we state and prove some theorems which determine the relationship between these notions and (weak) hyper K-ideals. Also we obtain some relations between these notions and (weak) implicative hyper K-ideals. Finally, we study the implicative hyper K-algebras of order 3, in particular we obtain a relationship between the positive implicative hyper K-algebras and (weak, strong) implicative hyper K-algebras under a simple condition.     

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

A note on <Emphasis Type="Italic">p</Emphasis>-groups of order ≤ <Emphasis Type="Italic">p</Emphasis><Superscript>4</Superscript>

In [1], we defined c(G), q(G) and p(G). In this paper we will show that if G is a p-group, where p is an odd prime and |G| ≤ p ⁴, then c(G) = q(G) = p(G). However, the question of whether or not there is a p-group G with strict inequality c(G) = q(G) < p(G) is still open.     

Ultra <Emphasis Type="Italic">LI</Emphasis>-ideals in lattice implication algebras and <Emphasis Type="Italic">MTL</Emphasis>-algebras

A mistake concerning the ultra LI-ideal of a lattice implication algebra is pointed out, and some new sufficient and necessary conditions for an LI-ideal to be an ultra LI-ideal are given. Moreover, the notion of an LI-ideal is extended to MTL-algebras, the notions of a (prime, ultra, obstinate, Boolean) LI-ideal and an ILI-ideal of an MTL-algebra are introduced, some important examples are given, and the following notions are proved to be equivalent in MTL-algebra: (1) prime proper LI-ideal and Boolean LI-ideal, (2) prime proper LI-ideal and ILI-ideal, (3) proper obstinate LI-ideal, (4) ultra LI-ideal. This work was supported by the Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605389) and K. C. Wong Magna Fund in Ningbo University.     

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.      

Companion <Emphasis Type="Italic">d</Emphasis>-algebras

In this paper we develop a theory of companion d-algebras in sufficient detail to demonstrate considerable parallelism with the theory of BCK-algebras as well as obtaining a collection of results of a novel type. Included among the latter are results on certain natural posets associated with companion d-algebras as well as constructions on Bin(X), the collection of binary operations on the set X, which permit construction of new companion d-algebras from companion d-algebras X also in natural ways. Supported by Korea Research Foundation Grant (KRF-2002-041-C00003).     

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.     

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

Cohomologie <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript> en degré 1 des espaces homogènes

The L ^p -cohomology in degree 1 of Riemannian homogeneous spaces is computed. It turns out that reduced cohomology does not vanish exactly for spaces quasiisometric to negatively curved homogeneous spaces.      

On Orthogonal Latin <Emphasis Type="Italic">p</Emphasis>-Dimensional Cubes

We give a construction of p orthogonal Latin p-dimensional cubes (or Latin hypercubes) of order n for every natural number n ≠ 2, 6 and p ≥ 2. Our result generalizes the well known result about orthogonal Latin squares published in 1960 by R. C. Bose, S. S. Shikhande and E. T. Parker.     

On automorphisms of finite Abelian <Emphasis Type="Italic">p</Emphasis>-groups

Let A be a finitely generated abelian group. We describe the automorphism group Aut(A) using the rank of A and its torsion part p-part A _p . For a finite abelian p-group A of type (k ₁, ..., k _n ), simple necessary and sufficient conditions for an n × n-matrix over integers to be associated with an automorphism of A are presented. Then, the automorphism group Aut(A) for a finite p-group A of type (k ₁, k ₂) is analyzed. This work has begin during the visit of the second author to the Faculty of Mathematics and Computer Science, Nicolaus Copernicus University during the period July 31–August 13, 2005. This visit was supported by the Nicolaus Copernicus University and a grant from Cnpq.     

The flatness properties of <Emphasis Type="Italic">S</Emphasis>-poset <Emphasis Type="Italic">A</Emphasis>(<Emphasis Type="Italic">I</Emphasis>) and Rees factor <Emphasis Type="Italic">S</Emphasis>-posets

Let S be a pomonoid and I a proper right ideal of S. In a previous paper, using the amalgamated coproduct A(I) of two copies of _S S over I, we were able to solve one of the problems posed in S. Bulman-Fleming et al. (Commun. Algebra 34:1291–1317, 2006). In the present paper, we investigate further flatness properties of A(I). We also solve another problem stated in the paper cited above. Namely, we determine the condition under which Rees factor S-posets have property (P _w ). Research supported by nwnu-kjcxgc-03-18.     

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.     

On automorphisms of some finite <Emphasis Type="Italic">p</Emphasis>-groups

We give a sufficient condition on a finite p-group G of nilpotency class 2 so that Aut _c (G) = Inn(G), where Aut _c (G) and Inn(G) denote the group of all class preserving automorphisms and inner automorphisms of G respectively. Next we prove that if G and H are two isoclinic finite groups (in the sense of P. Hall), then Aut _c (G) ≃ Aut _c (H). Finally we study class preserving automorphisms of groups of order p ⁵, p an odd prime and prove that Aut _c (G) = Inn(G) for all the groups G of order p ⁵ except two isoclinism families.     

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

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.     

A Note on a Class of Factorized <Emphasis Type="Italic">p</Emphasis>-Groups

In this note we study finite p-groups G = AB admitting a factorization by an Abelian subgroup A and a subgroup B. As a consequence of our results we prove that if B contains an Abelian subgroup of index p ⁿ⁻¹ then G has derived length at most 2n.     

An <Emphasis Type="Italic">ω</Emphasis>-category with all Duals is an <Emphasis Type="Italic">ω</Emphasis>-groupoid

We make a definition of ω-precategory which should underlie any definition of weak ω-category. We make a precise definition of pseudo-invertible cells in this setting. We show that in an ω-precategory with all weak duals, every cell is pseudo-invertible. We deduce that in any “sensible” theory of ω-categories, an ω-category with all weak duals is an ω-groupoid. We discuss various examples and open questions involving higher-dimensional tangles and cobordisms.      

The finite <Emphasis Type="Italic">p</Emphasis>-groups with <Emphasis Type="Italic">p</Emphasis> conjugacy classes of non-normal subgroups

Let ν(G) be the number of conjugacy classes of non-normal subgroups of a finite group G. The finite groups for which ν(G) ≤ 2 were determined by Dedekind and by Schmidt in the early times of group theory. On the other hand, if G is a finite p-group, La Haye and Rhemtulla have proved that either ν(G) ≤ 1 or ν(G) ≥ p. In this note, we determine all finite p-groups satisfying ν(G) = p for p > 2.     

Computational study of large-scale <Emphasis Type="Italic">p</Emphasis>-Median problems

Given a directed graph G(V,A), the p-Median problem consists of determining p nodes (the median nodes) minimizing the total distance from the other nodes of the graph. We present a Branch-and-Cut-and-Price algorithm yielding provably good solutions for instances with |V|≤3795. Key ingredients of the algorithm are a delayed column-and-row generation technique, exploiting the special structure of the formulation, to solve the LP-relaxation, and cutting planes to strengthen the formulation and limit the size of the enumeration tree.