AOAugustine O'Keefe

Augustine O'Keefe

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Augustine O'Keefe has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Path ideals of rooted trees and their graded Betti numbers

    by Rachelle R. Bouchat, Huy Tai Ha, Augustine O'Keefe

    Let $\Gamma$ be a rooted tree and let $t$ be a positive integer. We study algebraic invariants and properties of the path ideal generated by monomial corresponding to paths of length $(t-1)$ in $\Gamma$. In particular, we give a recursive formula to compute the graded Betti numbers, a general bound for the regularity, an explicit computation of the linear strand, and we characterize when this path ideal has a linear resolution.

  • Open Access

    Depth of edge rings arising from finite graphs

    by Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine O’KEefe

    Let G G be a finite graph and K [ G ] K[G] the edge ring of G G . Based on the technique of Gröbner bases and initial ideals, it will be proved that, given integers f f and d d with 7 ≤ f ≤ d 7 \leq f \leq d , there exists a finite graph G G on [ d ] = { 1 , … , d } [d] = \{ 1, \ldots , d \} with depth K [ G ] = f \textrm {depth}\, K[G] = f and with Krull-dim K [ G ] = d \textrm {Krull-dim}\, K[G] = d .


  • Open Access

    Depth of initial ideals of normal edge rings

    by Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine B. O'Keefe

    Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which is generated by those monomials $\tb^e = t_it_j$ such that $e = \{i, j\}$ is an edge of $G$. Let $K[\xb] = K[x_1, ..., x_n]$ be the polynomial ring in $n$ variables over $K$ and define the surjective homomorphism $\pi : K[\xb] \to K[G]$ by setting $\pi(x_i) = \tb^{e_i}$ for $i = 1, ..., n$. The toric ideal $I_G$ of $G$ is the kernel of $\pi$. It will be proved that, given integers $f$ and $d$ with $6 \leq f \leq d$, there exist a finite connected nonbipartite graph $G$ on $[d]$ together with a reverse lexicographic order $<_{\rev}$ on $K[\xb]$ and a lexicographic order $<_{\lex}$ on $K[\xb]$ such that (i) $K[G]$ is normal, (ii) $\depth K[\xb]/\ini_{<_{\rev}}(I_G) = f$ and (iii) $K[\xb]/\ini_{<_{\lex}}(I_G)$ is Cohen--Macaulay, where $\ini_{<_{\rev}}(I_G)$ (resp.\ $\ini_{<_{\lex}}(I_G)$) is the initial ideal of $I_G$ with respect to $<_{\rev}$ (resp.\ $<_{\lex}$) and where $\depth K[\xb]/\ini_{<_{\rev}}(I_G)$ is the depth of $K[\xb]/\ini_{<_{\rev}}(I_G)$.

  • Open Access

    Depth of edge rings arising from finite graphs

    by Takayuki Hibi, Akihiro Higashitani, Kyouko Kimura, Augustine B. O'Keefe

    Let $G$ be a finite graph and $K[G]$ the edge ring of $G$. Based on the technique of Gr\"obner bases and initial ideals, it will be proved that, given integers $f$ and $d$ with $7 \leq f \leq d$, there exists a finite graph $G$ on $[d]={1,...,d}$ with $\depth K[G] = f$ and with $\Krull-dim K[G] = d$.