Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they are in fact equivalent. The central concept in their work turned out to be the so called deviation...

After McCallum and Avis [4] showed that the convex hull of a simple polygon P with n vertices can be constructed in O(n) time, several authors [1,2,3] devised simplified algorithms for this problem. Graham and Yao [2] presented a particularly simple and elegant one. After finding two points of the convex hull, their algorithm generated all other hull vertices using only one stack for intermedia...

An element of a Coxeter group is fully commutative if any two of its reduced decompositions are related by a series of transpositions of adjacent commuting generators. An element of a Coxeter group is cyclically fully commutative if any of its cyclic shifts remains fully commutative. These elements were studied by Boothby et al. In particular the authors precisely identified the Coxeter groups ...

We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k ≥ 3. This is related to the recent conjecture of Diaconis and Graham. As an application, we also prove that the output of the product replacement algorithm (see [CLMNO]) in this case does not have a strong bias.

We study a finite-dimensional quotient of the Hecke algebra of type H n for general n, using a calculus of diagrams. This provides a basis of monomials in a certain set of generators. Using this, we prove a conjecture of C.K. Fan about the semisimplicity of the quotient algebra. We also discuss the cellular structure of the algebra, with certain restrictions on the ground ring. To appear in " M...

Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they are in fact equivalent. The central concept in their work turned out to be the so called deviation...

The problem of merging sorted lists in the least number of pairwise comparisons has been solved completely only for a few special cases. Graham and Karp [18] independently discovered that the tape merge algorithm is optimal in the worst case when the two lists have the same size. In the seminal papers, Stockmeyer and Yao [28], Murphy and Paull [25], and Christen [6] independently showed when th...

It is known that the solutions of pure classical 5D gravity with AdS 5 asymptotics can describe strongly coupled large N dynamics in a universal sector of 4D conformal gauge theories. We show that when the boundary metric is flat we can uniquely specify the solution by the boundary stress tensor. We also show that in the Fefferman-Graham coordinates all these solutions have an integer Taylor se...