Subscribe by RSS

In the second part of the talk, if time permits, we will discuss one reason why it is so hard to construct large caps. For this we present parameter restrictions on approximately strongly regular graphs. This is joint work with Jacques Verstraëte.

# Department Colloquium

**
Fri., Jun. 3, 2022 3:30 p.m.
**

**
Location: RI 208
**

**Speaker:** Ferdinand Ihringer, Ghent University

**Title: **Caps and Probabilistic Methods (505 kB)

**Abstract: **

*n,q*) with no three collinear is called a cap. More generally, a set of points in PG(*n,q*) such that no s-space contains more than r points is called an (*r,s*;*n,q*)-set. In the first (and main) part of the talk we will discuss probabilisitic approaches to this classical problem.In the second part of the talk, if time permits, we will discuss one reason why it is so hard to construct large caps. For this we present parameter restrictions on approximately strongly regular graphs. This is joint work with Jacques Verstraëte.