Bruck-Ryser abstract theorem and symmetric designs

In [3] U. Ott introduced a Bruck-Ryser abstract theorem concerning lattices of an R-module. As one of the applications of this theorem, he obtained a new proof of the Bruck-Ryser theorem for finite projective planes and studied p-curves in a projective plane. In this paper, we apply the Bruck-Ryser abstract theorem in order to give a new proof of the Bruck-Ryser-Chowla theorem for symmetric (v, k, )-design with (v, k, )=1, and to study p-curves in arbitrary symmetric designs.     

Critical sets in parametric optimization

We deal with one-parameter families of optimization problems in finite dimensions. The constraints are both of equality and inequality type. The concept of a generalized critical point (g.c. point) is introduced. In particular, every local minimum, Kuhn-Tucker point, and point of Fritz John type is a g.c. point. Under fairly weak (even generic) conditions we study the set consisting of all g.c. points. Due to the parameter, the set is pieced together from one-dimensional manifolds. The points of can be divided into five (characteristic) types. The subset of nondegenerate critical points (first type) is open and dense in (nondegenerate means: strict complementarity, nondegeneracy of the corresponding quadratic form and linear independence of the gradients of binding constraints). A nondegenerate critical point is completely characterized by means of four indices. The change of these indices along is presented. Finally, the Kuhn-Tucker subset of is studied in more detail, in particular in connection with the (failure of the) Mangasarian-Fromowitz constraint qualification.     

Central Limit Theorems for dependent variables. I

Summary This paper gives a flexible approach to proving the Central Limit Theorem (C.L.T.) for triangular arrays of dependent random variables (r.v.s) which satisfy a weak mixing condition called -mixing. Roughly speaking, an array of real r.v.s is said to be -mixing if linear combinations of its past and future are asymptotically independent. All the usual mixing conditions (such as strong mixing, absolute regularity, uniform mixing, -mixing and -mixing) are special cases of -mixing. Linear processes are shown to be -mixing under weak conditions. The main result makes no assumption of stationarity. A secondary result generalises a C.L.T. that Rosenblatt gave for strong mixing samples which are nearly second order stationary.     

Sharp Nikolskii inequalities with exponential weights

w _a(x)=exp(–x^a), xR, a0. , N _n (a,p,q) — (2), _n P _nw_ap, CN_n(a,p, q)P_nw_aq. , — , {P _n}, .

---

---

This material is based upon research supported by the National Science Foundation under Grant No. DMS-84-19525, by the United States Information Agency under Senior Research Fulbright Grant No. 85-41612, and by the Hungarian Ministry of Education (first author). The work was started while the second author visited The Ohio State University between 1983 and 1985, and it was completed during the first author's visit to Hungary in 1985.     

The random-cluster model on the complete graph

Summary The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph onn vertices, then the associated processes are called mean-field. In this study of the mean-field random-cluster model with parametersp=/n andq, we show that its properties for any value ofq(0, ) may be derived from those of an Erds-Rényi random graph. In this way we calculate the critical point _c (q) of the model, and show that the associated phase transition is continuous if and only ifq2. Exact formulae are given for _C (q), the density of the largest component, the density of edges of the model, and the free energy. This work generalizes earlier results valid for the Potts model, whereq is an integer satisfyingq2. Equivalent results are obtained for a fixed edge-number random-cluster model. As a consequence of the results of this paper, one obtains large-deviation theorems for the number of components in the classical random-graph models (whereq=1).     

Optimal transformations for prediction in continuous-time stochastic processes: finite past and future

