Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-24T20:52:21.800Z Has data issue: false hasContentIssue false
  • English
  • Français

Permanents of (0, 1)-Circulants

Published online by Cambridge University Press:  20 November 2018

Henryk Minc
Henryk Minc*
Affiliation:
University of Florida and University of California, Santa Barbara
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The permanent of an n-square matrix A = (aij) is defined by

where the summation extends over all permutations σ of the symmetric group Sn. A matrix is said to be a (0, 1)-matrix if each of its entries is either 0 or 1. A (0, 1)-matrix of n-1 the form , where θj = 0 or 1, j = 1,…, n, and Pn is the n-square permutation matrix with ones in the (1, 2), (2, 3),…, (n-1, n), (n, 1) positions, is called a (0, 1)-circulant. Denote the (0, 1)-circulant . It has been conjectured that

1

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 7 , Issue 2 , June 1964 , pp. 253 - 263
Copyright
Copyright © Canadian Mathematical Society 1964

References

1. Gerŝgorin, S.A., Über die Abgrenzung der Eigenwerte einer Matrix, Izv. Akad. Nauk SSSR, Ser. Fiz. - Mat., 6 (1931), 749–754.Google Scholar
2. Marcus, M. and Newman, M., On the minimum of the permanent of a doubly stochastic matrix, Duke Math. J., 26 (1959), 61–72.Google Scholar
3. Mendelsohn, N. S., Permutations with confined displacements, Canad. Math. Bull., 4(1961), 29–38.Google Scholar
4. Taussky, O., Bounds for characteristic roots of matrices, Duke Math. J., 15(1948), 1043–1044.Google Scholar
5. van der Waerden, B. L., Problem, Jber. Deutsch. Math. Verein., 25 (1926), 117.Google Scholar