- Title
- A study of barred preferential arrangements with applications to numerical approximation in electric circuits
- Creator
- Nkonkobe, Sithembele
- ThesisAdvisor
- Murali, V
- Subject
- Electric circuits
- Subject
- Numerical calculations
- Subject
- Sequences (Mathematics)
- Date
- 2015
- Type
- Thesis
- Type
- Masters
- Type
- MSc
- Identifier
- vital:5433
- Identifier
- http://hdl.handle.net/10962/d1020394
- Description
- In 1854 Cayley proposed an interesting sequence 1,1,3,13,75,541,... in connection with analytical forms called trees. Since then there has been various combinatorial interpretations of the sequence. The sequence has been interpreted as the number of preferential arrangements of members of a set with n elements. Alternatively the sequence has been interpreted as the number of ordered partitions; the outcomes in races in which ties are allowed or geometrically the number of vertices, edges and faces of simplicial objects. An interesting application of the sequence is found in combination locks. The idea of a preferential arrangement has been extended to a wider combinatorial object called barred preferential arrangement with multiple bars. In this thesis we study barred preferential arrangements combinatorially with application to resistance of certain electrical circuits. In the process we derive some results on cyclic properties of the last digit of the number of barred preferential arrangements. An algorithm in python has been developed to find the number of barred preferential arrangements.
- Format
- 85 leaves, pdf
- Publisher
- Rhodes University, Faculty of Science, Mathematics (Pure and Applied)
- Language
- English
- Rights
- Nkonkobe, Sithembele
- Hits: 2423
- Visitors: 2613
- Downloads: 239
Collections
RU Department of Mathematics (Pure and Applied)
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details | SOURCEPDF | 766 KB | Adobe Acrobat PDF | View Details |