AbstractWe state and prove two rather direct linear algebra results and show how they are the basis for many combinatorial devices for determining the dual structure of combinatorial designs. Applications to tactical decompositions and partial geometric designs are also included
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
In this thesis we comment on six papers, three from matroid theory and three from cooperative game t...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractWe state and prove two rather direct linear algebra results and show how they are the basis ...
AbstractA theorem of the second author is used to strengthen, generalize and shorten the proofs of s...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractThere are several examples in linear algebra and number theory of theorems which are formall...
AbstractA duality theory for algebraic linear (integer) programming (ALP) is developed which is of t...
We apply duality in the Johnson scheme J(v, k) to give a very short proof of a theorem of Frankl and...
AbstractIn this paper we provide a new approach to some of the applications of linear algebra in Com...
Combinatorial design theory is a source of simply stated, concrete, yet difficult discrete problems,...
AbstractWe present a notion of abstract duality that provides a common characterization of several c...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
A multiplicative design is a square design (that is, a set S of n elements called varieties, and a c...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
In this thesis we comment on six papers, three from matroid theory and three from cooperative game t...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractWe state and prove two rather direct linear algebra results and show how they are the basis ...
AbstractA theorem of the second author is used to strengthen, generalize and shorten the proofs of s...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
AbstractThere are several examples in linear algebra and number theory of theorems which are formall...
AbstractA duality theory for algebraic linear (integer) programming (ALP) is developed which is of t...
We apply duality in the Johnson scheme J(v, k) to give a very short proof of a theorem of Frankl and...
AbstractIn this paper we provide a new approach to some of the applications of linear algebra in Com...
Combinatorial design theory is a source of simply stated, concrete, yet difficult discrete problems,...
AbstractWe present a notion of abstract duality that provides a common characterization of several c...
In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two dist...
AbstractA convex quadratic program has Kuhn-Tucker conditions which are necessary and sufficient, an...
A multiplicative design is a square design (that is, a set S of n elements called varieties, and a c...
AbstractA λ-design is a square (0, 1)-matrix in which the inner product of any two distinct columns ...
In this thesis we comment on six papers, three from matroid theory and three from cooperative game t...
AbstractSeveral combinatorial structures exhibit a duality relation that yields interesting theorems...
DOI
Add to ORKG