On Mittag-Leffler functions and related distributions

The distribution F () = 1 – E (–), 0 < 1; 0 , where E (x) is the Mittag-Leffler function is studied here with respect to its Laplace transform. Its infinite divisibility and geometric infinite divisibility are proved, along with many other properties. Its relation with stable distribution is established. The Mittag-Leffler process is defined and some of its properties are deduced.     

Sur les équations fonctionnelles auxq-différences

Summary In this paper, we study the convergence of formal power series solutions of functional equations of the formP _k(x)(^[k](x))=(x), where ^[k] (x) denotes thek-th iterate of the function.We obtain results similar to the results of Malgrange and Ramis for formal solutions of differential equations: if(0) = 0, and(0) =q is a nonzero complex number with absolute value less than one then, if(x)=a(n)x ⁿ is a divergent solution, there exists a positive real numbers such that the power seriesa(n)q ^sn(n+1)2 x ⁿ has a finite and nonzero radius of convergence.

     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Feller Processes Generated by Pseudo-Differential Operators: On the Hausdorff Dimension of Their Sample Paths

Let {X _t} _t0 be a Feller process generated by a pseudo-differential operator whose symbol satisfiesÇⁿ|q(Ç,)|c(1=)()) for some fixed continuous negative definite function (). The Hausdorff dimension of the set {X _t:tE}, E [0, 1] is any analytic set, is a.s. bounded above by dim E. is the Blumenthal–Getoor upper index of the Levy Process associated with ().     

Monotonic subsequences in permutations of n natural numbers

Let S_n be the set of all permutations of the numbers 1, 2,..., n, and letl _n() be the number of terms in the maximal monotonic subsequence contained in S_n. If M[l _n()] is the mean value ofl _n () on S_n, then, for all except a finite number of n, the bound M[l _n()] e n is valid.Translated from Matematicheskie Zametki, Vol. 13, No. 4, pp. 511–514, April, 1973.The author wishes to thank E. M. Nikishin for having posed the problem and for his constant interest in the work.     

Isomorphismen von rechtseiträumen

Spaces called rectangular spaces were introduced in [5] as incidence spaces (P,G) whose set of linesG is equipped with an equivalence relation and whose set of point pairs P² is equipped with a congruence relation , such that a number of compatibility conditions are satisfied. In this paper we consider isomorphisms, automorphisms, and motions on the rectangular spaces treated in [5]. By an isomorphism of two rectangular spaces (P,G, , ) and (P,G, , ) we mean a bijection of the point setP onto P which maps parallel lines onto parallel lines and congruent points onto congruent points. In the following, we consider only rectangular spaces of characteristic 2 or of dimension two. According to [5] these spaces can be embedded into euclidean spaces. In case (P,G, , ) is a finite dimensional rectangular space, then every congruence preserving bijection ofP onto P is in fact an isomorphism from (P,G, , ) onto (P,G, , ) (see (2.4)). We then concern ourselves with the extension of isomorphisms. Our most important result is the theorem which states that any isomorphism of two rectangular spaces can be uniquely extended to an isomorphism of the associated euclidean spaces (see (3.2)). As a consequence the automorphisms of a rectangular space (P,G, , ) are precisely the restrictions (onP) of the automorphisms of the associated euclidean space which fixP as a whole (see (3.3)). Finally we consider the motions of a rectangular space (P,G, , ). By a motion of(P. G,, ) we mean a bijection ofP which maps lines onto lines, preserves parallelism and satisfies the condition((x), (y)) (x,y) for allx, y P. We show that every motion of a rectangular space can be extended to a motion of the associated euclidean space (see (4.2)). Thus the motions of a rectangular space (P,G, , ) are seen to be the restrictions of the motions of the associated euclidean space which mapP into itself (see (4.3)). This yields an explicit representation of the motions of any rectangular plane (see (4.4)).

---

---

Herrn Professor Burau zum 85. Geburtstag gewidmet     

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     

C 1 changes of variable: Beurling-Helson type theorem and Hörmander conjecture on Fourier multipliers

We prove that if aC ¹ smooth change of variable : generates a bounded composition operatorff° in the spaceA _p()=L ^p ,p2, then is linear (affine).We also prove that for a nonlinearC ¹ mapping , the norms of exponentialse ⁱ as Fourier multipliers inL ^p () tend to infinity (,||). In both results the condition C ¹ is sharp, it cannot be replaced by the Lipschitz condition.     

φ-Factors for Function Seminorms

