Дискретная математика
Математика
  • формат djvu
  • размер 4.24 МБ
  • добавлен 28 октября 2011 г.
Kahane J.-P. Some Random Series of Functions
Издательство Cambridge University Press, 1994, -315 pp.

The origin of this book, whose first edition was published in 1968, is a series of notes by Paley and Zygmund that appeared in the 1930s, entitled 'On some series of functions' [167]. Paley and Zygmund, with the collaboration of Wiener in a subsequent paper, studied Fourier or Taylor series whose coefficients are independent random variables.
Applying random methods to harmonic analysis is an old idea, and it was the first aim of my book in 1968. In many circumstances it is hard or even impossible to find a mathematical object with some prescribed properties, and pretty easy to exhibit a random object which enjoys these properties almost surely. The classical example of this situation is the following theorem: no better condition than Riesz Fischer's, bearing on the absolute values of the coefficients of a trigonometric series, can ensure that it is a Fourier Lebesgue series.
A most beautiful example is the Pisier algebra, which solves completely an old problem of Y. Katznelson of finding a homogeneous Banach algebra of continuous functions on the circle, with the condition that not all continuous functions operate in this algebra, and not only analytic functions. There have been some difficult constructions due to M. Zafran. Pisier's solution is the algebra of continuous functions such that, changing signs randomly in their Fourier series, the resulting series represents almost surely a continuous function.
From the random point of view it often happens that the strange becomes natural (like a nowhere differentiable function, an almost every- where divergent series, a set of multiplicity which is independent over the rationals, and so on). That proves especially true in the kind of geometrical figures that B. Mandelbrot called fractals. Sets uncovered by random intervals, images of a given set by a random process, level sets of a random function or random field, were already studied in my book in 1968, with the help of some elementary Fourier analysis. I am doing a little more in the present edition, and I devote one chapter to an introduction to the geometrical part of the book. I have replaced the chapter on covering the circle by random arcs by an exposition of the work ofL. Shepp (a necessary and sufficient condition for random covering) and of the several dimensional situation (including E1 Helou's method). I describe Gaussian processes with stationary increments as helices in a Gaussian Hilbert space, and study the sample functions- mainly the sample functions of Brownian motion- in more detail. The last chapters show the interplay between Hausdorff dimensions, Lipschitz or Holder conditions, Gaussian processes, images, graphs, level sets, Fourier properties of measures. As a rough idea random sets obtained in this way fill the space as much as they can, and the spectra of random measures are smooth. Salem sets look very natural from this point of view.
A few tools from probability theory.
Random series in a Banach space.
Random series in a Hilbert space.
Random Taylor series.
Random Fourier series.
A bound for random trigonometric polynomials and applications.
Conditions on coefficients for regularity.
Conditions on coefficients for irregularity.
Random point-masses on the circle.
A few geometric notions.
Random translates and covering.
Gaussian variables and Gaussian series.
Gaussian Taylor series.
Gaussian Fourier series.
Boundedness and continuity for Gaussian processes.
The Brownian motion.
Brownian images in harmonic analysis.
Fractional Brownian images and level sets.
Похожие разделы
Смотрите также

Bela Bollobas. Random Graphs

  • формат pdf
  • размер 17.97 МБ
  • добавлен 09 октября 2011 г.
This is a new edition of the now classic text. The already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents an up-to-date and comprehensive account of random graph theory. The theory estimates the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applica...

Chung F.R.K. Lectures on Spectral Graph Theory

  • формат pdf
  • размер 190.11 КБ
  • добавлен 01 декабря 2011 г.
Eigenvalues and the Laplacian of a graph. The Laplacian and eigenvalues. Basic facts about the spectrum of a graph. Eigenvalues of weighted graphs. Eigenvalues and random walks. Isoperimetric problems. History. The Cheeger constant of a graph. The edge expansion of a graph. The vertex expansion of a graph. A characterization of the Cheeger constant. Isoperimetric inequalities for cartesian products. Diameters and eigenvalues. The diameter of a gr...

Kisacanin B. Mathematical Problems and Proofs: Combinatorics, Number Theory, and Geometry

  • формат djvu
  • размер 1.31 МБ
  • добавлен 31 января 2012 г.
Kluwer Academic Publishers, 2002. - 220 pages. Key to Symbols. Set Theory. Sets and Elementary Set Operations. Cartesian Product and Relations. Functions and Operations. Cardinality. Problems. Combinatorics. Four Enumeration Principles. Introductory Problems. Basic Definitions. Generating Functions. Problems. Number Theory. Divisibility of Numbers. Important Functions in Number Theory. Congruences. Diophantine Equations. Problems. Geometry. Prope...

Lamagna E.A. The Complexity of Monotone Functions

Дисертация
  • формат pdf
  • размер 1.24 МБ
  • добавлен 15 декабря 2011 г.
Диссертация, Brown University, 1975, -110 pp. An important open question in the field of computational complexity is the development of nontrivial lower bounds on the number of logical operations required to compute switching functions. Two important measures of functional complexity are combinational complexity, corresponding to the minimal number of operations in any computational chain (straight-line algorithm or feedback-free network) for th...

Lov?sz L. Combinatorial Problems and Exercises

  • формат djvu
  • размер 3.82 МБ
  • добавлен 04 октября 2011 г.
Издательство North-Holland, 1993, -630 pp. When the publishers of this book asked me to revise and update my problem book for a second edition, I had to decide how much to change, taking into consideration the fast development of the field (but also that the first edition was out of print). Combinatorics has grown a lot in the last decade, especially in those fields interacting with other branches of mathematics, like polyhedral combinatorics,...

Moon J.W. Counting Labelled Trees

  • формат djvu
  • размер 678.04 КБ
  • добавлен 28 октября 2011 г.
Canadian Mathematical Monographs, 1970, -121 pp. My object has been to gather together various combinatorial results on labelled trees. The basic definitions are given in the first chapter; enumerative results are presented in the next five chapters, classified according to the type of argument involved; some probabilistic problems on random trees are treated in the last chapter. Some familiarity with matrices and generating functions is presupp...

Nijenhuis A., Wilf H.S. Combinatorial Algorithms for Computers and Calculators

  • формат pdf
  • размер 5.37 МБ
  • добавлен 04 октября 2011 г.
Издательство Academic Press, 1978, -316 pp. Описан набор эффективных по скорости и памяти комбинаторных алгоритмов. Содержит подробное описание алгоритмов и код на Фортране. Combinatorial families. Next Subset of an n-Set. Random Subset of an n-Set. Next k-Subset of an n-Set. Random k-Subset of an n-Set. Next Composition of n into k Parts. Random Composition of n into k Parts. Next Permutation of n Letters. Random Permutation of n Letters. Next P...

Stanley R.P. Enumerative Combinatorics. Volume 2

  • формат djvu
  • размер 5.23 МБ
  • добавлен 04 октября 2011 г.
Издательство Cambridge University Press, 1999, -595 pp. This is the second of a two-volume basic introduction to enumerative combinatorics at a level suitable for graduate students and research mathematicians. This volume covers the composition of generating functions, trees, algebraic generating functions, D-finite generating functions, noncommutative generating functions, and symmetric functions. The chapter on symmetric functions provides the...

Wegener I. The Complexity of Boolean Functions

  • формат pdf
  • размер 1.88 МБ
  • добавлен 11 мая 2011 г.
Wegener I. The Complexity of Boolean Functions. (Wiley-Teubner series in computer science). John Wiley & Sons Ltd, and B. G. Teubner, Stuttgart, 1987. Различные аспекты теории сложности: булевы функции, схемы, формулы, программы итд. Булевы функции и схемы. Минимизация булевых функций. Разработка эффективных схем для некоторых важных функций. Асимптотики и универсальные схемы. Нижние границы сложности схем. Монотонные схемы. Связь между сложн...

Wilf H.S. Generatingfunctionology

  • формат pdf
  • размер 1.54 МБ
  • добавлен 03 июля 2011 г.
A K Peters, 2006. - 245 pages. Generating functions, one of the most important tools in enumerative combinatorics, are a bridge between discrete mathematics and continuous analysis. Generating functions have numerous applications in mathematics, especially in. * Combinatorics. * Probability Theory. * Statistics. * Theory of Markov Chains. * Number Theory. One of the most important and relevant recent applications of combinatorics lies in th...