3 papers
math.RA2025
Sign patterns which require or allow the strong multiplicity property
Abhilash Saha, Leona Tilis, Kevin N. Vander Meulen +1
We initiate a study of sign patterns that require or allow the non-symmetric strong multiplicity property (nSMP). We show that all cycle patterns require the nSMP, regardless of th…
math.CO2019
Maximum nullity and zero forcing of circulant graphs
Linh Duong, Brenda K. Kroschel, Michael Riddell +2
It is well-known that the zero forcing number of a graph provides a lower bound on the minimum rank of a graph. In this paper we bound and characterize the zero forcing number of c…
math.AC2012
Cohen-Macaulay Circulant Graphs
Kevin N. Vander Meulen, Adam Van Tuyl, Catriona Watt
Let G be the circulant graph C_n(S) with S a subset of {1,2,...,\lfloor n/2 \rfloor}, and let I(G) denote its the edge ideal in the ring R = k[x_1,...,x_n]. We consider the problem…