In the classical Wiener-Kolmogorov linear prediction problem, one fixes a linear functional in the future of a stochastic process, and seeks its best predictor (in the L²-sense). In this paper we treat a variant of the prediction problem, whereby we seek the most predictable non-trivial functional of the future and its best predictor; we refer to such a pair (if it exists) as an optimal transformation for prediction. In contrast to the Wiener-Kolmogorov problem, an optimal transformation for prediction may not exist, and if it exists, it may not be unique. We prove the existence of optimal transformations for finite past and future intervals, under appropriate conditions on the spectral density of a weakly stationary, continuous-time stochastic process. For rational spectral densities, we provide an explicit construction of the transformations via differential equations with boundary conditions and an associated eigenvalue problem of a finite matrix.This research was partially supported by ARO (MURI grant) DAAH04-96-1-0445, NSF grant DMS-0074276, and CNPq grant 301179/00-0.     

Das Verfahren der Treppeniteration und verwandte Verfahren zur Lösung algebraischer Eigenwertprobleme

Summary We have described two closely related numerical methods for the solution of eigenvalue problems called stabilized iteration and mutually stabilized biiteration. The iteration process shows numerical stability, has no loss of leading figures and is self-correcting, givingsome eigenvectors immediately in the second case, in triangular decomposition in an important special case of the stabilized iteration, called Treppeniteration.The processes are mathematically closely related toRutishauser's LR-Transformation, but differ in numerical aspect. A certain mixed process, based onRutishauser and the author's ideas, seems to be the optimum way with regard to both security and numerical labor.     

Some New Transversality Properties

The theorems of Ceva and Menelaus are concerned with cyclic products of ratios of lengths of collinear segments of triangles or more general polygons. These segments have one endpoint at a vertex of the polygon and one at the intersection point of a side with a suitable line. To these classical results we have recently added a selftransversality theorem in which the suitable line is determined by two other vertices. Here we present additional transversality properties in which the suitable line is determined either by a vertex and the intersection point of two diagonals, or by the intersection points of two pairs of such diagonals. Unexpectedly it turns out that besides several infinite families of systematic cases there are also a few sporadic cases.     

Polynomial operations on complex K-theory

