Given a finite set P ⊆ R d, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in R d. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n

Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. Wegivetheexactvalueof tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) =n − mr

Abstract. A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, we prove that the maximum number of cliques in a planar graph with n vertices is 8(n − 2). 1.

bulletin board ref.: gr-qc/9409028 It is shown that N 2 is the upper limit for the number of histories in a decohering family of N-state quantum system. Simple criterion is found for a family of N 2 fine grained decohering histories of Gell-Mann and Hartle to be identical with a family of Griffiths

Through handson exploration, participants will discover different types of animal signs that are used to learn about and track animals big and small.

Abstract not found

" sections of the Wall Street Journal tree- bank. This represents a 13% decrease in error rate over the best single-parser results on this corpus [9]. The major technical innova- tion is the use of a "maximum-entropy-inspired" model for conditioning and smoothing that let us successfully to test

Status of this Memo

The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we

Abstract. Let A be an m×n, (0, 1)-matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)-matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal