Factorizations of symmetric designs
نویسندگان
چکیده
منابع مشابه
Computing Symmetric Nonnegative Rank Factorizations
An algorithm is described for the nonnegative rank factorization (NRF) of some completely positive (CP) matrices whose rank is equal to their CP-rank. The algorithm can compute the symmetric NRF of any nonnegative symmetric rank-r matrix that contains a diagonal principal submatrix of that rank and size with leading cost O(rm) operations in the dense case. The algorithm is based on geometric co...
متن کاملCholesky-like Factorizations of Skew-symmetric Matrices
As will be shown in this paper, there always exists an R such that (1.1) holds. We present a stable O(n3) algorithm that computes an R that has the form of a permuted triangular matrix. Our motivation comes from eigenvalue problems with Hamiltonian structure. A matrix H ∈ R is said to be Hamiltonian if (JH) = JH and skew-Hamiltonian if (JH) = −JH . EXAMPLE 1. The study of corner singularities i...
متن کاملDistorting symmetric designs
A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given automorphism group, to study GMW-designs, and to construct new affine designs whose automorphism group fixes a point and has just two pointand block-orbits.
متن کاملHalf-regular symmetric designs
This paper is of an investigation of symmetric 2 (v, k,'x) designs such that the point set and the block set can each be halved to give a tactical decomposition. We assume that there is a group of automorphisms of the design of order v /2 which has two orbits of points, each of length v /2. Only the identity fixes a point, and we say that such a group acts half-regularly on the design. The desi...
متن کاملDecomposable symmetric designs
The first infinite families of symmetric designswere obtained fromfinite projective geometries, Hadamardmatrices, and difference sets. In this paper we describe two general methods of constructing symmetric designs that give rise to the parameters of all other known infinite families of symmetric designs. The method of global decomposition produces an incidence matrix of a symmetric design as a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1988
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90059-3