Displaying 41 – 60 of 72

Showing per page

On sets of vectors of a finite vector space in which every subset of basis size is a basis

Simeon Ball (2012)

Journal of the European Mathematical Society

It is shown that the maximum size of a set S of vectors of a k -dimensional vector space over 𝔽 q , with the property that every subset of size k is a basis, is at most q + 1 , if k p , and at most q + k p , if q k p + 1 4 , where q = p k and p is prime. Moreover, for k p , the sets S 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 k × ( p + 2 ) matrix, with k p and entries from 𝔽 p , has k columns which are linearly dependent. Another is...

On the Haagerup inequality and groups acting on A ˜ n -buildings

Alain Valette (1997)

Annales de l'institut Fourier

Let Γ be a group endowed with a length function L , and let E be a linear subspace of C Γ . We say that E satisfies the Haagerup inequality if there exists constants C , s > 0 such that, for any f E , the convolutor norm of f on 2 ( Γ ) is dominated by C times the 2 norm of f ( 1 + L ) s . We show that, for E = C Γ , the Haagerup inequality can be expressed in terms of decay of random walks associated with finitely supported symmetric probability measures on Γ . If L is a word length function on a finitely generated group Γ , we show that,...

On the loop inequality for euclidean buildings

Jacek Świątkowski (1997)

Annales de l'institut Fourier

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 A ˜ n groups, as shown in the paper by A. Valette [same issue].

Currently displaying 41 – 60 of 72