We adapt here the results of the author concerning polynomial operations on the 0th stable cohomotopy to the case of the 0th complex K-theory and consider polynomial operations : Kh, where h is a ring-valued contravariant functor, defined on finite CW-complexes, satisfying some properties. We construct a family of generating operations for the ring Pol(K,h) of all polynomial operations : Kh and doing so, we describe the additive structure of this ring in terms of the h(BU(n)'s. As an illustration of how polynomiality could be used to study operations in the setting of algebraic K-theory, we consider, from our point of view, the well known situation operations : KK on complex K-theory.     

The Hyperbell Algorithm for Global Optimization: A Random Walk Using Cauchy Densities

This article presents a new algorithm, called theHyperbell Algorithm, that searches for the global extrema ofnumerical functions of numerical variables. The algorithm relies on theprinciple of a monotone improving random walk whose steps aregenerated around the current position according to a gradually scaleddown Cauchy distribution. The convergence of the algorithm is provenand its rate of convergence is discussed. Its performance is tested onsome hard test functions and compared to that of other recentalgorithms and possible variants. An experimental study of complexityis also provided, and simple tuning procedures for applications areproposed.     

On a problem of B. I. Golubov

. . . : s_n(x) — , _n-(, 1)- n L ². , . , : a _k l ² _n () [0,1] , (*) , (**) . a _k l ² u _n () [0,1] , (**), (*) .     

Experiments with an interactive paired comparison simplex method for molp problems

In this paper, an interactive paired comparison simplex based method formultipleobjectivelinearprogramming (MOLP) problems is developed and compared to other interactive MOLP methods. Thedecisionmaker (DM)'s utility function is assumed to be unknown, but is an additive function of his known linearized objective functions. A test for utilityefficiency for MOLP problems is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion of strength ofpreference is developed for the assessment of the DM's unknown utility function where he can express his preference for a pair of extreme points as strong, weak, or almost indifferent. The problem of inconsistency of the DM is formalized and its resolution is discussed. An example of the method and detailed computational results comparing it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive multiple objective programming methods are also discussed.All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors.     

On Piecewise-Constant Approximation of Continuous Functions of n Variables in Integral Metrics

We consider the approximation by piecewise-constant functions for classes of functions of many variables defined by moduli of continuity of the form (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ), where _i ( _i ) are ordinary moduli of continuity that depend on one variable. In the case where _i ( _i ) are convex upward, we obtain exact error estimates in the following cases: (i) in the integral metric L ₂ for (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ); (ii) in the integral metric L _p (p 1) for (₁, ..., _n ) = c ₁₁ + ... + c _{n n} ; (iii) in the integral metric L _{(2, ..., 2, 2r)} (r = 2, 3, ...) for (₁, ..., _n ) = ₁(₁) + ... + _{n – 1}( _{n – 1}) + c _{n n} .     

‘Outside’ as a primitive notion in constructive projective geometry

In intuitionistic (or constructive) geometry there are positive counterparts, apart and outside, of the relations = and incident. In this paper it is shown that the relation outside suffices to define incident, apart and equality. The equivalence of the new system with Heyting's system is shown and as a simple corollary one obtains duality for intuitionistic projective geometry.     

Asymptotic Formulae and Divisor Problems

We investigate the asymptotic behaviour of the summatory functions of _z(n, ), _k(n, ) z ⁽ⁿ⁾ and _k(n, ) z ⁽ⁿ⁾.     

Fourier series of additive vector measures and their term-by-term differentiation

On a measurable space (T, , ) we choose an additive measure: Z (Z is a Banach space) with the following property: for alle , we have ; this measure defines an indefinite integral over the measure onL ² (T, ,). We prove that if { _n (t)} _n ^=1/ is an orthonormal basis inL ² and _n (e)=e _n (t) d, then any additive measure: Z whose Radon-Nikodým derivatived/d belongs toL ² is uniquely expandable in a series(e)= _n ^=1/ _n n(e) that converges to(e) uniformly with respect toe can be differentiated term-by-term, and satisfies _n ^=1/ _n ^/2 <. In the caseL ²[0,2],Z=, the Fourier series of a 2-periodic absolutely continuous functionF(t) such thatF'(t) L ²[0, 2] is superuniformly convergent toF(t).Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 180–184, August, 1998.     

Transient solution for a finite capacity M/G a,b /1 queueing system with vacations to the server

In this paper we consider a single server queueing system with Poisson input, general service and a waiting room that allows only a maximum of b customers to wait at any time. A minimum of a customers are required to start a service and the server goes for a vacation whenever he finds less than a customers in the waiting room after a service. If the server returns from a vacation to find less than a customers waiting, he begins another vacation immediately. Using the theory of regenerative processes we derive expressions for the time dependent system size probabilities at arbitrary epochs.     

Invariant Subspaces for Positive Operators Acting on a Banach Space with Markushevich Basis

We introduce weak quasinilpotence for operators. Then, by substituting Markushevich basis and weak quasinilpotence at a nonzero vector for Schauder basis and quasinilpotence at a nonzero vector, respectively, we answer a question on the invariant subspaces of positive operators in [3].     

The trace to subsets ofR n of Besov spaces in the general case

R ⁿ. , , , F R ⁿ, F , R ⁿ R ⁿ . ^p,q (Rⁿ), >0, 1, q, — ( ) Rⁿ. , ^p,q (Rⁿ) ^F Rⁿ. , q B ^p,q (F), = – (n–)/, >0, — « », ad — F, . , . : , F=R ^d,F— « » F— R ⁿ, « », F. .

---

---

This work has been supported in part by the Swedish Natural Science Research Council.     

On contiguity of probability measures corresponding to semimartingales

, (ⁿ), - (P ⁿ ), P ⁿ (A ⁿ )>0P ⁿ (A ⁿ )0,n. [15] - , . , P ⁿ P ⁿ T ⁿ T ⁿ .