G. Agnarsson

collaborators

3 papers

math.CO2026

Elements represented as intersections of sets

Geir Agnarsson, Mikolaj Sierzega

For a natural number $n$ let $[n] = {1, \dots, n}$ . We say that a family $S \subseteq 2^{[n]}$ is \emph{representing} if every singleton set of $[n]$ is an intersection of…

math.CO2026

TurÃ¡n results for posets and their alternating cycles

Geir Agnarsson, John B. Kent

For a partially ordered set $P = (X, \leq)$ there exist hypergraphs where the vertices are the set of ordered tuples of either all incomparable elements of $P$ …

math.CO2024

Minkowski ideals and rings

Geir Agnarsson, Jim Lawrence

\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space $W = R^{d}$ with multiplicative structure derived from Minkowski addition of convex pol…