Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.     

Rate of convergence in the central limit theorem for empirical processes

Let _n and be an empirical process and a generalized Brownian bridge, respectively, indexed by a class of real measurable functions. From the central limit theorem for empirical processes it follows that for allr0. In this paper, assuming the class to be countably determined, under certain conditions we obtain an estimate for some constantC. Vapnik-ervonenkis class and the indicators of lower left orthants provide examples of classes considered here.     

Happy families and completely Ramsey sets

Summary We use games of Kastanas to obtain a new characterization of the classC of all sets that are completely Ramsey with respect to a given happy family . We then combine this with ideas of Plewik to give a uniform proof of various results of Ellentuck, Louveau, Mathias and Milliken concerning the extent ofC . We also study some cardinals that can be associated with the ideal of nowhere -Ramsey sets.Part of this research was done while the author was visiting I.V.I.C. in Caracas in September 1989. The author would like to thank Carlos Di Prisco for his hospitality.     

Finely holomorphic functions and quasi-analytic classes

We study the set of functions in quasi-analytic classes and the set of finely holomorphic functions. We show that no one of these two sets is contained in the other.LetI denote the set of complex functionsf: for which there exists a quasi-analytic classC{M _n} containingf. Let denote the set of complex functionsf: for which there exist a fine domainU containing the real line and a function finely holomorphic onU satisfyingf(x)= (x) for allx . The power of unique continuation is incomparable in these two cases (I\ is non-empty, \I is non-empty).Research supported by the grant No. 201/93/2174 of Czech Grant Agency and by the grant No. 354 of Charles University.     

A graded scale of parametric families of distributions,and parameter estimates based on the sample mean

Summary Denote by _k a class of familiesP={P} of distributions on the line R¹ depending on a general scalar parameter , being an interval of R¹, and such that the moments µ₁()=xdP ,...,µ_2k ()=x ^2k dP are finite, ₁ (), ..., _k (), _k+1 () ..., _k () exist and are continuous, with ₁ () 0, and _j +1 ()= ₁ () _j () +[₂() -₁()²] _j ()/ ₁ (), J=2, ..., k. Let ₁=¯x=x ₁ + ... +x _n/n, ₂=x ₁ ² + ... +x _n ²/n, ..., _k =(x ₁ ^k + ... +x _n ^k/n denote the sample moments constructed for a sample x₁, ..., x_n from a population with distribution Pg. We prove that the estimator of the parameter by the method of moments determined from the equation ₁= ₁() and depending on the observations x₁, ..., x_n only via the sample mean ¯x is asymptotically admissible (and optimal) in the class _k of the estimators determined by the estimator equations of the form ₀ () + ₁ () ₁ + ... + _k () _k =0 if and only ifP _k .The asymptotic admissibility (respectively, optimality) means that the variance of the limit, as n (normal) distribution of an estimator normalized in a standard way is less than the same characteristic for any estimator in the class under consideration for at least one 9 (respectively, for every ).The scales arise of classes _{1 2}... of parametric families and of classes _{1 2} ... of estimators related so that the asymptotic admissibility of an estimator by the method of moments in the class _k is equivalent to the membership of the familyP in the class _k .The intersection consists only of the families of distributions with densities of the form h(x) exp {C₀() + C₁() x } when for the latter the problem of moments is definite, that is, there is no other family with the same moments ₁ (), ₂ (), ...Such scales in the problem of estimating the location parameter were predicted by Linnik about 20 years ago and were constructed by the author in [1] (see also [2, 3]) in exact, not asymptotic, formulation.Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei, pp. 41–47, 1981.     

Estimation of the Intensity of the Flow of Nonmonotone Refusals in the Queuing System (≤ λ)/G/m

We consider a queuing system ()/G/m, where the symbol () means that, independently of prehistory, the probability of arrival of a call during the time interval dtdoes not exceed dt. The case where the queue length first attains the level r m+ 1 during a busy period is called the refusal of the system. We determine a bound for the intensity ₁(t) of the flow of homogeneous events associated with the monotone refusals of the system, namely, ₁(t) = O( ^{r+ 1}₁ ^{m– 1} _{r– m+ 1}), where _k is the kth moment of the service-time distribution.     

On the kernel of intersecting families

Let be at-wises-intersecting family, i.e.,|F ₁ ... F _t | s holds for everyt members of. Then there exists a setY such that|F ₁ ... F _t Y| s still holds for everyF ₁,...,F _t . Here exponential lower and upper bounds are proven for the possible sizes ofY. This work was done while the authors visited Bell Communication Research, NJ 07960, and AT&T Bell Laboratories, Murray Hill, NJ 07974, USA, respectively.Research supported in part by Allon Fellowship and by Bat Sheva de Rothschild Foundation.     

Flowchart machines

Let denote a conventional flowchart. Any algorithm can be represented by a flowchart. If action nodes in call then is a recursive flowchart. We show how to decompose arbitrary non-self-modifying programs into structure and atomic parts. We specifically give the synthesis procedure for a controller . can serve as the only sequencer in an execution of . If is recursive then is a pushdown machine, otherwise is a finite state machine. The next-state functionf and the output functiong of represent respectively all of the structure-, i.e. the programmer-oriented-, and all of the atomic-, i.e. the data-oriented-, parts of .f defines the flow or pattern of computations andg the actual transformations or operations on data. Thus we construct and analyze programs by constructing and analyzing their sequencers .     

On certain imbedding and extension theorems for a weighted class of functions

n- , S n–1 m (0m<n), () S . () , ().     

Minimization of the Conformal Radius under Circular Cutting of a Domain

Let D be a simply connected domain on the complex plane such that 0 D. For r > 0 , let D _r be the connected component of D {z : |z| < r} containing the origin. For fixed r, we solve the problem on minimization of the conformal radius R(D _r, 0) among all domains D with given conformal radius R(D, 0). This also leads to the solution of the problem on maximization of the logarithmic capacity of the local -extension E (a) of E among all continua E with given logarithmic capacity. Here, E (a) = E {z : |z – a| }, a E, > 0. Bibliography: 12 titles.     

Approximate Identities in Spaces of all Absolutely Continuous Measures on Locally Compact Semigroups

Let G be a locally compact group. Then M_a (G), the space of all absolutely continuous measures on G, has a bounded approximate identity. Baker and Baker proved that (S) (the space of all measures M(S) so that maps x _x *|| and x ||*_x are weak continuous from a locally compact semigroup S into M(S)) is closed under absolutely continuity and has an approximate identity. The main purpose of this paper is to show that similar results hold true for a locally compact semigroup S and M_a(S) the space of all absolutely continuous measures on S.     

Stochastic processes with Gaussian interaction of components

Summary LetU(x), x ^d-|0}, be a nonnegative even function such that _x 0U(x)1. In this paper, we consider an infinite system of stochastic process _t (x); x ^d with the following mechanism: at each sitex, after mean 1 exponential waiting time, _t(x) is replaced by a Gaussian random variable with mean _{yx t} (y) U(y-x) and variance 1. It is understood here that all the interactions are independent of one another. The behavior of this system will be investigated and some ergodic theorems will be derived. The results strongly depend whether _{x 0} U(x)<1 or =1.     

