On the Movement of Transitive Permutation p-Groups

Let G be a transitive permutation group on a set and m a positive integer. If | – | m for every subset of and all g G, then || 2mp/(p – 1) where p is the least odd prime dividing |G|. It was shown by Mann and Praeger [13] that, for p = 3, the 3-groups G which attain this bound have exponent p. In this paper we will show a generalization of this result for any odd primes.AMS Subject Classification (2000), 20BXX     

An algebraic approach to the vector ε-algorithm

The vector -algorithm is obtained from the scalar -algorithm by taking the pseudo-inverse of a vector instead of the inverse of a scalar. Thus the vector -algorithm is known only through its rules contrarily to the scalar -algorithm and some other extrapolation algorithms.The aim of this paper is to provide an algebraic approach to the vector -algorithm.     

Almost flat locally finite coverings of the sphere

For any subset A of the unit sphere of a Banach space X and for [0,2) the notion of -flatness is introduced as a measure of non-flatness of A. For any positive , construction of locally finite tilings of the unit sphere by -flat sets is carried out under suitable -renormings of X in a quite general context; moreover, a characterization of spaces having separable dual is provided in terms of the existence of such tilings. Finally, relationships between the possibility of getting such tilings of the unit sphere in the given norm and smoothness properties of the norm are discussed.     

The ε c -Product of a Schwartz b-Space by a Quotient Banach Space and Applications

We define the -product of a -space by a quotient Banach space. We give conditions under which this -product will be monic. Finally, we define the _c -product of a Schwartz b-space by a quotient Banach space and we give some examples of applications.     

ε-solutions in vector minimization problems

This paper presents some properties of -solutions for vector minimization problems where the function to be optimized takes its values in the Euclidean space ^p . The results obtained generalize the classical ones for exact Pareto solutions.     

Some remarks on the product of two C α-compact subsets

For a cardinal , we say that a subset B of a space X is C -compact in X if for every continuous function is a compact subset of . If B is a C-compact subset of a space X, then (B, X) denotes the degree of C -compactness of B in X. A space X is called -pseudocompact if X is C -compact into itself. For each cardinal , we give an example of an -pseudocompact space X such that X × X is not pseudocompact: this answers a question posed by T. Retta in Some cardinal generalizations of pseudocompactness Czechoslovak Math. J. 43 (1993), 385–390. The boundedness of the product of two bounded subsets is studied in some particular cases. A version of the classical Glicksberg's Theorem on the pseudocompactness of the product of two spaces is given in the context of boundedness. This theorem is applied to several particular cases.     

Topological existence and stability for stackelberg problems

The aim of this paper is to study, in a topological framework, existence and stability for the solutions to a parametrized Stackelberg problem. To this end, approximate solutions are used, more precisely, -solutions and strict -solutions. The results given are of minimal character and the standard types of constraints are considered, that is, constant constraints, constraints defined by a finite number of inequalities, and more generally constraints defined by an arbitrary multifunction.     

A value iteration method for undiscounted multichain Markov decision processes

This paper proposes a value iteration method which finds an-optimal policy of an undiscounted multichain Markov decision process in a finite number of iterations. The undiscounted multichain Markov decision process is reduced to an aggregated Markov decision process, which utilizes maximal gains of undiscounted Markov decision sub-processes and is formulated as an optimal stopping problem. As a preliminary, sufficient conditions are presented under which a policy is-optimal.

---

Zusammenfassung In dieser Arbeit wird eine Wertiterationsmethode vorgeschlagen, die eine-optimale Politik für einen undiskontierten nicht-irreduziblen Markovschen Entscheidungsprozeß (MEP) in endlichen vielen Schritten liefert. Der undiskontierte nicht-irreduzible MEP wird auf einen aggregierten MEP reduziert, der maximale Gewinn eines undiskontierten Sub-MEP verwendet und als optimales Stopp-Problem formuliert wird. Zu Beginn werden hinreichende Bedingungen für die-Optimalität einer Politik angegeben.

     

On Decomposing an Abelian p-Group Under a p′-Operator Group

Let A be a p-group acting on a finite Abelian p-group P. We give a necessary and sufficient condition on an A-irreducible decomposition of ₁(P) = _i1U_i for the existence of an A-indecomposable decomposition of P = _i1R_i such that ₁(R_i) = U_i for all i I. This readily implies a main result of [1].2000 Mathematics Subject Classification: 20D15     

