- UNSW
- ...
- Our schools
- Mathematics & Statistics
- Engage with us
- Seminars
- 2017
- A semi-random construction of small covering arrays
Science
Mathematics and Statistics
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
- Undergraduate
- Honours year
- Postgraduate coursework
-
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
-
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Student societies
- Student noticeboard
- Casual tutors
- Engage with us
- News & events
- Contact
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Engage with us
- News & events
- Contact
Abstract:
Given a set SS of v≥2v≥2 symbols, and integers k≥t≥2k≥t≥2 and N≥1N≥1, an N×kN×k array A∈SN×kA∈SN×k is an (N;t,k,v)(N;t,k,v)-covering array if all sequences in StSt appear as rows in every N×tN×t subarray of AA.
These arrays have a wide variety of applications, driving the search for small covering arrays. The covering array number, CAN(t,k,v)(t,k,v), is the smallest NN for which an (N;t,k,v)(N;t,k,v)-covering array exists. In this talk we shall combine probabilistic and algebraic arguments to construct small covering arrays, improving the bounds on CAN(t,k,v)CAN(t,k,v).
Speaker
Tamás Mészáros
Research Area
Combinatronics Seminar
Affiliation
Freie Universität Berlin
Date
Mon, 11/12/2017 - 11:00am
Venue
RC-4082, The Red Centre, UNSW