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     

On a Lower Bound of L p Norms in the Central Limit Theorem for ϕ-Mixing Random Variables

We derive lower bounds of the L _p norms _np for all p, 1p, in the central limit theorem for -mixing random variables with finite sixth-order moments in a strictly stationary case and finite eighth-order moments in a not necessarily stationary one.     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

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.     

ε-Expansions in Dyson's Hierarchical Model

We consider Dyson's hierarchical model on a d-dimensional hierarchical lattice and define a renormalization group (RG) transformation for complex values of d as a map in the space of sequences of coupling constants determining the model Hamiltonian. We show that d=4 is a bifurcation value of this transformation for the RG transformation parameter equal to 1+2/d, and we construct a non-Gaussian RG-invariant Hamiltonian in terms of the (4–d)-expansion. We establish that the (–3/2)- and (4–d)-expansion coefficients for a non-Gaussian fixed point in the dimension d=3 have the same asymptotic representation as the size of the elementary cell tends to infinity, thus confirming that both the expansions describe the same nontrivial fixed point in the dimension three.     

Start‐up class models in multiple‐class queues with N‐policy

In this paper, we consider multipleclass queueing systems with Npolicy in which the idle server starts service as soon as the number of customers in the startup class reaches threshold N. We consider the cases of FCFS and nonpreemptive priority. We obtain the Laplace–Stieltjes transform of the waiting times of each class of customers. We also show some results for the general behavior of such systems.     

A sandwich theorem and Hyers—Ulam stability of affine functions

It is shown that two real functionsf andg, defined on a real intervalI, satisfy the inequalitiesf(x + (1 – )y) g(x) + (1 – )g(y) andg(x + (1 – )y) f(x) + (1 – )f(y) for allx, y I and [0, 1], iff there exists an affine functionh: I such thatf h g. As a consequence we obtain a stability result of Hyers—Ulam type for affine functions.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

On Some Isomorphism on the Category of b-Spaces

Given a nuclear b-space N, we show that if is a finite or -finite measure space and 1p, then the functors L _loc ^p (,N.) and NL ^p (,.) are isomorphic on the category of b-spaces of L. Waelbroeck.     

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.     

Generalized Variation of Mappings with Applications to Composition Operators and Multifunctions

We study (set-valued) mappings of bounded -variation defined on the compact interval I and taking values in metric or normed linear spaces X. We prove a new structural theorem for these mappings and extend Medvedev's criterion from real valued functions onto mappings with values in a reflexive Banach space, which permits us to establish an explicit integral formula for the -variation of a metric space valued mapping. We show that the linear span GV (I;X) of the set of all mappings of bounded -variation is automatically a Banach algebra provided X is a Banach algebra. If h:I× X Y is a given mapping and the composition operator is defined by (f)(t)=h(t,f(t)), where tI and f:I X, we show that :GV (I;X) GV (I;Y) is Lipschitzian if and only if h(t,x)=h₀(t)+h₁(t)x, tI, xX. This result is further extended to multivalued composition operators with values compact convex sets. We prove that any (not necessarily convex valued) multifunction of bounded -variation with respect to the Hausdorff metric, whose graph is compact, admits regular selections of bounded -variation.     

On elementary equivalence and isomorphism of clone segments

The principal application of a general theorem proved here shows that for any choice 1mnp of integers there exist metric spacesX andY such that the initialk-segments of their clones of continuous maps coincide exactly whenkm, are isomorphic exactly whenkn, and are elementarily equivalent exactly whenkp.Dedicated to Prof. László Fuchs on the occasion of his 70th birthday     

On the rate of convergence of an unstable solution of a stochastic differential equation

We study the rate of convergence of the process(tT)/T to the processw(t)/ asT , where(t) is a solution of the stochastic differential equationd(t)=a((t))dt+((t))dw(t) Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 10, pp. 1424–1427, October, 1994.     

On the smoothness of conjugacy for circle covering maps

A conjugacy betweenC ¹⁺ -hyperbolic circle covering maps isC ¹⁺ if it has a positive derivative on some point in the -set.     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

On the rank of a spectral function

Let P(x), 0 x 1, be an absolutely continuous spectral function in the separable Hilbert spacesS. If the vectors h_j, j=1, 2, ..., s; s are such that the set P(x)h_j is complete inS, then the rank of the function P(x) equals the general rank of the matrix-function d/dxP(x)h_i,h_js₁.Translated from Matematicheskie Zametki, Vol. 5, No. 4, pp. 457–460, April, 1969.     

Dual-lattice theorems in the geometric approach

A one-to-one correspondence is shown to exist between the lattice of all self-bounded (A, )-controlled invariants contained in and the lattice of all self-hidden (A, )-conditioned invariants containing . This correspondence, stated herein as the main dual-lattice theorem, allows a straightforward derivation of the universal bounds of the lattices, particularly when additional constraints are imposed, such as to contain a given subspace for the elements of the former lattice and to be contained in a given subspace for the elements of the latter. Then, two further minor dual-lattice theorems, dual to each other, are presented, and some connections and applications of the new theory to standard control and observation problems are briefly discussed.     

On the ω-limit Set Dichotomy of Cooperating Kolmogorov Systems

The authors study the -limit set dichotomy of the Kolmogorov systems _i=x_i f _i(x)x _i0, 1in with the cooperative and irreducible hypotheses and obtain the quasiconvergence almost everywhere when n=3, which gives an affirmative answer to the open problem by Smith [9, p.72] in the case of n=3.