6 search results - page 1 / 2 » Some Indecomposable t-Designs |
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
The existence of large sets of 5-(14,6,3) designs is in doubt. There are five simple 5-(14,6,6) designs known in the literature. In this note, by the use of a computer program, we...
JCT
2011
12 years 11 months ago
2011
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
DCG
2008
13 years 4 months ago
2008
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
LOGCOM
2006
13 years 4 months ago
2006
Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
DAGSTUHL
2007
13 years 6 months ago
2007
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...