1 citations · 3 across the 17 of their papers we have counts for
22 papers
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…
Power-closed ideals of polynomial and Laurent polynomial rings
Geir Agnarsson, Jim Lawrence
We investigate the structure of power-closed ideals of the complex polynomial ring and the Laurent polynomial ring $R^{\pm} = \mathbb{C}[x_1,\ldots…
On posets, monomial ideals, Gorenstein ideals and their combinatorics
Geir Agnarsson, Neil Epstein
In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra over a field that are not in the ideal itself and Maca…