Let (, A, ) be a measure space, a function seminorm on M, the space of measurable functions on , and M the space {f M : (f) < }. Every Borel measurable function : [0, ) [0, ) induces a function : M M by (f)(x) = (|f(x)|). We introduce the concepts of -factor and -invariant space. If is a -subadditive seminorm function, we give, under suitable conditions over , necessary and sufficient conditions in order that M be invariant and prove the existence of -factors for . We also give a characterization of the best -factor for a -subadditive function seminorm when is -finite. All these results generalize those about multiplicativity factors for function seminorms proved earlier.     

Kite-freeP- andQ-polynomial schemes

LetY = (X, {R _i } _oid) denote aP-polynomial association scheme. By a kite of lengthi (2 i d) inY, we mean a 4-tuplexyzu (x, y, z, u X) such that(x, y) R ₁,(x, z) R ₁,(y, z) R ₁,(u, y) R _i–1,(u, z) R _i–1,(u, x) R _i. Our main result in this paper is the following.     

Necessary and sufficient conditions for the convergence of convolution products of non-identical distributions on finite abelian semigroups

Given a sequence of probability measures ( _n ) on a finite abelian semigroup, we present necessary and sufficient conditions which guarantee the weak convergence of the convolution products _{k,n k+1}*···* _n (k<n), asn for allk0. These conditions are verifiable in the sense that they are based entirely on the individual measures in the sequence ( _n ).     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

Adjoints of slant Toeplitz operators

In this paper, we will use the Birkhoff's ergodic theorem to do some finer analysis on the spectral properties of slant Toeplitz operators. For example, we will show that if is an invertibleL function on the unit circle, then almost every point in (A ^* ) is not an eigenvalue ofA ^* . More specifically, we will show that the point spectrum ofA ^* is contained in a circle with positive radius.     

Contraction of Exterior Powers in Characteristic 2 and the Spin Module

Let K be a field of characteristic 2 and letV be a vector space of dimension 2m over K. Let f be a non-degenerate alternating bilinear form defined on V × V. The symplectic group Sp(2m, K) acts on the exterior powers ^k V for 0 k. 2m There is a contraction map defined on the exterior algebra , which commutes with the Sp(2m, K) action and satisfies ² = 0 and ( ^k V) ^k–1 V We prove that ( ^k V)= ker ^k–1 V except when k=m+2. In the exceptional case, ( ^m+2 V) has codimension 2^m in ker ^m V and we show that the quotient module ker ^m V/ ^m+2 V is a spin module for Sp(2m,K). When K is algebraically closed, we show that this spin module occurs with multiplicity 1 in ^m V and multiplicity 0 in all other components of V.     

Bounded projections and duality on spaces of holomorphic functions in the unit ball ofℂ n

In this paper three Banach spacesA ₀(),A andA ¹() of functions holomorphic in the unit ballB of ⁿ are defined. We exhibit bounded projections fromC ₀(B) ontoA ₀(), fromL ¹(B) ontoA ¹(), and fromL(B) ontoA(). Using these projections, we show thatA ₀()* A ¹() andA ¹()* A().Supported in part by the National Natural Science Foundation of China.     

Sugli insiemi di permutazioni strettamente k-transitivi (k ≥ 3)

Summary Let G be a sharply 3-transitive permutation set on a finite set E of even cardinality and let 1 be in G. The following theorems are proved. G is one of the known examples if and only if there exists a non-identity normal subgroup N of G and an element of E such that NG G.G is a group if and only if G for every G and for every G and for every G .By using the classification of finite single groups a result concerning sharply k-transitive permutation sets k>3 is also proved.

---

---

Dedicato a Guido Zappa in occasione del suo 70° compleanno

---

Lavoro eseguito nell'ambito dei progetti finanziati dal Ministero della Pubblica Istruzione.     

Limiting behavior of weighted central paths in linear programming

We study the limiting behavior of the weighted central paths{(x(), s())} > 0 in linear programming at both = 0 and = . We establish the existence of a partition (B ,N ) of the index set { 1, ,n } such thatx _i() ands _j () as fori B , andj N , andx _N (),s _B () converge to weighted analytic centers of certain polytopes. For allk 1, we show that thekth order derivativesx ^(k) () ands ^(k) () converge when 0 and . Consequently, the derivatives of each order are bounded in the interval (0, ). We calculate the limiting derivatives explicitly, and establish the surprising result that all higher order derivatives (k 2) converge to zero when .     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.