Strong laws for exponential order statistics and spacings

We obtain upper and lower almost sure asymptotic bounds for spacings η _{K, N} − η _{K + 1, N} , where η _{1, N} > η _{2, N} > ⋯ > η _{N, N} are the order statistics of independent exponentially distributed random variables η ₁, η ₂, ..., η _N with mean 1; here N → ∞, and K = 1, 2, ... is fixed. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 4, pp. 477–491, October–December, 2006.     

Optimal interpolation in spaces of Lorentz-Zygmund type

The Lorentz-Zygmund spaces, introduced by C. Bennett and K. Rudnick in [BR], are generalized by taking the exterior norm in arbitrary rearrangement invariant spaceE instead of onlyL _r-spaces. On the spacesL _p,α,E thus obtained, we study all operatorsT of two weak types (a, b) and (p, q) with 1≤a<p≤∞, 1≤b<q≤∞, and prove thatT:L _p,α,E→L _q,α−1,E. Moreover, for any set of parametersp, q, α, E, we construct the smallest possible spaceB _q,α,E such thatT:L _p,α,E→B _q,α,E and the largest possible spaceA _p,α,E such thatT:A _p,α,E→L _q,α−1,E. For spaces of all three types, we find their fundamental functions and Boyd indices, state various embeddings, equivalences and other properties. The research was supported by the Center of Scientific Absorption of the Ministry of Absorption of the State of Israel.     

Intersection Properties of Families of Convex (n,d)-Bodies

We study a multicomponent generalization of Helly's theorem. An (n,d)-body K is an ordered n -tuple of d -dimensional sets, K= < K ₁ , . . . ,K _n > . A family of (n,d)-bodiesis weakly intersecting if there exists an n -point p = < p ₁ , . . . , p _n > such that for every there exists an index 1 for which p _i ∈ K _i . A family of (n,d)-bodies is strongly intersecting if there exists an index i such that . The main question addressed in this paper is: What is the smallest number H(n,d), such that for every finite family of convex (n,d)-bodies, if every H(n,d) of them are strongly intersecting, then the entire family is weakly intersecting? We establish some basic facts about H(n,d) , and also prove an upper bound . In addition, we introduce and discuss two interesting related questions of a combinatorial-topological nature. Received February 9, 1996, and in revised form November 6, 1996, December 16, 1996, and January 7, 1998.     

Über die allgemeine lineare Differentialgleichung

Résumé Anmerkung der Redaktion. HerrFréchet (Paris) schreibt uns zu der vorliegenden Arbeit: L'intégration d'une équation linéaire d'ordren (1) est, comme on sait équivalente à celle d'un système canonique linéaireS den équations du premier ordre àn inconnues. Or le problème consistant à donner une expression formelle (et rigoureuse) de la solution générale deS (quand par exemple les coefficients deS sont continus¹⁾), a été résolu par plusieurs auteurs. Chacune des solutions se trouve exprimée, comme dans l'expression (2) de M. Ta Li, par une série d'intégrales multiples d'ordre croissant portant sur des polynomes de degrés croissants par rapport aux coefficients (fonctions dex) deS. C'est le résultat obtenu d'abord parPeano, Math. Ann. vol. 32, 1888, p. 459, puis indépendamment parBaker dans le cas de coefficients analytiques au moyen de la théorie des matrices (Proceedings London Math. Soc., vol. 34, 1902, p. 354 et 356, vol. 35, 1903, p. 333–378; vol. 2, sér. 2, 1904, p. 293–296; Phil. Trans. Royal Soc., A. Vol. 216, 1915–16, p. 129 à 186). Ce résultat s'obtient pour ainsi dire sans calcul comme l'a signaléM. Hostinský (Le problème de Cauchy pour les équations différentielles linéaires, Publ. Fac. Sc. Univ. Masaryk, Brno, Nr. 230, 1936) par une simple application de la méthode des approximations successives. Il en résulte immédiatement la formule correspondante pour l'intégrale générale de l'équation générale linéaire d'ordren (voir par exemple: Leçons sur les équations différentielles, parM. Fréchet, p. 126–129; [voir aussi p. 109–111], chez Tournier et Constant, Paris, 1938). Mais dans l'expression obtenue, il y a des simplifications à faire. La formule (2) de M.Ta Li a le grand intérêt de se présenter toutes simplifications faites.     

