Finite row-column exchangeable arrays.

Bassan, Bruno; Scarsini, Marco

Displaying similar documents to “Finite row-column exchangeable arrays.”

Finite row-column exchangeable arrays

Bruno Bassan, Marco Scarsini (1998)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We generalize well known results about the extendibility of finite exchangeable sequences and provide necessary conditions for finite and infinite extendibility of a finite row-column exchangeable array. These conditions depend in a simple way on the correlation matrix of the array.

Generating functions for the number of permutations with limited displacement.

Kløve, Torleiv (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Some statistical aspects of the estimation of parameters of a linear conform transformation

Lubomír Kubáček (1970)

Aplikace matematiky

Similarity:

The Definition of Finite Sequences and Matrices of Probability, and Addition of Matrices of Real Elements

Bo Zhang, Yatsuka Nakamura (2006)

Formalized Mathematics

Similarity:

In this article, we first define finite sequences of probability distribution and matrices of joint probability and conditional probability. We discuss also the concept of marginal probability. Further, we describe some theorems of matrices of real elements including quadratic form.

Regression model with estimated covariance matrix

Lubomír Kubáček (1983)

Mathematica Slovaca

Similarity:

Wigner theorems for random matrices with dependent entries: ensembles associated to symmetric spaces and sample covariance matrices.

Hofmann-Credner, Katrin, Stolz, Michael (2008)

Electronic Communications in Probability [electronic only]

Similarity:

The random paving property for uniformly bounded matrices

Joel A. Tropp (2008)

Studia Mathematica

Similarity:

This note presents a new proof of an important result due to Bourgain and Tzafriri that provides a partial solution to the Kadison-Singer problem. The result shows that every unit-norm matrix whose entries are relatively small in comparison with its dimension can be paved by a partition of constant size. That is, the coordinates can be partitioned into a constant number of blocks so that the restriction of the matrix to each block of coordinates has norm less than one half. The original...

Indecomposable (1,3)-groups and a matrix problem

David M. Arnold, Adolf Mader, Otto Mutzbauer, Ebru Solak (2013)

Czechoslovak Mathematical Journal

Similarity:

Almost completely decomposable groups with a critical typeset of type $(1, 3)$ and a $p$ -primary regulator quotient are studied. It is shown that there are, depending on the exponent of the regulator quotient $p^{k}$ , either no indecomposables if $k \leq 2$ ; only six near isomorphism types of indecomposables if $k = 3$ ; and indecomposables of arbitrary large rank if $k \geq 4$ .