Zobrazeno 1 - 10
of 68
pro vyhledávání: '"Geir Agnarsson"'
Autor:
Geir Agnarsson, Samuel S. Mendelson
Publikováno v:
Volume: 27, Issue: 27 13-42
International Electronic Journal of Algebra
International Electronic Journal of Algebra
Recognizing when a ring is a complete matrix ring is of significant importance in algebra. It is well-known folklore that a ring $R$ is a complete $n\times n$ matrix ring, so $R\cong M_{n}(S)$ for some ring $S$, if and only if it contains a set of $n
Autor:
Neil Epstein, Geir Agnarsson
Publikováno v:
Order. 37:341-369
For a finite subset $M\subset [x_1,\ldots,x_d]$ of monomials, we describe how to constructively obtain a monomial ideal $I\subseteq R = K[x_1,\ldots,x_d]$ such that the set of monomials in $\text{Soc}(I)\setminus I$ is precisely $M$, or such that $\o
Publikováno v:
Acta Cybernetica. 22:591-612
This paper makes three contributions to cyber-security research. First,we define a model for cyber-security systems and the concept of acyber-security attack within the model's framework. The modelhighlights the importance of game-over components - c
Publikováno v:
Acta Cybernetica. 22:735-769
In this paper we consider the structure and topology of a layered-security model in which the containers and their nestings are given in the form of a rooted tree T. A cyber-security model is an ordered three-tuple M = (T, C, P) where C and P are mul
Autor:
Geir Agnarsson
Publikováno v:
The Electronic Journal of Combinatorics. 24
Minkowski sums of simplices in ${\mathbb{R}}^n$ form an interesting class of polytopes that seem to emerge in various situations. In this paper we discuss the Minkowski sum of the simplices $\Delta_{k-1}$ in ${\mathbb{R}}^n$ where $k$ and $n$ are fix
Autor:
Geir Agnarsson
Publikováno v:
Discrete Mathematics. 313:2857-2864
We revisit a well-known divide-and-conquer maximin recurrence $f(n) = \max(\min(n_1,n_2) + f(n_1) + f(n_2))$ where the maximum is taken over all proper bipartitions $n = n_1+n_2$, and we present a new characterization of the pairs $(n_1,n_2)$ summing
Autor:
Geir Agnarsson
Publikováno v:
European Journal of Combinatorics. 34(2):155-168
Let $Q_k$ denote the $k$-dimensional hypercube on $2^k$ vertices. A vertex in a subgraph of $Q_k$ is {\em full} if its degree is $k$. We apply the Kruskal-Katona Theorem to compute the maximum number of full vertices an induced subgraph on $n\leq 2^k
Publikováno v:
Theoretical Computer Science. 470:1-9
This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weig
Autor:
Jill Bigley Dunham, Geir Agnarsson
Publikováno v:
SIAM Journal on Discrete Mathematics. 25:1714-1721
For $n\in\mathbb{N}$ and $4\leq k\leq n$ we compute the exact value of $E_k(n)$, the maximum number of edges of a simple plane graph on $n$ vertices, where each vertex bounds an $\ell$-gon where $\ell\geq k$. The lower bound of $E_k(n)$ is obtained b
Autor:
Walter D. Morris, Geir Agnarsson
Publikováno v:
Annals of Combinatorics. 13:271-287
We investigate the structure of the Minkowski sum of standard simplices in \({{\mathbb R}^r}\). In particular, we investigate the one-dimensional structure, the vertices, their degrees and the edges in the Minkowski sum polytope.