Abstract
This work presents results for computing the values of permanents of fully indecomposable (0,1)-matrices. There exists an interesting and only partially understood spectrum of possible values for the permanent of a (0,1)-matrix with given topological dimension d. The present work is an experimental study of this spectrum using the handle basis representation of directed graphs and the Monte Carlo based optimization method simulated annealing to sample the possible values. The approach represents an importance sampling technique to focus the search for new values. The results from these experiments show that there exist gaps in the spectrum of values of the permanent.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. L. Cauchy,”Memoire sur les fonctions qui ne peuvent obtenir que deux valeurs egales et de signs contraires par suite des transpositions operees entre les variables quelles renferment”, J. Ec. Polyt. 10 Cah. 17, 29–112, Oeuvres (2)i.
R. M. Karp,”Reducibility among combinatorial problems”, in R. E. Miller and J. W. Thatcher, (Eds.) Complexity of computer computations ( Plenum Press, New York, 1972 ), 85–103.
L. G. Valiant, “The complexity of computing the permanent”, Theor. Comput. Sci. 8, 189–201 (1978).
M. R. Garey and D. S. Johnson, Computers and Intractability, A guide to the Theory of NP-Completeness (W. H. Freeman and Company, New York, 1979 ).
H. Mine, Permanents, Encyclopedia of mathematics and its applications, v. 6, section on Linear algebra (Addison-Wesley, 1978 ).
J. Donald and J. Elwin, “On The Structure Of The Strong Orientation Of A Graph”, SIAM J. Disc. MATH. 9, No. 1, 30–43, (February 1993).
J. Donald, J. Elwin, R. Hager, and P. Salamon, “Handle bases and bounds on the number of subgraphs”, J. Combin. Theory, Ser. B, 42 1–13 (1987).
J. Donald, J. Elwin, R. Hager, and P. Salamon, “A Graph Theoretic Upper Bound on the Permanent of a Nonnegative Integer Matrix”, I, II, Linear Algebra and its Applications 61, 187–198 (1984).
A. Nijenhuis and H. Wilf, Combinatorial Algorithms ( Academic Press, Inc., 1975 ).
N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller,”Equation of state calculation by fast computing machines”, J. Chem. Phys. 21, 1087–1092 (1953).
P. J Van Laarhoven and E. H. L. Aarts, Simulated Annealing and Applications (D. Reidel Publishing Company, 1987 ).
R. H. J. M Otten and L. P. P. P. Van Ginneken, The Annealing Algorithm (Kluwer Academic Publishers, 1989 ).
R. G. Kemeny and J. L. Snell, Finite Markov chains (D. Van Nostrand Company, Inc., 1960 ).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Nourani, Y. (1995). Exploring the Spectrum of Values of Permanents by Simulated Annealing. In: Colbourn, C.J., Mahmoodian, E.S. (eds) Combinatorics Advances. Mathematics and Its Applications, vol 329. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3554-2_18
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3554-2_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3556-6
Online ISBN: 978-1-4613-3554-2
eBook Packages: Springer Book Archive