Algebra Seminar talk
2019-06-14
Bernhard Garn
Algebraic Modelling of Covering Arrays
Abstract:
In this talk, we are concerned with analyzing properties of
certain discrete structures appearing in combinatorial design theory
from an algebraic viewpoint. We present algebraic modellings,
characterizations and construction approaches for covering arrays,
based on a tuple-level modelling and using methods arising from linear
algebra, commutative algebra and symbolic computation. Concrete
instances of covering arrays for given parameters will arise as points
in a generated variety of a system of multivariate polynomial
equations with Gröbner Bases playing an important role. Finally, we
will showcase real-world applications of these structures in
combinatorial testing, a branch of software testing.