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.     

Prime and Primitive Ideals in Graded Deformations of Algebraic Quantum Groups at Roots of Unity

Let G be a connected, simply connected complex semisimple Lie group of rank n. The deformations employed by Artin, Schelter and Tate, and Hodges, Levasseur and Toro can be applied to the single parameter quantizations, at roots of unity, of the Hopf algebra of regular functions on G. Each of the resulting complex multiparameter quantum groups F _,p [G] depends on both a suitable root of unity and an antisymmetric bicharacter p: Z ⁿ ×Z ⁿ C ^×. These quantizations differ significantly from their single parameter (root-of-unity) counterparts, and, in particular, may have infinite-dimensional irreducible representations. Our approach to F _,p [G] depends on a natural ×-action thereon, where is an n-torus, and our main result offers a classification of the primitive ideals: We use a multiparameter quantum Frobenius map to provide a bijection from (PrimF _,p [G])/× onto G/H×H, where H is a maximal torus of G. In the single parameter case, this bijection is a consequence of work by De Concini and Lyubashenko, and De Concini and Procesi; our results require their analysis. Our methods also exploit earlier work by Moeglin and Rentschler concerning actions of algebraic groups on complex Noetherian algebras. In contrast to generic quantizations of the coordinate ring of G, the primitive spectrum of F _,p [G] is not finitely stratified by the torus action.     

On a Property of Subexponential Distributions

Let F be a distribution function (d.f.) on [0, ) with finite first moment m >0. We define the integrated tail distribution function F ₁ of F by F ₁(t)=m^-1 ₀ ^t (1- F(u))du, t0. In this paper, we obtain sufficient conditions under which implications FSF ₁S and F ₁S FS hold, where S is the class of subexponential distributions.     

Iterative Pexider equation modulo a subset

Summary LetX, Y, Z be arbitrary nonempty sets,E be a nonempty subset ofZ ^z andK be a groupoid. Assume that {F _t} _{t K} Z ^X, {G _t} _{t K} Y ^X, {H _t} _{t K} Z ^Y are families of functions satisfying the functional equationF _st = k_(s,t) H_s G_t for (s, t) D(K), whereD(K) stands for the domain of the binary operation on the groupoidK andk _(s,t) E for (s, t) D(K). Conditions are established under which the equation can be reduced to the corresponding Cauchy equation. This paper generalizes some results from [4] and [1].     

On Meta-Thin Association Schemes

An association scheme is a combinatorial object derived from the orbitals of a transitive permutation group. Let G be a transitive permutation group acting on a finite set X. Then _{x X}G_x is a normal subgroup of G where G_x:={g G x^g=x}. A meta-thin association scheme can be considered as a generalization of the situation where _{x X}G_x normalizes G_x. In this paper, we consider the automorphism group of a meta-thin association scheme, and obtain a sufficient condition for a meta-thin association scheme to have a transitive automorphism group. This enables us to conclude that every meta-thin association scheme with its thin residue isomorphic to the cyclic group of order pq, where p and q are primes, has a transitive automorphism group.     

On Domination Number of 4-Regular Graphs

Let G be a simple graph. A subset S V is a dominating set of G, if for any vertex v V – S there exists a vertex u S such that uv E(G). The domination number, denoted by (G), is the minimum cardinality of a dominating set. In this paper we prove that if G is a 4-regular graph with order n, then (G) ⁴/₁₁ n     

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.     

Quadratically constrained quadratic programming: Some applications and a method for solution

The problem (QPQR) considered here is: minimizeQ ₁ (x) subject toQ _i (x) 0,i M ₁ {2,...,m},x P R ⁿ, whereQ _i (x), i M {1} M ₁ are quadratic forms with positive semi-definite matrices, andP a compact nonempty polyhedron of Rⁿ. Applications of (QPQR) and a new method to solve it are presented.Letu S={u R ^m;u 0, u _i= l}be fixed;then the problem:iM minimize u _iQ_i (x (u)) overP, always has an optimal solutionx (u), which is either feasible, iM i.e. u C₁ {u S;Q _i (x (u)) 0,i M ₁} or unfeasible, i.e. there exists ani M ₁ withu C {u S; Q_i(x(u)) 0}.Let us defineC _i C_i S _i withS _i {u S; u _i=0}, i M. A constructive method is used to prove that C _i is not empty and thatx (û) withiM û C _i characterizes an optimal solution to (QPQR). Quite attractive numerical results have been reached with this method.

---