Tilings of Polygons with Similar Triangles, II

Let A be a polygon, and let s (A) denote the number of distinct nonsimilar triangles Δ such that A can be dissected into finitely many triangles similar to Δ . If A can be decomposed into finitely many similar symmetric trapezoids, then s(A)=∞ . This implies that if A is a regular polygon, then s(A)=∞ . In the other direction, we show that if s(A)=∞ , then A can be decomposed into finitely many symmetric trapezoids with the same angles. We introduce the following classification of tilings: a tiling is regular if Δ has two angles, α and β , such that at each vertex of the tiling the number of angles α is the same as that of β . Otherwise the tiling is irregular. We prove that for every polygon A the number of triangles that tile A irregularly is at most c ⋅ n ⁶ , where n is the number of vertices of A. If A has a regular tiling, then A can be decomposed into finitely many symmetric trapezoids with the same angles. <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p411.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received February 17, 1997, and in revised form June 16, 1997.     

On multivalued topologies on <Emphasis Type="Italic">L</Emphasis>-powersets of multivalued sets

Given an M-valued equality E: X×X → M on a set X, we extend it to the M-valued equality ε: L ^X × L ^X → M on the L-powerset L ^X of X, where L is a complete sublattice of a GL-monoid M. As a result, we come to a category SET(M,L) whose objects are quadruples (X,E,L ^X , ε). This category serves as a ground category for the category L-TOP(M) of (L,M)-valued topological spaces and some of its subcategories, which are the main subject of this paper. In particular, as special cases, we obtain here Chang-Goguen, Lowen, Kubiak-Šostak, and some other known categories related to fuzzy topology. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 11, No. 4, pp. 237–247, 2005.     

Courbure de Ricci et géométrie conforme

Résumé On connaÎt l'intérÊt porté sur les liaisons entre courbure de Ricci et géométrie conforme d'une variété riemannienne. Ici on étudie une fonctionnelle attachée aux déformations conformes du tenseur d'Einstein d'une variété riemannienne compacte (M, g) de dimension n > 2, en obtenant certains résultats globaux concernant la géométrie et la topologie de (M, g), en particulier une condition pour que (M, g) soit isométrique à une sphère euclidienne. On étudie, ensuite, la courbure de Ricci du fibré tangent en cercles T_cV d'une variété riemannienne (V, g) de dimension 2, fibré muni de la métrique g^s de Sasaki, en obtenant, d'une part, des resultats, soit locaux soit globaux, sur la géométrie conforme de (T_cV, g^s) et, d'autre part, des conditions d'isométrie, soit de (V, g) soit de (T_cV, g^s), à certaines variétés standard. Certains des résultats de ce travail ont été annoncés dans une note aux Comptes Rendus de l'Académie des Sciences de Paris.Travail exécuté d'après le programme du «Gruppo Nazionale per le strutture algebriche e geometriche e loro Applicazioni, C.N.R. Italia».Alla memoria della mia adorata madre     

A decomposition of the beta distribution,related order and asymptotic behavior

Let β _{v, w} be any beta variate with p.d.f.(Γ(v+w)/Γ(v)Γ(w))x ^v−1(1−x) ^w−1 and letU _{v, w} =-log β _{v, w} . ThenU _v,w =U ^CM +U ^PF , whereU ^CM andU ^PF are independent with completely monotone andPF _∞ densities, respectively. It is shown thatU _{v, w} is infinitely divisible and β _{v, w} correspondingly infinitely factorable. The asymptotic behavior ofU _{v, w} and β _{v, w} for largev, w is described. For different modes of increase ofv andw,U _{v, w} is asymptotically normal, gamma or extreme value distributed. The decomposition is employed to provide an algorithm for generating random β _{v, w} distributed numbers. Many of the results are based on insights provided by the classical theory of the Gamma function in the complex plane. This work was supported in part by the United States Air Force, Office of Scientific Research, under grant No. AFOSR-79-0043.     

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%

