Coordinate Deletion
Add to your list(s)
Download to your calendar using vCal
- Eero Räty (University of Cambridge)
- Thursday 14 March 2019, 14:30-15:30
- MR12.
If you have a question about this talk, please contact Andrew Thomason.
For a family A in {0,...,k}^n, its deletion shadow is the set obtained from A by
deleting from any of its vectors one coordinate. Given the size of A, how should
we
choose A to minimise its deletion shadow? And what happens if instead we may
delete
only a coordinate that is zero? We discuss these problems, and give an exact
solution
to the second problem.
This talk is part of the Combinatorics Seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|