On rank 4 projective planes.
It is shown that the maximum size of a set of vectors of a -dimensional vector space over , with the property that every subset of size is a basis, is at most , if , and at most , if , where and is prime. Moreover, for , the sets of maximum size are classified, generalising Beniamino Segre’s “arc is a conic” theorem. These results have various implications. One such implication is that a matrix, with and entries from , has columns which are linearly dependent. Another is...
Let be a group endowed with a length function , and let be a linear subspace of . We say that satisfies the Haagerup inequality if there exists constants such that, for any , the convolutor norm of on is dominated by times the norm of . We show that, for , the Haagerup inequality can be expressed in terms of decay of random walks associated with finitely supported symmetric probability measures on . If is a word length function on a finitely generated group , we show that,...
We give an estimate for the number of closed loops of given length in the 1-skeleton of a thick euclidean building. This kind of estimate can be used to prove the (RD) property for the subspace of radial functions on groups, as shown in the paper by A. Valette [same issue].