EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 34

Ramanujan grammar and Cayley trees. (Grammaire de Ramanujan et arbres de Cayley.)

Dumont, Dominique, Ramamonjisoa, Armand (1996)

The Electronic Journal of Combinatorics [electronic only]

Ramified Sets Of Pseudotrees

Đuro Kurepa (1977)

Publications de l'Institut Mathématique

Ramified sets or pseudotrees.

D. Kurepa (1977)

Publications de l'Institut Mathématique [Elektronische Ressource]

Ramsey numbers for trees II

Zhi-Hong Sun (2021)

Czechoslovak Mathematical Journal

Let $r (G_{1}, G_{2})$ be the Ramsey number of the two graphs $G_{1}$ and $G_{2}$ . For $n_{1} \geq n_{2} \geq 1$ let $S (n_{1}, n_{2})$ be the double star given by $V (S (n_{1}, n_{2})) = {v_{0}, v_{1}, ..., v_{n_{1}}, w_{0}$ , $w_{1}, ..., w_{n_{2}}}$ and $E (S (n_{1}, n_{2})) = {v_{0} v_{1}, ..., v_{0} v_{n_{1}}, v_{0} w_{0}, w_{0} w_{1}, ..., w_{0} w_{n_{2}}}$ . We determine $r (K_{1, m - 1},$ $S (n_{1}, ...$

Ramsey-type theorems

Gavalec, Martin, Vojtáš, Peter (1980) Abstracta. 8th Winter School on Abstract Analysis

Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.

Pitman, Jim (2001) Séminaire Lotharingien de Combinatoire [electronic only]

Random Packings and Coverings in Random Trees

A. MEIR, J.W. MOON (1973) Aequationes mathematicae

Random recursive trees and the Bolthausen-Sznitman coalescent.

Goldschmidt, Christina, Martin, James B. (2005) Electronic Journal of Probability [electronic only]

Random trees and applications.

Le Gall, Jean-François (2005) Probability Surveys [electronic only]

Random Walks on Amalgams.

Wolfgang Woess, Massimo Picardello (1985) Monatshefte für Mathematik

Random walks on the affine group of local fields and of homogeneous trees

Donald I. Cartwright, Vadim A. Kaimanovich, Wolfgang Woess (1994) Annales de l'institut Fourier

The affine group of a local field acts on the tree

𝕋 (𝔉)

(the Bruhat-Tits building of

GL (2, 𝔉)

) with a fixed point in the space of ends

\partial 𝕋 (F)

. More generally, we define the affine group

Aff (𝔉)

of any homogeneous tree

𝕋

as the group of all automorphisms of

𝕋

with a common fixed point in

\partial 𝕋

, and establish main asymptotic properties of random products in

Aff (𝔉)

: (1) law of large numbers and central limit theorem; (2) convergence to

\partial 𝕋

and solvability of the Dirichlet problem at infinity; (3) identification of the Poisson boundary...

Rank decomposition in zero pattern matrix algebras

Harm Bart, Torsten Ehrhardt, Bernd Silbermann (2016)

Czechoslovak Mathematical Journal

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...

Currently displaying 1 – 20 of 34

Page 1 Next

Displaying 1 – 20 of 34

Ramanujan grammar and Cayley trees. (Grammaire de Ramanujan et arbres de Cayley.)

Ramified Sets Of Pseudotrees

Ramified sets or pseudotrees.

Ramsey numbers for trees II

Ramsey-type theorems

Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.

Random Packings and Coverings in Random Trees

Random recursive trees and the Bolthausen-Sznitman coalescent.

Random trees and applications.

Random Walks on Amalgams.

Random walks on the affine group of local fields and of homogeneous trees

Rank decomposition in zero pattern matrix algebras

Ranking and unranking of a generalized Dyck language and the application to the generation of random trees.

Reconstructing 1-coherent locally finite trees.

Reconstruction of a tree from certain maximal proper subtrees

Rectangle-visibility layouts of unions and products of trees.

Rectilinear spanning trees versus bounding boxes.

Récurrence des librairies sur un arbre

Recurrent and transient trees. (Rekurrente und transiente Bäume.)

Recursive generation of $k$ -ary trees.

Currently displaying 1 – 20 of 34