Using multilinear functions and random procedures, new upper bounds on the domination number of a bipartite graph in terms of the cardinalities and the minimum degrees of the two colour classes are established.
In this paper we study a random walk on an affine building of type Ãr, whose radial part, when suitably normalized, converges toward the brownian motion of the Weyl chamber. This gives a new discrete approximation of this process, alternative to the one of Biane (Probab. Theory Related Fields89 (1991) 117–129). This extends also the link at the probabilistic level between riemannian symmetric spaces of the noncompact type and their discrete counterpart, which had been previously discovered by Bougerol...
The affine group of a local field acts on the tree (the Bruhat-Tits building of ) with a fixed point in the space of ends . More generally, we define the affine group of any homogeneous tree as the group of all automorphisms of with a common fixed point in , and establish main asymptotic properties of random products in : (1) law of large numbers and central limit theorem; (2) convergence to and solvability of the Dirichlet problem at infinity; (3) identification of the Poisson boundary...
For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H. Bart, A. P. M. Wagelmans (2000). The proof involves elements from integer programming and employs Farkas' lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred...
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others the rank...