Titlebook: Discrete Probability and Algorithms; David Aldous,Persi Diaconis,J. Michael Steele Conference proceedings 1995 Springer Science+Business M

通情達(dá)理

M. V. Braimbridge,B. A. Ross,M. DaviesLet . denote the set of positive integers. A set .?. is called a . if the sums . + . (.?.) are all distinct. For background on Sidon sets, we refer to [6]. For additional recent results see [2], [3]. In this paper we are interested in infinite Sidon sets, thus for the rest of the discussion all Sidon sets are infinite unless, otherwise specified.

oxidant

Indurate

鬼魂

Sidon Sets with Small Gaps,Let . denote the set of positive integers. A set .?. is called a . if the sums . + . (.?.) are all distinct. For background on Sidon sets, we refer to [6]. For additional recent results see [2], [3]. In this paper we are interested in infinite Sidon sets, thus for the rest of the discussion all Sidon sets are infinite unless, otherwise specified.

ATRIA

acolyte

Expressly

Gerrit Krupski-Berdien MD,Volkmar Nicolas MD resolve issues in theoretical computer science. This paper presents three examples which are used to illustrate both parts: a Markov chain algorithm for estimating the tails of the bootstrap also illustrates the Jerrum-Sinclair theory of approximate counting. The Geyer-Thompson work on Monte-Carlo

Landlocked

https://doi.org/10.1007/978-1-4613-4283-0r the transition probabilities and stationary distribution of the permutation chain. The spectral structure of the chain is presented explicitly. Bounds on the discrepancy from stationarity for the permutation chain are computed in terms of the corresponding discrepancy for the request chain, both f

allude

Dorsal

Victor H. Frankel,James W. Pughudorandom sequences as well as deterministic ones. Although most attention is given to previously published research, some new proofs and new results are given. In particular, some new phenomena are demonstrated for the monotonic subsequences of . of sequences. A number of open problems from the lit