Shannon Talbott
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shannon Talbott has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Bethany Kubik
Department of Mathematics Department of Mathematics Department of Mathematics and Statistics Christopher O'Neill Mathematics and Statistics Department Department of Mathematics and Computer Science The Ohio State University Ranthony A.C. Edmonds The Ohio State University Bethany Kubik University of Minnesota Duluth San Diego State University Shannon Talbott Moravian College
5 shared publications - Pamela E. Harris
Department of Mathematics and Statistics, Williams College, Williamstown, MA, United States
2 shared publications Rebecca E. Garcia
Sam Houston State University, Department of Mathematics and Statistics, Box 2206Huntsville, TX77341-2206, United States
2 shared publications- Austin A. Antoniou
Department of Mathematics Department of Mathematics Department of Mathematics and Statistics Christopher O'Neill Mathematics and Statistics Department Department of Mathematics and Computer Science The Ohio State University Ranthony A.C. Edmonds The Ohio State University Bethany Kubik University of Minnesota Duluth San Diego State University Shannon Talbott Moravian College
1 shared publication - Christopher O'Neill
Mathematics Department, San Diego State University, San Diego, CA 92182, USA
1 shared publication Fidel Barrera-Cruz
1 shared publication
Latest Publications
- Open Access
On Atomic Density of Numerical Semigroup Algebras
A numerical semigroup $S$ is a cofinite, additively-closed subset of the nonnegative integers that contains $0$. In this paper, we initiate the study of atomic density, an asymptotic measure of the proportion of irreducible elements in a given ring or semigroup, for semigroup algebras. It is known that the atomic density of the polynomial ring $\mathbb{F}_q[x]$ is zero for any finite field $\mathbb{F}_q$; we prove that the numerical semigroup algebra $\mathbb{F}_q[S]$ also has atomic density zero for any numerical semigroup~$S$. We also examine the particular algebra $\mathbb{F}_2[x^2,x^3]$ in more detail, providing a bound on the rate of convergence of the atomic density as well as a counting formula for irreducible polynomials using M\"{o}bius inversion, comparable to the formula for irreducible polynomials over a finite field $\mathbb{F}_q$.Open AccessOn Atomic Density of Numerical Semigroup Algebras
A numerical semigroup $S$ is a cofinite, additively-closed subset of the nonnegative integers that contains $0$. In this paper, we initiate the study of atomic density, an asymptotic measure of the proportion of irreducible elements in a given ring or semigroup, for semigroup algebras. It is known that the atomic density of the polynomial ring $\mathbb{F}_q[x]$ is zero for any finite field $\mathbb{F}_q$; we prove that the numerical semigroup algebra $\mathbb{F}_q[S]$ also has atomic density zero for any numerical semigroup~$S$. We also examine the particular algebra $\mathbb{F}_2[x^2,x^3]$ in more detail, providing a bound on the rate of convergence of the atomic density as well as a counting formula for irreducible polynomials using M\"{o}bius inversion, comparable to the formula for irreducible polynomials over a finite field $\mathbb{F}_q$. - Open Access
- 2 January 2020
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 17 (1) , 387-401
Characterizing graphs of critical pairs of layered generalized crowns
The generalized crown Snk is a well-known family of bipartite graphs whose order dimension is given in terms of the parameters n and k. In recent work, Garcia and Silva defined the notion of layeri...
- 2 January 2020
- Published by Taylor & Francis in AKCE International Journal of Graphs and Combinatorics
- Vol. 17 (1) , 387-401
Open AccessCharacterizing graphs of critical pairs of layered generalized crowns
The generalized crown Snk is a well-known family of bipartite graphs whose order dimension is given in terms of the parameters n and k. In recent work, Garcia and Silva defined the notion of layeri...
- Open Access
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 207-216
Block circulant graphs and the graphs of critical pairs of crowns
Block circulant graphs and the graphs of critical pairs of crowns
- 14 October 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Electronic Journal of Graph Theory and Applications
- Vol. 7 (2) , 207-216
Open AccessBlock circulant graphs and the graphs of critical pairs of crowns
Block circulant graphs and the graphs of critical pairs of crowns
- Open Access
The Graph of Critical Pairs of a Crown
There is a natural way to associate with a poset $P$ a hypergraph $H$, called the hypergraph of critical pairs, so that the dimension of $P$ is exactly equal to the chromatic number of $H$. The edges of $H$ have variable sizes, but it is of interest to consider the graph $G$ formed by the edges of $H$ that have size~2. The chromatic number of $G$ is less than or equal to the dimension of $P$ and the difference between the two values can be arbitrarily large. Nevertheless, there are important instances where the two parameters are the same, and we study one of these in this paper. Our focus is on a family $\{S_n^k:n\ge 3, k\ge 0\}$ of height two posets called crowns. We show that the chromatic number of the graph $G_n^k$ of critical pairs of the crown $S_n^k$ is the same as the dimension of $S_n^k$, which is known to be $\lceil 2(n+k)/(k+2)\rceil$. In fact, this theorem follows as an immediate corollary to the stronger result: The independence number of $G_n^k$ is $(k+1)(k+2)/2$. We obtain this theorem as part of a comprehensive analysis of independent sets in $G_n^k$ including the determination of the second largest size among the maximal independent sets, both the reversible and non-reversible types.Open AccessThe Graph of Critical Pairs of a Crown
There is a natural way to associate with a poset $P$ a hypergraph $H$, called the hypergraph of critical pairs, so that the dimension of $P$ is exactly equal to the chromatic number of $H$. The edges of $H$ have variable sizes, but it is of interest to consider the graph $G$ formed by the edges of $H$ that have size~2. The chromatic number of $G$ is less than or equal to the dimension of $P$ and the difference between the two values can be arbitrarily large. Nevertheless, there are important instances where the two parameters are the same, and we study one of these in this paper. Our focus is on a family $\{S_n^k:n\ge 3, k\ge 0\}$ of height two posets called crowns. We show that the chromatic number of the graph $G_n^k$ of critical pairs of the crown $S_n^k$ is the same as the dimension of $S_n^k$, which is known to be $\lceil 2(n+k)/(k+2)\rceil$. In fact, this theorem follows as an immediate corollary to the stronger result: The independence number of $G_n^k$ is $(k+1)(k+2)/2$. We obtain this theorem as part of a comprehensive analysis of independent sets in $G_n^k$ including the determination of the second largest size among the maximal independent sets, both the reversible and non-reversible types. - Open Access
Block Circulant Graphs and the Graphs of Critical Pairs of a Crown
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns. In particular, every graph in this family of block circulant graphs we investigate has a generating block row that follows a symmetric growth pattern of the all ones matrix. The natural bijection provides an upper bound on the chromatic number for this infinite family of graphs.
Open AccessBlock Circulant Graphs and the Graphs of Critical Pairs of a Crown
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns. In particular, every graph in this family of block circulant graphs we investigate has a generating block row that follows a symmetric growth pattern of the all ones matrix. The natural bijection provides an upper bound on the chromatic number for this infinite family of graphs.