1 citations · 3 across the 17 of their papers we have counts for
15 papers · 1 filter
Elements represented as intersections of sets
Geir Agnarsson, Mikolaj Sierzega
For a natural number let . We say that a family is \emph{representing} if every singleton set of is an intersection of…
Turán results for posets and their alternating cycles
Geir Agnarsson, John B. Kent
For a partially ordered set there exist hypergraphs where the vertices are the set of ordered tuples of either all incomparable elements of …
Minkowski ideals and rings
Geir Agnarsson, Jim Lawrence
\emph{Minkowski rings} are certain rings of simple functions on the Euclidean space with multiplicative structure derived from Minkowski addition of convex pol…
On locally finite ordered rooted trees and their rooted subtrees
Geir Agnarsson, Elie Alhajjar, Aleyah Dawkins
In this article we compare the known dynamical polynomial time algorithm for the game-over attack strategy, to that of the brute force approach; of checking all the ordered rooted…
On a special class of general permutahedra
Geir Agnarsson
Minkowski sums of simplices in form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the…
Extremal subgraphs of the -dimensional grid graph
Geir Agnarsson, Kshitij Lauria
For each natural number we determine, both asymptotically and exactly, the maximum number of edges an induced subgraph of order of the -dimension a grid graph ${\ints}^d…