Probabilistic Methods in Discrete Mathematics, Volume 5 Probabilistic Methods in Discrete Mathematics: Proceedings of the Fifth International Petrozavodsk Conference, Petrozavodsk, Russia, June 1-6, 2000

01/07 This title is now available from Walter de Gruyter. Please see www.degruyter.com for more information. This proceedings volume contains the plenary lectures and selected contributed papers which were given at the Fifth International Petrozavodsk Conference on Probabilistic Methods in Discrete Mathematics, 1-6 June 2000, Petrozavodsk, Russia. The themes of the conference covered almost all areas of discrete mathematics, such as probabilistic problems of combinatorics, statistical problems of discrete mathematics, theory of random graphs, systems of random equations in finite fields, and questions on information security. A considerable part of the lectures dealt with game theory and mathematical statistics. The papers presented in this volume reflect the current state-of-the-art in probabilistics discrete mathematics and contain information of value and interest to those who are working in theoretical and applied areas of discrete mathematics.

Table of Contents:
Injective mappings of words which do not multiply symbol skip and insertion errors, M.M. Glukhov; models for computer security, D. Bogdanovich, A.A. Grusho and E.E. Timonina; probability distributions of the number of configurations and discordances of random permutations from regular cyclic classes, V.N. Sachkov; equilibrium in an arbitration game, V.V. Mazalov, A.A. Zabelin and A.S. Karpin; dynamic games with random duration and uncertain payoffs, L.A. Petrosyan, M. Kultina and D. Yeung; on stopping games when more than one stop is possible, K. Szajowski; local structure of a random polynomial over finite field, G.I. Ivchenko and Yu.I. Medvedev; Galton-Watson forests, Yu.L. Pavlov and I.A. Cheplyukova; on the existence of a giant component in schemes of allocating particles, V.F. Kolchin; statistical estimation of distributions of sampling characteristics in the case of gamma families, R.A. Abusev; on estimation and group classification in the space of a sufficient statistic of the negative binomial distribution, R.A. Abusev and N.V. Kolegova; on the representation of bent functions by bent rectangles, S.V. Agievich; on destruction of a lattice in local limit theorems, T.A. Azlarov and D.V. Akimov; isoperiods of output sequences of automata, A.V . Babash; on joint application of statistical tests, S.P. Chistyakov; Chebyshev systems and generalised convex games versus nature, A.Yu. Golubin; on the necessary number of observations needed for unique detection of insertions in the multinomial scheme, A.V. Ivanov; local limit theorems for an array scheme and Galton-Watson forests, N.I. Karov; asymptotic behaviour of the waiting times in schemes of allocating particles in groups of random sizes, E.R. Khakimullin and N.Yu. Enatskaya; random partitions and their applications, K.N. Khovanov, V.V. Kornikov, I.A. Seregin and N.V. Khovanov; random partitions of a set and the generalised allocation scheme, A.V. Kolchin; on a problem of A.N. Kolmogorov, M.M. Leri; estimation of stochastic dependence and testing for the N-dimensional uniformity by sample characteristic functions, A.V. Martinevskii and Yu.S. Kharin; cyclotomic integers and discrete logarithms in GF(p2), D.V. Matyukhin; limit distribution of the number of leaves of a Galton-Watson forest, T.B. Myllari; the Bayes risk asymptotics under testing composite hypotheses on Markov chains, A.V. Nagaev. (Part contents).