Michael Braun

activity

20122021

most citedUpdate: Some new results on lower bounds on

(n, r)

-arcs in

P G (2, q)

for

q \leq 31

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021★ 1 cited

Update: Some new results on lower bounds on $(n, r)$ -arcs in $P G (2, q)$ for $q \leq 31$

Michael Braun

An $(n, r)$ -arc in $P G (2, q)$ is a set $B$ of points in $P G (2, q)$ such that each line in $P G (2, q)$ contains at most $r$ elements of $B$ and such that there is at least one line conta…

math.CO2018

New lower bounds on the size of (n,r)-arcs in PG(2,q)

Michael Braun

An (n,r)-arc in PG(2,q) is a set of n points such that each line contains at most r of the selected points. It is well-known that (n,r)-arcs in PG(2,q) correspond to projective lin…

math.CO2012

q-Analogs of Packing Designs

Michael Braun, Jan Reichelt

A $P_{q} (t, k, n)$ $q$ -packing design is a selection of $k$ -subspaces of $\F_q^n$ such that each $t$ -subspace is contained in at most one element of the collection. A successful approa…

Update: Some new results on lower bounds on (n,r)-arcs in PG(2,q) for q≤31

New lower bounds on the size of (n,r)-arcs in PG(2,q)

q-Analogs of Packing Designs

Update: Some new results on lower bounds on $(n, r)$ -arcs in $P G (2, q)$ for $q \leq 31$