In this review paper we consider the polynuclear growth (PNG) model in one spatial dimension and its relation to random matrix ensembles. For curved and flat growth the scaling functions of the surface fluctuations coincide with limit distribution functions coming from certain Gaussian ensembles of random matrices. This connection can be explained via point processes associated to the PNG model...

In recent work of Baik, Deift and Rains convergence of moments was established for the limiting joint distribution of the lengths of the first k rows in random Young tableaux. The main difficulty was obtaining a good estimate for the tail of the distribution and this was accomplished through a highly nontrival Riemann-Hilbert analysis. Here we give a simpler derivation. The same method is used ...

Consider a large number n of neurons, each being connected to approximately N other ones, chosen at random. When a neuron spikes, which occurs randomly at some rate depending on its electric potential, its potential is set to a minimum value vmin, and this initiates, after a small delay, two fronts on the (linear) dendrites of all the neurons to which it is connected. Fronts move at constant sp...

The purpose of this dissertation is to study certain classes of permutations and plane partitions of truncated shapes. We establish some of their enumerative and combinatorial properties. The proofs develop methods and interpretations within various fields of algebraic combinatorics, most notably the theory of symmetric functions and their combinatorial properties. The first chapter of this the...

In this paper, we construct a data structure using a forest of redblack trees to efficiently compute the longest increasing subsequence of a dynamically updated sequence. Our data structure supports a query for the longest increasing subsequence in O(r + logn) worst case time and supports inserts anywhere in the sequence in O (r logn/r) worst case time, where r is the length of the longest incr...

Given a random permutation of the numbers 1, 2, . . . . n, let L, be the length of the longest descending subsequence of this permutation. Let F, be the minimal header (first element) of the descending subsequences having maximal length. It is known that EL,/&,,,, c and that c=2. However, the proofs that r=2 are far from elementary and involve limit processes. Several relationships between thes...

BACKGROUND AND OBJECTIVES In this study we examined whether prestorage leucocyte reduction prevents the accumulation of bioreactive substances in red cell units. MATERIALS AND METHODS Measurements were performed in the supernatants of buffy-coat-depleted (standard red cells) and leucocyte-reduced (filtered red cells) red cell units. The effect of storage was evaluated by taking repetitive sam...

We investigate partitioning of integer sequences into heapable subsequences (previously defined and established by Mitzenmacher et al. [BHMZ11]). We show that an extension of patience sorting computes the decomposition into a minimal number of heapable subsequences (MHS). We connect this parameter to an interactive particle system, a multiset extension of Hammersley’s process, and investigate i...