DOCSLIB.ORG

Author Index ______

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Author Index ______ ______AUTHOR INDEX ______ a space; Homology group; Infinite­ Arellano, E. Ramirez de see: Ramirez de form in logarithms; Siegel theorem; dimensional space; Local decompo­ Arellano, E. Transcendental number sition; Metrizable space; Pontryagin __A __ Argand, J .R. see: Arithmetic; Complex Ball, R. see: Helical calculus duality; Projection spectrum; Suslin number; Imaginary number Balusabramanian, R. see: Waring prob­ theorem; Topological space; Width Aristotle see: Modal logic; Space-time lem Abel, N.H. see: Abel differential Alexander, J.W. see: Alexander dual­ Arkhangel'skil, A.V. see: Feathering Banach, S. see: Area; Banach indica­ equation; Abel-Goncharov prob­ ity; Alexander invariants; Duality; Arno I'd, V.I. see: Composite function; trix; Banach-Mazur functional; Ba­ lem; Abel problem; Abel theorem; Homology group; Jordan theorem; Quasi-periodic motion nach space; Banach-Steinhaus the­ Abel transformation; Abelian group; Knot theory; Manifold; Pontryagin Arsenin, V. Ya. see: Descriptive set the­ orem; Completely-continuous oper­ Abelian integral; Abelian variety; duality; Reaction-diffusion equation; ory ator; Contracting-mapping princi­ Algebra; Algebraic equation; Alge­ Topology of imbeddings Artin, E. see: Abstract algebraic ge­ ple; Franklin system; Hahn-Banach braic function; Algebraic geometry; Alexandrov, A.B. see: Boundary prop­ ometry; Algebra; Algebraic number theorem; Lacunary system; Linear Binomial series; Convergence, types erties of analytic functions theory; Alternative rings and alge­ operator; Luzin N -property; Non­ of; Elliptic function; Finite group; Alling, N.L. see: Surreal numbers bras; Commutative algebra; Con­ differentiable function; Nuclear op­ Galois theory; Group; Interpola­ Almgren, F.J. see: Plateau problem, gruence modulo a prime number; erator; Open-mapping theorem; Or­ tion; Inversion of an elliptic integral; multi-dimensional Divisorial ideal; Foundations of ge­ thogonal series; Tonelli plane vari­ Jacobi elliptic functions; Liouville­ Alvarez-Gaume, L. see: Index formulas ometry; Galois cohomology; Matrix ation; Tonelli theorem; Topological Ostrogradski formula; Period map­ Ambartsumyan, VA. see: Discrete algebra; Projective algebra; Reci­ tensor product; Variation of a map­ ping; Permutation of a set; Series; space-time; Invariant imbedding procity laws; Rings and algebras; ping Umbral calculus; Volterra equation; Ambartzumian, R.V. see: Integral geom­ Wedderburn-Artin theorem; Zeta­ Banchoff, T. see: Tight and taut immer­ Weierstrass elliptic functions etry function sions Abhyankar, S.S. see: Local uniformiza- Amitsur, S. see: Division algebra; Rad­ Arlin, M. see: Algebraic space; Topos; Barbier, E. see: Barbier theorem tion ical; Radical of rings and algebras Zeta-function Bari, N .K. see: Composite function; Adams, J. see: Perturbation theory Ampere, A.M. see: Cybernetics; Arzela, C. see: Arzela variation Metric theory offunctions; Riesz sys­ Adams, J.C. see: Adams method Monge-Ampere equation Askey, R. see: Bieberbach conjecture tem; Trigonometric series; Unique­ Adams, J.F. see: Homotopy group; ,\- Anderson, T.W. see: Cramer-von Mises Astarov, I. see: Elements of Euclid ness set ring test Aliyah, M.F. see: C* -algebra; Chern Barie!, D. see: D-module Addison, J.W. see: Descriptive set the­ Andreev, K.A. see: Gram determinant class; ,\-ring; Lacuna; Vector bundle, Barratt, M. see: Kervaire invariant ory Andreotti, A. see: Schottky problem algebraic Barrett, J.A. see: Walsh system Adleman, L.M. see: Cryptography; Andronov, A.A. see: Andronov-Witt Aubin, T. see: Kahler manifold Barrow, I. see: Finite-difference calcu­ Cryptology; Fermat great theorem theorem; Auto-oscillation; Auto­ Auslander, M. see: Commutative alge­ lus Adler, A. see: Geometric constructions matic control theory; Qualitative bra; Representation of an associative Bartlett, M.S. see: Bartlett test; Ado, 1.0. see: Lie group theory of differential equations; algebra Behrens-Fisher problem Adyan, S.I. see: Burnside problem; Rough system; Stability theory Bateman, H. see: Bateman function; Group calculus Ax, J. see: Model theory Anger, C. T. see: Anger function Bateman method; Integral equation Agmon, S. see: Tricomi problem Azizov, T.Ya. see: Krein space Anick, D. see: Local ring Baudet, A. see: van der Waerden theo­ Agnesi, M. see: Witch of Agnesi Anosov, D.V. see: Y-system rem Ahlfors, L. V. see: Analytic capacity; Antoine, L. see: Topology ofimbeddings Bauer, H. see: Perron integral; Potential Asymptotic value; Extremal met­ theory, abstract ric, method of the; Quasi-conformal Apollonius of Perga see: Apollo- Baumslag, G. see: Non-Hopf group mapping; Removable set nius problem; Cartesian coordi­ __ B __ Bautista, R. see: Representation of an Airy, G.B. see: Airy equation; Cartog- nates; Conic sections; Coordinates; associative algebra raphy, mathematical problems in Elements of Euclid Aitken, A.C. see: Aitken scheme Appel, K. see: Graph, planar Bach, R. see: Bivector space Bayes, T. see: Bayes formula al' -Kashi see: Number; Pascal triangle Appell, P.E. see: Appell equations; Ap­ Bachelier, L. see: Einstein-Smolu- Bazilevich, I.E. see: Bieberbach conjec- Al-Khwarizmi, Mohammed see: Alge- pell polynomials; Appell transforma­ chowski equation; Markov process ture; Rotation theorems bra; Arithmetic tion; Variational principles of classi­ Bachet, C.G. see: Diophantine equa­ Beauville, A. see: Schottky problem Albanese, G. see: Albanese variety cal mechanics tions Bebutov, M. V. see: Saddle at infinity Albert, A.A. see: Brauer group; Deriva­ Arakelov, S. Yu. see: Finiteness theo­ Bachmann, F. see: Foundations of ge­ Beck, A. see: Search problem (linear) tion in a ring; Division algebra; Lie­ rems; Mordell conjecture ometry Behnke, H. see: Analytic space admissible algebra Arakelyan, N.U. see: Value-distribution Baer, R. see: Baer multiplication; Ex­ Behrens, W.U. see: Behrens-Fisher Aleksandrov, A.O. see: Convex surface; theory tension of a group; Heaps and semi­ problem Discrete group of transformations; Araki, S. see: Cobordism heaps Beilinson, A. see: Hodge conjecture Geometry in the large; Interior ge­ Arbarello, E. see: Schottky problem Baily jr., W.L. see: Automorphic func­ Beilinson, P. see: Zeta-function ometry; Isometric immersion; Min­ Arbuthnot!, J. see: Non-parametric tion Bell, E.T. see: Umbral calculus kowski problem; Tight and taut im­ methods in statistics Baire, R. see: Axiomatic set theory; Bellman, R. see: Bellman-Harris pro- mersions; Weyl problem Archimedes see: Archimedean axiom; Baire classes; Baire theorem; De­ cess; Continuation method (to a pa­ Aleksandrov, P.S. see: A-operation; Archimedean spiral; Cartesian co­ scriptive set theory; Functions of a rametrized family); Dynamic pro­ Aleksandrov . co!"pactification; ordinates; Convergence, types of; real variable, theory of; Metric the­ gramming; Hamilton-Jacobi theory; Alexander duahty; Cech cohomol­ Element.s of Euclid; Exhaustion, ory of functions Search problem (linear) ogy; Compact space; Compactifica­ method of; Indivisibles, method Baker, A. see: Analytic number the­ Beltrami, E. see: Beltrami coordi­ tion; Covering (of a set); Descriptive of; Infinitesimal calculus; Integral ory; Diophantine approximation, nates; Beltrami-Enneper theorem; set theory; Duality; Dyadic com­ calculus; Mathematical analysis; problems of effective; Diophantine Beltrami interpretation; Beltrami pactum; Functions of a real variable, Mathematical symbols; Number; approximations; Diophantine equa­ method; Differential geometry of theory of; Homological dimension of Quantity; Semi-regular polyhedra tions; Diophantine geometry; Linear manifolds; Differential parameter; 717 BELTRAMI, E. Hilbert invariant integral; Laplace­ Bertini, E. see: Algebraic geometry; of averaging; Markov process; Met­ Borgwardt, K.H. see: Linear program- Beltrami equation; Negative curva­ Algebraic surface; Bertini theorems; ric transitivity; Oscillations, theory ming ture, surface of Cremona group of; Perturbation theory; Poincare Borho, W. see: Dimension Bendixson, I. see: Bendixson crite­ Bertrand, G. see: Poincare-Bertrand return theorem; Qualitative theory Born, M. see: Scattering matrix rion; Bendixson sphere; Degener­ formula of differential equations; Quantum Borsuk, K. see: Borsuk problem ate equilibrium position; Poincare-­ Bertrand, J. see: Bertrand criterion; field theory; Quasi-averages, method Boscovic, R. see: Gravitation Bendixson theory; Qualitative theory Bertrand curves; Bertrand paradox; of; Renormalization Bose, S. see: Bose-Einstein statistics of differential equations Bertrand postulate; Games, theory Bohl, P.G. see: Bohl almost-periodic Bott, R. see: Bott periodicity theorem; Benes, V.E. .see: Stochastic processes, of functions; Brouwer theorem; Func­ Foliation; Frobenius theorem; La­ filtering of Besicovitch, A.S. see: Hausdorff mea­ tions of a real variable, theory of cuna; Tight and taut immersions Berge, C. see: Infinite game sure Bohlin, B. see: Perturbation theory Bouguer, P. see: Curve of pursuit Bergman, G. see: Dimension Besov, O.V. see: Imbedding theorems Bohman, H. see: Approximation of Bouquet, C. see: Sokhotskii theorem Bergman, S. see: Bergman kernel func­ Bessel, F. W. see: Bessel equation; Bessel functions, linear methods Bouquet, T. see: Briot-Bouquet equa- tion; Bergman-Weil representation inequality; Fourier series; Orthogo­ Bohr, H. see: Almost-periodic func­ tion Bernays, P. see: Formal mathematical nal series; Umbra) calculus tion; Average rotation; Bohr almost­ Bourbaki, N. see: Barrelled space; analysis Beth, E.W. see: Heyting formal system;
Load more