Hulls for Various Kinds of α-Completeness in Archimedean Lattice-Ordered Groups

Within Archimedean -groups, and with an infinite cardinal or , we consider X-hulls where X stands for any of the following classes of -groups: -projectable; laterally -complete; boundedly laterally -complete; conditionally -complete; combinations of the preceding, together with divisibility and/or relative uniform completeness. All these hulls exist, and may be obtained by iterated adjunction of the required extra elements, within the essential hull. When the -groups is relatively -complemented one step in the iteration suffices for several crucial properties. We derive from the above a considerable number of equations involving combinations of these hull operators.     

Generalizations of Perfect, Semiperfect, and Semiregular Rings

For a ring R and a right R-module M, a submodule N of M is said to be -small in M if, whenever N + X = M with M/X singular, we have X = M. If there exists an epimorphism p: P M such that P is projective and Ker(p) is -small in P, then we say that P is a projective -cover of M. A ring R is called -perfect (resp., -semiperfect, -semiregular) if every R-module (resp., simple R-module, cyclically presented R-module) has a projective -cover. The class of all -perfect (resp., -semiperfect, -semiregular) rings contains properly the class of all right perfect (resp., semiperfect, semiregular) rings. This paper is devoted to various properties and characterizations of -perfect, -semiperfect, and -semiregular rings. We define (R) by (R)/Soc(R_R) = Jac(R/Soc(R_R)) and show, among others, the following results:

Epsilon efficiency

This paper considers the extension of -optimality for scalar problems to vector maximization problems, or efficiency problems, which havem objective functions defined on a set .It is shown that the natural extension of the scalar -optimality concepts [viz, given >0, given a solution setS, ifxS there exists an efficient solutiony with f(x)–f(y), and given an efficient solutiony, there exists anxS with f(x)–f(y)] do not hold for some methods used. Six concepts of -efficient sets are introduced and examined, to a very limited extent, in the context of five methods used for generating efficient points or near efficient points.In doing so, a distinction is drawn between methods in which the surrogate optimizations are carried out exactly, and those where terminal -optimal solutions are obtained.The author would like to thank the referees whose thoroughness was extremely helpful for the revised paper.     

Some topological properties of ω-covering sets

We prove the following theorems:1. There exists an -covering with the property s ₀.2. Under cov there exists X such that is not an -covering orX \ B is not an -covering].3. Also we characterize the property of being an -covering.     

Study of Noetherian Γ-Semirings via Operator Semirings

In this paper we study Noetherian -semirings and obtain Cohens theorem for a special class of -semirings. Weak primary decomposition theorem for a particular type of -semirings is also obtained.Presently Lecturer in Mathematics, University of Burdwan, GOLAPBAG, W.B. INDIA.     

ε-optimality criteria for convex programming problems via exact penalty functions

In this paper, we present-optimality criteria for convex programming problems associated with exact penalty functions. Several authors have given various criteria under the assumption that such convex problems and the associated dual problems can be solved. We assume the solvability of neither the convex problem nor the dual problem. To derive our criteria, we estimate the size of the penalty parameter in terms of an-solution for the dual problem.     

A Note on π-Engel Conditions

In this paper we show that the weakly -Engel conditions are closely related to the existance of normal -complements; while the -Engel conditions are closely related to the -nilpotent groups.AMS Subject Classification (2000): 20D20     

On Generalizations of Ostrowski Inequality and Some Related Results

Some generalizations of the Ostrowski inequality, the Milovanovi-Peari-Fink inequality, the Dragomir-Agarwal inequality and the Hadamard inequality are given.     

Admissibility of unbiased tests for a composite hypothesis with a restricted alternative

This paper discusses -admissiblility and d-admissiblity which are important concepts in studying the performance of statistical tests for composite hypotheses. A sufficient condition for -admissibility is presented. When =1/m, the Nomakuchi-Sakata test, which is uniformly more powerful than the likelihood ratio test for hypotheses min (₁, ₁) = 0 versus min (₁, ₁) > 0, is generalized for a class of distributions in an exponential family, and its unbiasedness and -admissibility are shown. Finally, the case of 1/m is discussed in brief.     

Epsilon-Eigenvalues of Multivalued Operators

Landau's theory of -eigenvalues for bounded linear operators is well suited to cope with difficulties arising from the lack of usual eigenvalues. The notion of -eigenvalue is studied here in the general setting of positively homogeneous multivalued operators. Besides containing a number of new results, the paper sheds a fresh light on many features of the original theory.