Zusammenfassung Die vorliegende Arbeit befaßt sich mit Anwendungen und einer neuen Lösungsmethode der folgenden Aufgabe (QPQR): man minimiere eine konvexe quadratische ZielfunktionQ _i (x) unter Berücksichtigung konvexer quadratischer RestriktionenQ _i (x) 0, iM ₁ {2,...,m}, und/oder linearer Restriktionen.·Für ein festesu S {u R ^m;u 0, u _i=1},M {1} M₁ besitzt das Problem:iM minimiere die konvexe quadratische Zielfunktion u _i Q_i (x (u)) über dem durch die lineareniM Restriktionen von (QPQR) erzeugten, kompakten und nicht leeren PolyederP R ⁿ, immer eine Optimallösungx (u), die entweder zulässig ist: u C₁ {u S;Q ₁ (x (u)) 0,i M ₁} oder unzulässig ist, d.h. es existiert eini M ₁ mitu C_i {u S;Q _i (x(u))0}.Es seien folgende MengenC _i C_i S _i definiert, mitS _i {u S;u _i=0}, i M. Es wird konstruktiv bewiesen, daß C _i 0 undx (û) mitû C _i eine Optimallösung voniM iM (QPQR) ist; damit ergibt sich eine Methode zur Lösung von (QPQR), die sich als sehr effizient erwiesen hat. Ein einfaches Beispiel ist angegeben, mit dem alle Schritte des Algorithmus und dessen Arbeitsweise graphisch dargestellt werden können.

---

---

An earlier version of this paper was written during the author's stay at the Institute for Operations Research, Swiss Federal Institute of Technology, Zürich.     

Reconstructing dimensions of intersections of convex sets

Denoting by dimA the dimension of the affine hull of the setA, we prove that if {K _i:i T} and {K _i ^j :i T} are two finite families of convex sets inR ⁿ and if dim {K _i :i S} = dim {K _i ^j :i S}for eachS T such that|S| n + 1 then dim {K _i :i T} = dim {K _i : {i T}}.     

k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

Number of no nisomorphic subgraphs in an n-point graph

LetG(n) be the set of all nonoriented graphs with n enumerated points without loops or multiple lines, and let v_k(G) be the number of mutually nonisomorphic k-point subgraphs of G G(n). It is proved that at least |G(n)| (1–1/n) graphs G G(n) possess the following properties: a) for any k [6log₂n], where c=–c log₂c–(1–c)×log₂(1–c) and c>1/2, we havev _k(G) > C _n ^k (1–1/n²); b) for any k [cn + 5 log₂n] we havev _k(G) = C _n ^k . Hence almost all graphs G G(n) containv(G) 2ⁿ pairwise nonisomorphic subgraphs.Translated from Matematicheskie Zametki, Vol. 9, No. 3, pp. 263–273, March, 1971.     

Singular parts of contractive analytic operator functions

One considers the class _G of holomorphic functions in a domain G, whose values are contractions in a separable Hilbert space. It is proved that if T(·) _G , T(z₀) is a weak contraction, its singular part T^s(z₀) is complete, and the increments T(z)–T(z₀) are not too large (for example, finite-dimensional), then the operator T^s(z₀) is complete for almost all zG. If, however, T(z₀) is, in addition, completely nonunitary and satisfies definite smoothness conditions, then in the nontrivial case the spectrum [z] of the contraction T^s(z) (zG) is a thin set: The proof of the mentioned results is based on the investigation of the formulas obtained in the paper, connecting the characteristic functions of the contractions T(z) for different values of zG.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 157, pp. 30–44, 1987.     

Invariant measures ofC 2-diffeomorphisms of Markov type inR d

A class of uniformly expanding, piecewiseC ²-diffeomorphisms from domainsIR ^d (bounded or not) into themselves is considered. It is shown that the number of the extreme points of Fix (P )={gG:Pg=g} whereP is the Frobenius-Perron operator associated with andG={gL ¹: g0 g=1}, can be determined in an effective way. Moreover, it is shown that the sequence {P ^j g} is convergent inL ¹ for anygG, and in the topology of uniform convergence for anygG(1). The limit is a linear projectionR inL ¹ (defined by (3.1)) which mapsG onto Fix (P ) (see Th. 3.1).Dedicated to professor A. Lasota on the occasion of his 60th birthday     

Aufeinanderfolgende Elemente in multiplikativen Zahlenmengen

LetM be a multiplicative set with 1M andmnM if and only ifmM,nM for (m,n)=1. It is shown by elementary means that there exists the asymptotic density of the setM(M–1) for every multiplicative setM. The density is positive if and only ifM possesses a positive density and 2M for some . This result is slightly generalized to sums over multiplicative functionsf with |f|1.     

Global Attractivity of the Equilibrium of a Nonlinear Difference Equation

