| Item type | Current location | Collection | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| E-Books | Biblioteca da FCTUNL Online | Não Ficção | QA150. FCT 98069 (Browse shelf) | 1 | Available |
Browsing Biblioteca da FCTUNL Shelves , Shelving location: Online , Collection code: Não Ficção Close shelf browser
| No cover image available | ||||||||
| QA150. FCT 97024 Algebra I | QA150. FCT 97143 Integral points on algebraic varieties | QA150. FCT 97147 Algebra for cryptologists | QA150. FCT 98069 The language of self-avoiding walks | QA150. FCT 98073 Algebraic methods in general rough sets | QA150. FCT 98229 Fuzzy lie algebras | QA150. FCT 98331 Homological and combinatorial methods in algebra |
Colocação: Online
The connective constant of a quasi-transitive infinite graph is a measure for the asymptotic growth rate of the number of self-avoiding walks of length n from a given starting vertex. On edge-labelled graphs the formal language of self-avoiding walks is generated by a formal grammar, which can be used to calculate the connective constant of the graph. Christian Lindorfer discusses the methods in some examples, including the infinite ladder-graph and the sandwich of two regular infinite trees. Contents Graph Height Functions and Bridges Self-Avoiding Walks on One-Dimensional Lattices The Algebraic Theory of Context-Free Languages The Language of Walks on Edge-Labelled Graphs Target Groups Researchers and students in the fields of graph theory, formal language theory and combinatorics Experts in these areas The Author Christian Lindorfer wrote his master’s thesis under the supervision of Prof. Dr. Wolfgang Woess at the Institute of Discrete Mathematics at Graz University of Technology, Austria.
There are no comments for this item.