Linear spanning sets for matrix spaces

Two character sets in finite linear spaces

A set of type (m, n) K is a set of points of a finite linear space with the property that each line of the linear space meets K in either m or n points. In this paper, sets of type (m,n) in finite linear spaces with constant point degree are studied, and some characterization results are given.

2 Linear Matrix Inequality Representation of Sets

This article concerns the question: which subsets of R can be represented with Linear Matrix Inequalities, LMIs? This gives some perspective on the scope and limitations of one of the most powerful techniques commonly used in control theory. Also before having much hope of representing engineering problems as LMIs by automatic methods one needs a good idea of which problems can and cannot be re...

2 Linear Matrix Inequality Representation of Sets

Using Spanning Sets for Coverage Testing

A test coverage criterion defines a set Ec of entities of the program flowgraph and requires that every entity in this set is covered under some test case. Coverage criteria are also used to measure the adequacy of the executed test cases. In this paper, we introduce the notion of spanning sets of entities for coverage testing. A spanning set is a minimum subset of Ec, such that a test suite co...

Convex Sets and Convex Combinations on Complex Linear Spaces

Let V be a non empty zero structure. An element of Cthe carrier of V is said to be a C-linear combination of V if: (Def. 1) There exists a finite subset T of V such that for every element v of V such that v / ∈ T holds it(v) = 0. Let V be a non empty additive loop structure and let L be an element of Cthe carrier of V . The support of L yielding a subset of V is defined by: (Def. 2) The support...