We consider the problem of bounding the complexity of the k th level in an arrangement of n curves or surfaces, a problem dual to, and an extension of, the well-known k-set problem. Among other results, we prove a new bound, O(nk ^5/3 ) , on the complexity of the k th level in an arrangement of n planes in R ³ , or on the number of k -sets in a set of n points in three dimensions, and we show that the complexity of the k th level in an arrangement of n line segments in the plane is , and that the complexity of the k th level in an arrangement of n triangles in 3-space is O(n ² k ^5/6 α(n/k)) . <lsiheader> <onlinepub>26 June, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>19n3p315.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>yes <sectionname> </lsiheader> Received February 7, 1997, and in revised form May 15, 1997, and August 30, 1997.     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

On statistical convergence of vector-valued sequences associated with multiplier sequences

We introduce vector-valued sequence spaces w _∞(F, Q, p, u), w ₁(F, Q, p, u), w ₀(F, Q, p, u), S _u ^q , and S _0u ^q using a sequence of modulus functions and a multiplier sequence u = (u _k ) of nonzero complex numbers. We give some relations for these sequence spaces. It is also shown that if a sequence is strongly u _q -Cesàro summable with respect to the modulus function, then it is u _q -statistically convergent. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 1, pp. 125–131, January, 2006.     

Decrease rate of the probabilities ofε-deviations for the means of stationary processes

The asymptotic behavior asn → ∞ of the normed sumsσn =n ⁻¹ Σ _k ⁼⁰ⁿ⁻¹ Xk for a stationary processX = (X _n ,n ∈ ℤ) is studied. For a fixedε > 0, upper estimates for P(sup _k≥n |σ _k | ≥ε) asn → ∞ are obtained. Translated fromMatematicheskie Zametki, Vol. 64, No. 3, pp. 366–372, September, 1998.     

Flow in an occluded circular cylindrical tube with permeable wall

Résumé L'éoulement d'un liquide dans un tube à paroi perméable se rencontre dans plusieurs problèmes d'ingénieur, tels que la purification de l'eau, l'osmose inverse, l'écoulement dans un milieu proeux, etc. Cet exposé traite un problème physiologique, à savoir, l'écoulement du sang dans les plus petits vaisseaux sanguins, les «capillaires».L'expérience de «micro-occlusion» de Landis (1927) était un pas important dans le problème du transport fluidique à travers un vaisseau sanguin. Récemment, Zweifach et Intaglietta (1966, 1968) ont obtenu des données importantes grâce à une expérience perfectionnée du type de celle de Landis. L'interprétation de ces expériences se fonde sur l'hypothèse de Starling de l'interaction des pressions osmotique et hydrostatique. Dans cet ouvrage, on étudie un modèle simplifié du transport fluidique à travers la paroi d'un vaisseau sanguin capillaire. On donne une méthode analytique pour étudier l'appliation de l'hypothèse de Starling au mouvement d'un fluide visquex dans un tube circulaire occlu. On suppose que les pressions hydrostatique et osmotique de l'espace extérieur entourant le tube aient les mêmes valeurs d'équilibre avant et après l'occlusion, de sorte que l'écoulement de masse à travers la paroi du tube, conformément à l'hypothèse de Starling, est simplement proportionnel au changement de la pression hydrostatique à travers le paroi. La solution démontre que, quand la constante de perméabilité dépasse une certaine valeur, l'éoulement axial amont détermine le mouvement fluidique; et que l'écoulement à travers la paroi du tube est plus ou moins indépendant de la perméabilité de la paroi. Quand la constante de perméabilité est petite, l'écoulement à travers la paroi est proportionnel à la perméabilité.L'hypothèse de Starling étant applicable à la dialysation des membranes, la présente démonstration a d'autres domaines d'application pour l'ingénieur. Cette méthode d'analyse peut être appliquée pour résoudre un type général du problème de valeur de limite associée à l'équation de Stokes dans laquelle deux conditions indépendantes sont données pour la surface et l'une des extrémités de la région cylindrique circulaire.     

Maximum two-dimensional （u × v, 4, 1, 3）-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.     

Terseness: Minimal Idempotent Generating Sets for K(n,r)

