Abstract
Consider a grid of T horizontal and T vertical information conductors. At each crossing point it is possible to either connect a horizontal to a vertical conductor or just let the connection be open. When connected at a crossing point, both conductors share the same information state throught their lengths.
When several conductors are mutually connected at their crossing points, an island of connections is formed. A requirement for an island is that there be representative conductors of both kinds. All conductors associated with an island share the same information state.
For the case of several islands, each island’s conductors are mutually exclusive of any other island’s conductors. In fact, an island can be uniquely named by its conductors. As a further requirement on the conductors, the grid is assumed to be completely utilized with no idle conductors.
It is under the above conditions we develop the general combinatorial equations for counting the number of ways s sets of islands can exist on a TxT grid of conductors. The restraints of the problem introduce interesting combinatorial aspects. We also discuss methods of counting connections and naming sets of islands.
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.
Similar content being viewed by others
References
Fielder D C, ‘Counting and Naming Private Conversations on a PFP Crossbar System’, Computer Engineering Engineering Research Laboratory, School of Electrical Engineering, Georgia Institute of Technology, Report # DCF-COUNT-PRI, 8/90 and Addendum #1, 1990.
Fielder D C and Alford C O, ‘Counting and Naming Private Conversations on a PFP Crossbar System’, presented at the ISSM Workshop on Parallel Computing, Trani, Italy, September 10–13, 1991. Also accepted for publication in The International Journal Of Mini and Microcomputers (Acta Press).
Fielder D C, ‘Continuing Count of Crossbar Broadcast Conversations’, Computer Engineering Research Laboratory, School of Electrical Engineering, Georgia Institute of Technology, Interim Report BDCSTCONV 9-91, 1991.
Fielder D C, ‘Computer Simulation of and Exact Count Formula Derivation for Non-taking Gangs of Friendly Rooks’, Computer Engineering Research Laboratory, School of Electrical Engineering, Georgia Institute of Technology, CERL Memorandum Report #DCF-ROOKGNGS-1/92, 1992.
Fielder D C, ‘Derivation of Alternate Formulas and Programs for Counting Sets of s Gangs of Friendly Rooks on a TxT Chessboard Without Use of Inclusion-Exclusion’, Computer Engineering Research Laboratory, School of Electrical Engineering, Georgia Institute of Technology, Memorandum Report, 1992
Fielder D C and Alford C O, ‘Contributions from Cascaded Combinations to the Naming of Special Permutations’, The Fifth International Conference on Fibonacci Numbers and Their Applications, St Andrews University, Scotland, July 20–24, 1992. Also refereed and accepted for publication in ‘Applications of Fibonacci Numbers’, vol. 5, G. E. Bergum et. al., Eds., Kluwer Academic Publishers, Dordrecht, The Netherlands.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag/Wien
About this paper
Cite this paper
Fielder, D.C., Alford, C.O. (1993). Counting and Naming Connection Islands on a Grid of Conductors. In: Albrecht, R.F., Reeves, C.R., Steele, N.C. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7533-0_106
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7533-0_106
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82459-7
Online ISBN: 978-3-7091-7533-0
eBook Packages: Springer Book Archive