Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-26T14:22:27.158Z Has data issue: false hasContentIssue false

Preface

Published online by Cambridge University Press:  12 April 2010

Richard A. Brualdi
Affiliation:
University of Wisconsin, Madison
Get access

Summary

In the preface of the book Combinatorial Matrix Theory (CMT) I discussed my plan to write a second volume entitled Combinatorial Matrix Classes. Here 15 years later (including 6, to my mind, wonderful years as Department of Mathematics Chair at UW-Madison), and to my great relief, is the finished product. What I proposed as topics to be covered in a second volume were, in retrospect, much too ambitious. Indeed, after some distance from the first volume, it now seems like a plan for a book series rather than for a second volume. I decided to concentrate on topics that I was most familiar with and that have been a source of much research inspiration for me. Having made this decision, there was more than enough basic material to be covered. Most of the material in the book has never appeared in book form, and as a result, I hope that it will be useful to both current researchers and aspirant researchers in the field. I have tried to be as complete as possible with those matrix classes that I have treated, and thus I also hope that the book will be a useful reference book.

I started the serious writing of this book in the summer of 2000 and continued, while on sabbatical, through the following semester. I made good progress during those six months. Thereafter, with my many teaching, research, editorial, and other professional and university responsibilities, I managed to work on the book only sporadically.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Preface
  • Richard A. Brualdi, University of Wisconsin, Madison
  • Book: Combinatorial Matrix Classes
  • Online publication: 12 April 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721182.001
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Preface
  • Richard A. Brualdi, University of Wisconsin, Madison
  • Book: Combinatorial Matrix Classes
  • Online publication: 12 April 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721182.001
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Preface
  • Richard A. Brualdi, University of Wisconsin, Madison
  • Book: Combinatorial Matrix Classes
  • Online publication: 12 April 2010
  • Chapter DOI: https://doi.org/10.1017/CBO9780511721182.001
Available formats
×