Abstract. Let n and r be positive integers with 1 < r < n and let K(n,r) consist of all transformations on X _n = {1,···,n} having image size less than or equal to r . For 1 < r < n , there exist rank-r elements of K(n,r) which are not the product of two rank-r idempotents. With this limitation in mind, we prove that for fixed r , and for all n large enough relative to r , that there exists a minimal idempotent generating set U of K(n,r) such that all rank-r elements of K(n,r) are contained in U ³ . Moreover, for all n> r>1 , there exists a minimal idempotent generating set W for K(n,r) such that not every rank-r element is contained in W ³ .     

An application of the neyman-pearson lemma to gaussian processes

Letξ _i (t),i=1,2,t ∈ [0, 1], be Gaussian zero mean processes with continous sample paths. Bounds for the probabilitiesβ _i =P{ξ _i -α _i ∈B},i=1,2, are given, where a_iε C0, 1., and B is a Borel subset of C[0, 1] Bibliography: 5 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 207, pp. 5–12, 1993. Translated by V. Sudakov.     

On a weak sum theorem in dimension theory

A metric spaceX = U _i-0 ^x X is constructed such thatX _o={x _o} consists of a single pointx _o , X _i , i=0, 1, 2, … are disjoint and closed,X _i , i=1, 2, … are open, indX _i =0 fori=0, 1, … and indX=1. The above space (proved to be, in some sense, most simple) shows also that the dimension ind of a metric space can be raised by adjoining of a single point, a fact proved recently by E.K. Van Douwen and by T. Przymusiński. Some maximality property of the family {X; IndX=0} is proved and conditions implyingP-ind=P-Ind are given. This is part of a research thesis at the Technion, Israel Institute of Technology, towards an M.Sc. degree, directed by Professor M. Reichaw.     

The diophantine equation x 2 + 2 a · 17 b = y n

Let ?, ? be the sets of all integers and positive integers, respectively. Let p be a fixed odd prime. Recently, there have been many papers concerned with solutions (x, y, n, a, b) of the equation x ² + 2 ^a p ^b = y ⁿ , x, y, n ε ?, gcd(x, y) = 1, n ? 3, a, b ε ?, a ? 0, b ? 0. And all solutions of it have been determined for the cases p = 3, p = 5, p = 11 and p = 13. In this paper, we mainly concentrate on the case p = 3, and using certain recent results on exponential diophantine equations including the famous Catalan equation, all solutions (x, y, n, a, b) of the equation x ²+2 ^a · 17 ^b = y ⁿ , x, y, n ε ?, gcd(x, y) = 1, n ? 3, a, b ∈ ?, a ? 0, b ? 0, are determined.     

On a class of spaces of analytic functions

The spacesb (p, q, λ) (0<p<q⩽∞, 0<λ⩽∞) of functions, analytic in the circle |z|< 1, are introduced, and an unimprovable estimate is obtained for the Taylor coefficients of a functionf∃ b (p, q, λ). It is shown that B(p, q, λ) is the space of fractional derivatives f(α) of order α (−∞<α<1/p−1/q) of a function f of B(s, q, λ), where s=p/(1−αp). Translated from Matematicheskie Zametki, Vol. 21, No. 2, pp. 141–150, February, 1977.     

Graphic sequences with a realization containing a generalized friendship graph

Gould, Jacobson and Lehel [R.J. Gould, M.S. Jacobson, J. Lehel, Potentially G-graphical degree sequences, in: Y. Alavi, et al. (Eds.), Combinatorics, Graph Theory and Algorithms, vol. I, New Issues Press, Kalamazoo, MI, 1999, pp. 451-460] considered a variation of the classical Turán-type extremal problems as follows: for any simple graph H, determine the smallest even integer σ(H,n) such that every n-term graphic sequence π=(d₁,d₂,…,d_n) with term sum σ(π)=d₁+d₂+?+d_n≥σ(H,n) has a realization G containing H as a subgraph. Let F_t,r,k denote the generalized friendship graph on kt−kr+r vertices, that is, the graph of k copies of K_t meeting in a common r set, where K_t is the complete graph on t vertices and 0≤r≤t. In this paper, we determine σ(F_t,r,k,n) for k≥2, t≥3, 1≤r≤t−2 and n sufficiently large.