Recommended publications
  • Package 'Popbio'
    Package ‘popbio’ February 1, 2020 Version 2.7 Author Chris Stubben, Brook Milligan, Patrick Nantel Maintainer Chris Stubben <[email protected]> Title Construction and Analysis of Matrix Population Models License GPL-3 Encoding UTF-8 LazyData true Suggests quadprog Description Construct and analyze projection matrix models from a demography study of marked individu- als classified by age or stage. The package covers methods described in Matrix Population Mod- els by Caswell (2001) and Quantitative Conservation Biology by Morris and Doak (2002). RoxygenNote 6.1.1 NeedsCompilation no Repository CRAN Date/Publication 2020-02-01 20:10:02 UTC R topics documented: 01.Introduction . .3 02.Caswell . .3 03.Morris . .5 aq.census . .6 aq.matrix . .7 aq.trans . .8 betaval............................................9 boot.transitions . 11 calathea . 13 countCDFxt . 14 damping.ratio . 15 eigen.analysis . 16 elasticity . 18 1 2 R topics documented: extCDF . 19 fundamental.matrix . 20 generation.time . 21 grizzly . 22 head2 . 24 hudcorrs . 25 hudmxdef . 25 hudsonia . 26 hudvrs . 27 image2 . 28 Kendall . 29 lambda . 31 lnorms . 32 logi.hist.plot . 33 LTRE ............................................ 34 matplot2 . 37 matrix2 . 38 mean.list . 39 monkeyflower . 40 multiresultm . 42 nematode . 43 net.reproductive.rate . 44 pfister.plot . 45 pop.projection . 46 projection.matrix . 48 QPmat . 50 reproductive.value . 51 resample . 52 secder . 53 sensitivity . 55 splitA . 56 stable.stage . 57 stage.vector.plot . 58 stoch.growth.rate . 59 stoch.projection . 60 stoch.quasi.ext . 62 stoch.sens . 63 stretchbetaval . 64 teasel . 65 test.census . 66 tortoise . 67 var2 ............................................. 68 varEst . 69 vitalsens . 70 vitalsim . 71 whale . 74 woodpecker . 74 Index 76 01.Introduction 3 01.Introduction Introduction to the popbio Package Description Popbio is a package for the construction and analysis of matrix population models.
    [Show full text]
  • Workshop on Modern Applied Mathematics PK 2012 Kraków 23 — 24 November 2012
    Workshop on Modern Applied Mathematics PK 2012 Kraków 23 — 24 November 2012 Warsztaty z Nowoczesnej Matematyki i jej Zastosowań Kraków 23 — 24 listopada 2012 Kraków 23 — 24 November 2012 3 Contents 1 Introduction 5 1.1 Organizing Committee . 6 1.2 Scientific Committee . 6 2 List of Participants 7 3 Abstracts 11 3.1 On residually finite groups Orest D. Artemovych . 11 3.2 Some properties of Bernstein-Durrmeyer operators Magdalena Baczyńska . 12 3.3 Some Applications of Gröbner Bases Katarzyna Bolek . 14 3.4 Criteria for normality via C0-semigroups and moment sequences Dariusz Cichoń . 15 3.5 Picard–Fuchs operator for certain one parameter families of Calabi–Yau threefolds Sławomir Cynk . 16 3.6 Inference with Missing data Christiana Drake . 17 3.7 An outer measure on a commutative ring Dariusz Dudzik . 18 3.8 Resampling methods for weakly dependent sequences Elżbieta Gajecka-Mirek . 18 3.9 Graphs with path systems of length k in a hamiltonian cycle Grzegorz Gancarzewicz . 19 3.10 Hausdorff gaps and automorphisms of P(N)=fin Magdalena Grzech . 20 3.11 Functional Regression Models with Structured Penalties Jarosław Harezlak, Madan Kundu . 21 3.12 Approximation of function of two variables from exponential weight spaces Monika Herzog . 22 3.13 The existence of a weak solution of the semilinear first-order differential equation in a Banach space Mariusz Jużyniec . 25 3.14 Bayesian inference for cyclostationary time series Oskar Knapik . 26 4 Workshop on Modern Applied Mathematics PK 2012 3.15 Hausdorff limit in o-minimal structures Beata Kocel–Cynk . 27 3.16 Resampling methods for nonstationary time series Jacek Leśkow .
    [Show full text]
  • Projects and Publications of the Applied Mathematics Division
    NATIONAL BUREAU OF STANDARDS REPORT 4546 PROJECTS and PUBLICATIONS of the APPLIED MATHEMATICS DIVISION A Quarterly Report October through December 1 955 U. S. DEPARTMENT OF COMMERCE NATIONAL BUREAU OF STANDARDS FOR OFFICIAL DISTRIBUTION U. S. DEPARTMENT OF COMMERCE Sinclair Weeks, Secretary NATIONAL BUREAU OF STANDARDS A. V. Astin, Director THE NATIONAL BUREAU OF STANDARDS The 6cope of activities of the National Bureau of Standards is suggested in the following listing of the divisions and sections engaged in technical work. In general, each section is engaged in specialized research, development, and engineering in the field indicated by its title. A brief description of the activities, and of the resultant reports and publications, appears on the inside of the back cover of this report. Electricity and Electronics. Resistance and Reactance. Electron Tubes. Electrical Instru- ments. Magnetic Measurements. Process Technology. Engineering Electronics. Electronic Instrumentation. Electrochemistry. Optics and Metrology. Photometry and Colorimetry. Optical Instruments. Photographic Technology. Length. Engineering Metrology. Heat and Power. Temperature Measurements. Thermodynamics. Cryogenic Physics. Engines and Lubrication. Engine Fuels. Atomic and Radiation Physics. Spectroscopy. Radiometry. Mass Spectrometry. Solid State Physics. Electron Physics. Atomic Physics. Nuclear Physics. Radioactivity. X-rays. Betatron. Nucleonic Instrumentation. Radiological Equipment. AEC Radiation Instruments. Chemistry. Organic Coatings. Surface Chemistry. Organic
    [Show full text]
  • The Fact of Modern Mathematics: Geometry, Logic, and Concept Formation in Kant and Cassirer
    THE FACT OF MODERN MATHEMATICS: GEOMETRY, LOGIC, AND CONCEPT FORMATION IN KANT AND CASSIRER by Jeremy Heis B.A., Michigan State University, 1999 Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Pittsburgh 2007 UNIVERSITY OF PITTSBURGH COLLEGE OF ARTS AND SCIENCES This dissertation was presented by Jeremy Heis It was defended on September 5, 2007 and approved by Jeremy Avigad, Associate Professor, Philosophy, Carnegie Mellon University Stephen Engstrom, Associate Professor, Philosophy, University of Pittsburgh Anil Gupta, Distinguished Professor, Philosophy, University of Pittsburgh Kenneth Manders, Associate Professor, Philosophy, University of Pittsburgh Thomas Ricketts, Professor, Philosophy, University of Pittsburgh Dissertation Advisor: Mark Wilson, Professor, Philosophy, University of Pittsburgh ii Copyright © by Jeremy Heis 2007 iii THE FACT OF MODERN MATHEMATICS: GEOMETRY, LOGIC, AND CONCEPT FORMATION IN KANT AND CASSIRER Jeremy Heis, PhD University of Pittsburgh, 2007 It is now commonly accepted that any adequate history of late nineteenth and early twentieth century philosophy—and thus of the origins of analytic philosophy—must take seriously the role of Neo-Kantianism and Kant interpretation in the period. This dissertation is a contribution to our understanding of this interesting but poorly understood stage in the history of philosophy. Kant’s theory of the concepts, postulates, and proofs of geometry was informed by philosophical reflection on diagram-based geometry in the Greek synthetic tradition. However, even before the widespread acceptance of non-Euclidean geometry, the projective revolution in nineteenth century geometry eliminated diagrams from proofs and introduced “ideal” elements that could not be given a straightforward interpretation in empirical space.
    [Show full text]
  • Projects and Publications of the Applied Mathematics Division
    NATIONAL BUREAU OF STANDARDS REPORT 4658 PROJECTS and PUBLICATIONS of the APPLIED MATHEMATICS DIVISION A Quarterly Report January through March, 1956 U. S. DEPARTMENT OF COMMERCE NATIONAL BUREAU OF STANDARDS FOR OFFICIAL DISTRIBUTION U. S. DEPARTMENT OF COMMERCE Sinclair Weeks, Secretary NATIONAL BUREAU OF STANDARDS A. V. Astin, Director THE NATIONAL BUREAU OF STANDARDS The scope of activities of the National Bureau of Standards is suggested in the following listing of the divisions and sections engaged in technical work. In general, each section is engaged in specialized research, development, and engineering in the field indicated by its title. A brief description of the activities, and of the resultant reports and publications, appears on the inside of the back cover of this report. Electricity and Electronics. Resistance and Reactance. Electron Tubes. Electrical Instru- ments. Magnetic Measurements. Process Technology. Engineering Electronics. Electronic Instrumentation. Electrochemistry. Optics and Metrology. Photometry and Colorimetry. Optical Instruments. Photographic Technology. Length. Engineering Metrology. Heat and Power. Temperature Measurements. Thermodynamics. Cryogenic Physics. Engines and Lubrication. Engine Fuels. Atomic and Radiation Physics. Spectroscopy. Radiometry. Mass Spectrometry. Solid State Physics. Electron Physics. Atomic Physics. Nuclear Physics. Radioactivity. X-rays. Betatron. Nucleonic Instrumentation. Radiological Equipment. AEC Radiation Instruments. Chemistry. Organic Coatings. Surface Chemistry. Organic
    [Show full text]
  • Computer Experiments for Circle Packings on Surfaces
    Interdisciplinary Information Sciences, Vol. 9, No. 1, pp. 175–182 (2003) Computer Experiments for Circle Packings on Surfaces Shigeru MIZUSHIMA Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, O-okayama, Meguro, Tokyo 152-8552, Japan Received July 1, 2002; final version accepted January 31, 2003 Circle packings on surfaces with complex projective structures were investigated in the previous paper ‘‘Circle packings on surfaces with projective structures’’. This paper describes computer experiments performed in the process. KEYWORDS: circle packings, complex projective structures, computer experiments, visualization 1. Introduction An orientable closed surface Æg of genus g admits a spherical metric (g ¼ 0), a Euclidean metric (g ¼ 1)ora hyperbolic metric (g 2) according to its genus. Though the sphere admits the unique metric essentially, the space of Euclidean metrics on the torus and the space of hyperbolic metrics on a surface with genus higher than one are topologically cells of dimension 2 and 6g À 6 respectively. In spite of these plentifulness of metrics for g 1,the Andreev–Thurston theorem [1, 4] shows the uniqueness of the metric which admits a circle packing for each combinatorial type of a circle packing. In the previous paper [2], we started from the Andreev–Thurston theorem, let the metric structures relax into complex projective structures, and then deformed the structure admitting packing. The main result of the paper states that the space of deformations for packings with one circle is a cell of dimension 2 for g ¼ 1 and 6g À 6 for g 2. (Note that the dimension of the space of complex projective structures on a surface is 4 for g ¼ 1 and 12g À 12 for g 2.) In the process of the study, computer experiments were performed with some programs.
    [Show full text]
  • P</Emphasis>-Variation, Calculus, and Index Estimation
    Lithuanian Mathematical Journal, Vol. 46, No. 1, 2006 ROUGH FUNCTIONS: p-VARIATION, CALCULUS, AND INDEX ESTIMATION R. Norvaiša Institute of Mathematics and Informatics, Akademijos 4, LT-08663 Vilnius; Vilnius University, Naugarduko 24, LT-03225 Vilnius, Lithuania (e-mail: [email protected]) Abstract. In this paper, we give an overview of several dissipated results on the p-variation property of a function presented in a suitable way. More specifically, we attempt to show: (1) usefulness of this property in a calculus of rough functions; (2) a relatively thorough knowledge of the p-variation property of a sample function of basic stochastic processes; and (3) an almost unexplored area of statistical analysis seeking to estimate the p-variation index. Keywords: -variation, interval functions, refinement Young–Stieltjes integral, Kolmogorov integral, product integral, Nemyt- skii operator, integral equations, sample functions of stochastic processes, p-variation index, Orey index, oscillation summing index. 1. INTRODUCTION The p-variation is a generalization of the total variation of a function. More specifically, for 0 <p<∞ and −∞ <a<b<+∞,thep-variation of a real-valued function f on an interval [a,b] is vp(f ) := vp f ;[a,b] n p := sup f(ti) − f(ti−1) : a = t0 <t1 < ···<tn = b, n 1 . (1) i=1 We say that f has bounded p-variation if vp(f ) < ∞. Thus, a function has bounded total variation if it has bounded 1-variation. A regulated function f is called rough if it has infinite 1-variation, that is, if v1(f ) =+∞. The p-variation gives a convenient way to measure a degree of roughness.
    [Show full text]
  • Appendix Nonatomic Measure Spaces
    Appendix Nonatomic Measure Spaces In this appendix we collect some facts about finite measure spaces without (and with) atoms, which are applied in Chapter 7. Let (Ω, , µ) be a σ-finite measure space. Then an atom of µ is a set A with Sµ(A) > 0 such that for all C with C A, either µ(C) = 0 or µ(C∈) S = µ(A). By σ-finiteness, we have µ∈(A S) < + .(⊂Ω, , µ) or µ is called nonatomic if it has no atoms. ∞ S Proposition A.1. Let (Ω, , µ) be a nonatomic finite measure space with µ(Ω) > 0. Then for any cSwith 0 < c < µ(Ω), there is an A with µ(A) = c. ∈ S Proof. We can assume that µ(Ω) = 1. It will first be shown that for some C , 1/3 µ(C) 2/3. Suppose not. Let p := sup µ(B): µ(B) < 1/3 1/3.∈ SThen p≤ > 0 since≤Ω is not an atomand if 2/3 < µ({D) < 1, let B := Ω }D ≤. Take B with µ(B ) p. Let E := n B . It will be shown by induction\ n ∈ S n ↑ n j=1 j that µ(En) < 1/3 for all n. This is true for n = 1. Assuming it holds for a given n, we have µ(E ) = µ(E BS ) < (1/3)+(1/3) = 2/3. Thus by the n+1 n ∪ n+1 assumption that µ takes no values in [1/3, 2/3], µ(En+1) < 1/3, completing ∞ the induction. Let E := n=1 Bn.
    [Show full text]
  • Computing Aspects of Problems in Non.Linear
    COMPUTING ASPECTS OF PROBLEMS IN NON.LINEAR PREDICTION AND FILTERING by I. G. CUMMING A thesis submitted for the degree of Ph.D. in Engineering Centre for Computing and Automation, Imperial College, University of London, London, S.W.7. MAY 1967 _ 2 - ABSTRACT This thesis discusses some of the computational problems arising in the application of modern stochastic control theory. We deal with continuous time systems where two typical problems are the prediction of the future statistical behaviour of systems and the synthesis of systems designed from stochastic theory such as filters. In each case, computational problems occur if the system is non-linear or non-Gaussian. The non-linear prediction problem involves solving a parabolic partial differential equation, the Fokker-Planck equation, and we dis- cuss two numerical methods of solving this equation. Finding that these methods can only handle a restricted class of low-dimensional systems, we study Monte Carlo methods in the hopes of finding a more general solution procedure. We find these to be successful if we allow for accuracy limitations, and find that the theory of the Fokker- Planck equation can be extended to include the Monte Carlo solution of a wider class of parabolic equations than previous methods would accommodate. Monte Carlo methods involve the simulation of a stochastic system on a computer, and as the problem of synthesising a given system is the same as simulating it on a computer, the rest of the thesis centres around the theoretical and practical aspects of simulation techniques. We find in each case that the system we must simulate is a continuous Markov (diffusion) process, and that diffusion processes have properties which distinguish them from any process which can ,be constructed on a computer or in the physical world (we call these physical processes).
    [Show full text]
  • Geometry of the Mathieu Groups and Golay Codes
    Proc. Indian Acad. Sci. (Math. Sci.), Vol. 98, Nos 2 and 3, December 1988, pp. 153-177. 9 Printed in India. Geometry of the Mathieu groups and Golay codes ERIC A LORD Centre for Theoretical Studies and Department of Applied Mathematics, Indian Institute of Science, Bangalore 560012, India MS received 11 January 1988 Abstraet. A brief review is given of the linear fractional subgroups of the Mathieu groups. The main part of the paper then deals with the proj~x-~tiveinterpretation of the Golay codes; these codes are shown to describe Coxeter's configuration in PG(5, 3) and Todd's configuration in PG(11, 2) when interpreted projectively. We obtain two twelve-dimensional representations of M24. One is obtained as the coUineation group that permutes the twelve special points in PC,(11, 2); the other arises by interpreting geometrically the automorphism group of the binary Golay code. Both representations are reducible to eleven-dimensional representations of M24. Keywords. Geometry; Mathieu groups; Golay codes; Coxeter's configuration; hemi- icosahedron; octastigms; dodecastigms. 1. Introduction We shall first review some of the known properties of the Mathieu groups and their linear fractional subgroups. This is mainly a brief resum6 of the first two of Conway's 'Three Lectures on Exceptional Groups' [3] and will serve to establish the notation and underlying concepts of the subsequent sections. The six points of the projective line PL(5) can be labelled by the marks of GF(5) together with a sixth symbol oo defined to be the inverse of 0. The symbol set is f~ = {0 1 2 3 4 oo}.
    [Show full text]
  • Spanning Sets and Scattering Sets in Steiner Triple Systems
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMBINATORIAL THEORY, %XieS A 57, 4659 (1991) Spanning Sets and Scattering Sets in Steiner Triple Systems CHARLESJ. COLBOURN Department of Combinatorics and Optimization, University of Waterloo, Waterloo. Ontario, N2L 3G1, Canada JEFFREYH. DMTZ Department of Mathematics, University of Vermont, Burlington, Vermont 05405 AND DOUGLASR. STINSON Department of Computer Science, University of Manitoba, Winnipeg, Manitoba, R3T 2N2, Canada Communicated by the Managing Editors Received August 15, 1988 A spanning set in a Steiner triple system is a set of elements for which each element not in the spanning set appears in at least one triple with a pair of elements from the spanning set. A scattering set is a set of elements that is independent, and for which each element not in the scattering set is in at most one triple with a pair of elements from the scattering set. For each v = 1,3 (mod 6), we exhibit a Steiner triple system with a spanning set of minimum cardinality, and a Steiner triple system with a scattering set of maximum cardinality. In the process, we establish the existence of Steiner triple systems with complete arcs of the minimum possible cardinality. 0 1991 Academic Press, Inc. 1. BACKGROUND A Steiner triple system of order u, or STS(u), is a v-element set V, and a set g of 3-element subsets of V called triples, for which each pair of elements from V appears in precisely one triple of 9% For XG V, the spannedsetV(X)istheset {~EV\X:{~,~,~)E~,~,~EX}.A~~~XEV 46 0097-3165/91 $3.00 Copyright 0 1991 by Academic Press, Inc.
    [Show full text]
  • Probabilistic Combinatorics and the Recent Work of Peter Keevash
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 54, Number 1, January 2017, Pages 107–116 http://dx.doi.org/10.1090/bull/1553 Article electronically published on September 14, 2016 PROBABILISTIC COMBINATORICS AND THE RECENT WORK OF PETER KEEVASH W. T. GOWERS 1. The probabilistic method A graph is a collection of points, or vertices, some of which are joined together by edges. Graphs can be used to model a wide range of phenomena: whenever you have a set of objects such that any two may or may not be related in a certain way, then you have a graph. For example, the vertices could represent towns and the edges could represent roads from one town to another, or the vertices could represent people, with an edge joining two people if they know each other, or the vertices could represent countries, with an edge joining two countries if they border each other, or the vertices could represent websites, with edges representing links from one site to another (in this last case the edges have directions—a link is from one website to another—so the resulting mathematical structure is called a directed graph). Mathematically, a graph is a very simple object. It can be defined formally as simply a set V of vertices and a set E of unordered pairs of vertices from V .For example, if we take V = {1, 2, 3, 4} and E = {12, 23, 34, 14} (using ab as shorthand for {a, b}), then we obtain a graph known as the 4-cycle. Despite the simplicity and apparent lack of structure of a general graph, there turn out to be all sorts of interesting questions one can ask about them.
    [Show full text]