Zobrazeno 1 - 10
of 34
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dca0655a78a597df13f851324e5ffb8
https://doi.org/10.24330/ieja.662946
https://doi.org/10.24330/ieja.662946
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bf72a3dbd6f918679cdf54c69d22de3
https://doi.org/10.1007/s11083-019-09509-z
https://doi.org/10.1007/s11083-019-09509-z
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98bf239778401f2ea7df728f3151dbb7
https://doi.org/10.14232/actacyb.22.3.2016.3
https://doi.org/10.14232/actacyb.22.3.2016.3
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e2d2c8afb4e1013936d0e80693707e0
https://doi.org/10.14232/actacyb.22.4.2016.2
https://doi.org/10.14232/actacyb.22.4.2016.2
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c40b59f439376f8b8ec6603abdb5e1cf
https://doi.org/10.37236/6652
https://doi.org/10.37236/6652
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbaf9bddda9cc80d5d25a3a66162100c
https://doi.org/10.1016/j.disc.2013.08.033
https://doi.org/10.1016/j.disc.2013.08.033
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f8fb124937e5ea733898b49ffb9b0f9f
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::92788e72ceb5958388756c602fcbfae6
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5389a4cdf78a3aa870674c83a49306e
https://doi.org/10.1137/100796078
https://doi.org/10.1137/100796078
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.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16ae7deda748bf7b2011077f35c12044
https://doi.org/10.1007/s00026-009-0031-z
https://doi.org/10.1007/s00026-009-0031-z