Jason Grout wrote: > David Joyner wrote: >> Hello: >> >> At a recent NSF workshop >> http://www4.ncsu.edu/~kaltofen/NSF_WS_ECCAD09_Itinerary.html >> Hoon Hong (managing editor of the J Symb Comp) asked for a list of >> papers written using Sage >> by students. The obvious answer was to look at >> http://www.sagemath.org/library/publications.html >> but (a) there is no way for him to tell who is a student and who isn't >> (b) I know that there are >> papers missing (eg, Boothby-Bradshaw and Stein-Pernet since they were >> actually referenced at >> ECCAD the following day). >> >> So, I'm requesting 2 things: >> (1) if you have a paper using Sage (*especially* if you are a student) >> which is not on >> http://www.sagemath.org/library/publications.html >> can you *please* send at least the title to this list (or to Willaim >> or Harald me, and I'll forward it >> to Harard), > > > We wrote this paper (and the accompanying preprint containing our code) > in an early-graduate research class by Leslie Hogben at Iowa State > University. This class was designed to introduce new or nearly-new > graduate students to early research. The class picked up Sage quite > quickly and they have since been using Sage in their other classwork and > research. > > The paper (Leslie Hogben is the professor teaching the class, Jason > Grout is a postdoc at Iowa State, and all the rest are graduate students > at Iowa State University): > > Table of minimum ranks of graphs of order at most 7 and selected optimal > matrices. Laura DeLoss, Jason Grout, Leslie Hogben, Tracy McKay, Jason > Smith, Geoff Tims. Submitted. Preprint available at > http://arxiv.org/abs/0812.0870.
Sorry; the above reference is the *data* for the following submitted paper. The submitted paper, below, is not on arxiv. L. DeLoss, J. Grout, L. Hogben, T. McKay, J. Smith, G. Tims. Techniques for determining the minimum rank of a small graph. > > The preprint containing our source code (which will eventually be > incorporated into Sage, probably this summer): > > Program for calculating bounds on the minimum rank of a graph using > Sage. http://arxiv.org/abs/0812.1616. Laura DeLoss, Jason Grout, Tracy > McKay, Jason Smith, Geoff Tims. > > So really, you could consider the three references above as part of the same project. The submitted paper: L. DeLoss, J. Grout, L. Hogben, T. McKay, J. Smith, G. Tims. Techniques for determining the minimum rank of a small graph. The data: Table of minimum ranks of graphs of order at most 7 and selected optimal matrices. Laura DeLoss, Jason Grout, Leslie Hogben, Tracy McKay, Jason Smith, Geoff Tims. Available at http://arxiv.org/abs/0812.0870. and the program (which will be contributed to Sage): Program for calculating bounds on the minimum rank of a graph using Sage. http://arxiv.org/abs/0812.1616. Laura DeLoss, Jason Grout, Tracy McKay, Jason Smith, Geoff Tims. Thanks, Jason --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
