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.     

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.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

On a classical Nicoletti boundary value problem

We shall derive existence, uniqueness and comparison results for the functional differential equationx(t)=f(t, x), a. e.tI, with classical Nicoletti boundary conditionsx _i(t_i)=y _iX, iA, whereI is a real interval,A is a nonempty set andX is a Banach space.     

On Interpolation Sequences of One Class of Functions, Analytic in the Half-Plane

A new criterion of solvability of the interpolation problem f( _n )=b_n in the class of functions f, analytic in the right half-plane and such that there exists c ₁(0;+) such that |f(z)|c ₁exp((c₁|z|)) for all z , where is a positive increasing continuous differentiable function on [0;+), for which (t)+ as t+ and there exists c ₂(0;+) such that

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.     

Singular perturbations in foliations

Summary We define a constraint system , [0,₀), which is a kind of family of vector fields on a manifold. This is a generalized version of the family of the equations , [0,₀),x ^m ,y ⁿ . Finally, we prove a singular perturbation theorem for the system , [0,₀).Dedicated to Professor Kenichi Shiraiwa on his 60th birthday     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

A perturbation result for the asymptotic behavior of matrix powers

We prove a perturbation result for the asymptotic behavior of the sequence (A ⁿ c) _nN , whereAG|(d), the space of invertibled×d matrices, andc ^d .     

Efficiency of Proximal Bundle Methods

We give efficiency estimates for proximal bundle methods for finding f_*min_Xf, where f and X are convex. We show that, for any accuracy <0, these methods find a point x^kX such that f(x^k)–f^* after at most k=O(1/³) objective and subgradient evaluations.     

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.     

A remark on normal derivations of Hilbert-Schmidt type

LetB (H) denote the algebra of operators on the separable Hilbert spaceH. LetC ₂ denote the (Hilbert) space of Hilbert-Schmidt operators onH, with norm .₂ defined by S ₂ ² =(S,S)=tr(SS ^*). GivenA, B B (H), define the derivationC (A, B):B(H)B(H) byC(A, B)X=AX-XB. We show that C(A,B)X+S ₂ ² =C(A,B)X ₂ ² +S ₂ ² holds for allXB(H) and for everySC ₂ such thatC(A, B)S=0 if and only if reducesA, ker S reducesB, andA | S and B| ker S are unitarily equivalent normal operators. We also show that ifA, BB(H) are contractions andR(A, B)B(H)B(H) is defined byR(A, B)X=AXB-X, thenSC ₂ andR(A, B)S=0 imply R(A,B)X+S ₂ ² =R(A,B)X ₂ ² +S ₂ ² for allXB(H).     

The Logarithmic Frequency of Values of Additive Functions

We consider the weak convergence of distribution functions (_mx 1/ m)^-1 _{m x},f_x(m)x is a set (x 2) of strongly additive functions such that f_x(p){0,1} for each prime number p.     

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.     

Spectral properties of cosine operator functions

LetA be the generator of a cosine functionC _t ,t R in a Banach spaceX; we shall connect the existence and uniqueness of aT-periodic mild solution of the equationu = Au + f with the spectral property 1 (C _T ) and, in caseX is a Hilbert space, also with spectral properties ofA. This research was supported in part by DAAD, West Germany.     

Random k-Sat: A Tight Threshold For Moderately Growing k

We consider a random instance I of k-SAT with n variables and m clauses, where k=k(n) satisfies k—log₂ n. Let m ₀=2 ^k nln2 and let =(n)>0 be such that n. We prove that

On the complete solution of ∈y″=y 3

In Ref. 1, the author claimed that the problem y=y ³ is soluble only for a certain range of the parameter . An analytic approach, as adopted in the following contribution, reveals that a unique solution exists for any positive value of . The solution is given in closed form by means of Jacobian elliptic functions, which can be numerically computed very efficiently. In the limit 0+, the solutions exhibit boundary-layer behavior at both endpoints. An easily interpretable approximate solution for small is obtained using a three-variable approach.     

Optimality for set functions with values in ordered vector spaces

Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() _D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.     

Symmetry and-commutativity of topological*-algebras

An advertibly complete locallym-convex (lmc)^*-algebraE is symmetric if and only if each normed (inverse limit) factorE/N , A, ofE is symmetric in the respective Banach factorE , A, ofE. Every locally C^*-algebra is symmetric. If denotes the continuous positive functionals on an lmc^*-algebraE and withL _f ={x E: f(x ^* x) =0}, thenE is, by definition,-commutative if for anyx, y E.-commutativity and commutativity coincide in lmcC ^*-algebras, so that an lmc^*-algebra with a bounded approximate identity is-commutative if and only if its enveloping algebra is commutative. Several standard results for commutative lmc^*-algebras are also obtained in the-commutative case, as for instance, the nonemptiness of the Gel'fand space of a suitable-commutative lmc^*-algebra, the automatic continuity of positive functionals when the algebras involved factor, as well as that the spectral radius is a continuous submultiplicative semi-norm, when the algebras considered are moreover symmetric. An application of the latter result yields a spectral characterization of-commutativity.     

Mengenwertige Masse und Fortsetzungen

Let (, _i) be a probability space for i=1,2 with and : ^m a correspondence, i.e. () is a non-void subset of ^m for all . We give necessary and sufficient conditions under which it holds, that ₂ extends ₁. iff _A d₂ is equal to _A d₁ for all A, where _A d_i is the set of all integrals _A f d_i of functions f: ^m with f()() _i.-a.e.