Consider a sequence of partial sums S i = ξ 1 + · · · + ξ i , 1 ≤ i ≤ n, starting at S 0 = 0, whose increments ξ 1 , . . . , ξ n are random vectors in R d , d ≤ n. We are interested in the properties of the convex hull C n := Conv(S 0 , S 1 , . . . , S n ). Assuming that the tuple (ξ 1 , . . . , ξ n ) is exchangeable and a certain general position condition holds, we prove that the expected number of k-dimensional faces of C n is given by the formulawhere n m and n m are Stirling numbers of the first and second kind, respectively.Further, we compute explicitly the probability that for given indices 0 ≤ i 1 < · · · < i k+1 ≤ n, the points S i1 , . . . , S i k+1 form a k-dimensional face of Conv(S 0 , S 1 , . . . , S n ). This is done in two different settings: for random walks with symmetrically exchangeable increments and for random bridges with exchangeable increments. These results generalize the classical one-dimensional discrete arcsine law for the position of the maximum due to E. Sparre Andersen. All our formulae are distribution-free, that is do not depend on the distribution of the increments ξ k 's.The main ingredient in the proof is the computation of the probability that the origin is absorbed by a joint convex hull of several random walks and bridges whose increments are invariant with respect to the action of direct product of finitely many reflection groups of types A n−1 and B n . This probability, in turn, is related to the number of Weyl chambers of a product-type reflection group that are intersected by a linear subspace in general position.2010 Mathematics Subject Classification. Primary: 52A22, 60D05, 60G50; secondary: 60G09, 52C35, 20F55, 52B11, 60G70.