The authors consider the nonlinear difference equation x_n+1=x_n+x_n-kf(x_n-k),n=0,1,(0.1) where (0,1), k 0,1, and f C¹[[0,), [0,)] with f(x) < 0.They give sufficient conditions for the unique positive equilibrium of (0.1) to be a global attractor of all positive solutions. The results here are somewhat easier to apply than those of other authors. An application to a model of blood cell production is given.     

Joint convergence of conditional expectations

Let P_n, nIN{0}, be probability measures on a-fieldA; f_n, nIN{0}, be a family of uniformly boundedA-measurable functions andA _n, nIN, be a sequence of sub--fields ofA, increasing or decreasing to the-fieldA _o. It is shown in this paper that the conditional expectations converge in P_o-measure to with k, n, m , if P_n|A, nIN, converges uniformly to P_n|A and f_n, nIN, converges in P_o-measure to f_o.     

Surfaces and the second homology of a group

LetG be a group andK(G, 1) an Eilenberg—MacLane space, i.e. ₁(K(G,1))G, _i (K(G,1))=0,i1. We give a purely algebraic proof that the second homology groupH ₂(G)=H ₂(G,)H ₂(K(G,1)) is isomorphic to the group of stable equivalence classes of continuous mapsFK(G,1) inducing surjections on fundamental groups (resp. surjections, whereF{F _g=closed orientable surface of genusg,g}. As a corollary we obtain an algebraic proof of the well-known isomorphismH ₂(G)₂(K(G,1)) (2-dimensional bordism group).     

On signpost systems and connected graphs

By a signpost system we mean an ordered pair (W, P), where W is a finite nonempty set, P W × W × W and the following statements hold: if (u, v, w) P, then (v, u, u) P and (v, u, w) P, for all u, v, w W; if u v; then there exists r W such that (u, r, v) P, for all u, v W. We say that a signpost system (W, P) is smooth if the folowing statement holds for all u, v, x, y, z W: if (u, v, x), (u, v, z), (x, y, z) P, then (u, v, y) P. We say thay a signpost system (W, P) is simple if the following statement holds for all u, v, x, y W: if (u, v, x), (x, y, v) P, then (u, v, y), (x, y, u) P.By the underlying graph of a signpost system (W, P) we mean the graph G with V(G) = W and such that the following statement holds for all distinct u, v W: u and v are adjacent in G if and only if (u, v, v) P. The main result of this paper is as follows: If G is a graph, then the following three statements are equivalent: G is connected; G is the underlying graph of a simple smooth signpost system; G is the underlying graph of a smooth signpost system.Research was supported by Grant Agency of the Czech Republic, grant No. 401/01/0218.     

Products of Quasi-p-Pseudocompact Spaces

Given p () , we determine when a product of quasi-p-pseudocompact spaces preserves this property. In particular, we analyze the product of quasi-p-pseudocompact subspaces of () containing . We give examples of spaces X, Y, X _s , Ys which are quasi-p-pseudocompact for every p *, but X Y is not pseudocompact, and X _s Y _s is pseudocompact and it is not quasi-s-pseudocompact for each s *. Besides, we prove that every pseudocompact space X of with X, is quasi-p-pseudocompact for some p *. Finally, we introduce, for each p *, the class P _p of all spaces X such that X × Y is quasi-p-pseudocompact when so is Y; and we prove: (1) the intersection of classes P _p ( _p *) coincides with the Frol"ik class; (2) every class P _p is closed under arbitrary products; (3) the partial ordered set ( P _p p ,) is isomorphic to the set of equivalence classes of free ultrafilters on with the Rudin–Keisler order. A topological characterization of RK-minimal ultrafilters is also given.     

Analytic Approximations for a Singularly Perturbed Convection—Diffusion Problem with Discontinuous Data in a Half-Infinite Strip

We consider a singularly perturbed convection—diffusion equation, –u+v u=0, defined on a half-infinite strip, (x,y)(0,)×(0,1) with a discontinuous Dirichlet boundary condition: u(x,0)=1, u(x,1)=u(0,y)=0. Asymptotic expansions of the solution are obtained from an integral representation in two limits: (a) as the singular parameter 0⁺ (with fixed distance r to the discontinuity point of the boundary condition) and (b) as that distance r0⁺ (with fixed ). It is shown that the first term of the expansion at =0 contains an error function or a combination of error functions. This term characterizes the effect of discontinuities on the -behavior of the solution and its derivatives in the boundary or internal layers. On the other hand, near the point of discontinuity of the boundary condition, the solution u(x,y) is approximated by a linear function of the polar angle at the point of discontinuity (0,0).