On a construction of Thomassen

Using a construction of Thomassen [Discrete Math. 9, 91–96 (1974)] we prove that for infinitely manyn there is a family _n of triangle-free maximally non-hamiltonian graphs of ordern with | _n | exponentially inn. In particular, for everym 48 we construct such a graph; an infinite number of these provide new almost extremal examples in the sense of minimal size.     

New lower semicontinuity results for polyconvex integrals

Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C¹(;R ^k), R ⁿ . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c₀¦(A)¦ for a suitable constant c₀ > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC ¹(;R ^k) with respect to the strong topology ofL ¹(;R ^k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL ¹(;R ^k ) which is less than or equal toF on C¹(;R ^k). For everyu BV(;R ^k) we prove that (u,) f(u)dx+c₀¦D^su¦(), whereDu=u dx+D^su is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W^1,p(;R ^k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BV_loc(R ⁿ;R ^k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BV_loc(R ⁿ;R ^k), even ifu W _loc ^1,p (R ⁿ;R ^k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R ^k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.     

A Hubert space characterization among function spaces

— [0,1] ,E — - e=1 [0,1]. I — _E =1, E=L ₂ x _e =xL ₂ x E.

---

---

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.     

Homogene mehrparametrische lineare Programmierung

Zusammenfassung Bei der Ausarbeitung von Verfahren zur Lösung von linearen Programmen mit mehreren Parametern in der rechten Seite oder in der Zielfunktion wurde bisher stillschweigend angenommen, daß der Vektorb0 oderc0 ist. In diesem Artikel wird der Fall erörtert, in dem die ursprüngliche rechte Seiteb=0 oder die ursprünglichen Zielfunktionskoeffizientenc=0 sind. Außerdem wird der Spezialfall behandelt, für den zwarb0, aber jede Komponenteb _i vonb mit jeweils einem Parameter _i 0 multipliziert wird (oder analog fürc _j).

---

Summary In working out methods for solving linear programming problems with a vector-parameter in the right hand side or in the objective function there has been always implicitely assumed thatb0 orc0. In this paper there is solved the multiparametric linear programming problem for the case when the originalb=0 or the originalc=0. Besides there is also treated a specific problem, namely,b0, but each componentb _i ofb is multiplied by a parameter _i 0 (or similarly forC _j).

     

Set systems with no union of cardinality 0 modulom

Letq be a prime power. It is shown that for any hypergraph = {F ₁,...,F _d(q–1)+1} whose maximal degree isd, there exists Ø ₀ , such that 0 (modq).     

Converse results on equiconvergence of interpolating polynomials

, n- n- 1 , . , , ( « ») f .     

Higher-Dimensional Representations of the Reflection Equation Algebra

We consider a new method for constructing finite-dimensional irreducible representations of the reflection equation algebra. We construct a series of irreducible representations parameterized by Young diagrams. We calculate the spectra of central elements s _k=Tr_q L ^k of the reflection equation algebra on q-symmetric and q-antisymmetric representations. We propose a rule for decomposing the tensor product of representations into irreducible representations.