The Language of Self-Avoiding Walks: Connective Constants of Quasi-Transitive Graphs: BestMasters
Autor Christian Lindorferen Limba Engleză Paperback – 15 ian 2019
Din seria BestMasters
- 20% Preț: 366.22 lei
- Preț: 365.65 lei
- Preț: 306.73 lei
- 13% Preț: 367.40 lei
- Preț: 251.33 lei
- 13% Preț: 396.41 lei
- Preț: 367.04 lei
- Preț: 406.58 lei
- Preț: 391.40 lei
- Preț: 369.62 lei
- 13% Preț: 366.14 lei
- Preț: 393.57 lei
- 5% Preț: 403.95 lei
- Preț: 333.99 lei
- Preț: 364.13 lei
- 13% Preț: 364.56 lei
- 13% Preț: 407.10 lei
- Preț: 366.31 lei
- Preț: 367.04 lei
- Preț: 364.13 lei
- Preț: 365.58 lei
- Preț: 393.57 lei
- 20% Preț: 292.10 lei
- Preț: 311.76 lei
- Preț: 344.45 lei
- 13% Preț: 367.40 lei
- Preț: 307.45 lei
- Preț: 392.12 lei
- Preț: 404.04 lei
- Preț: 344.87 lei
- Preț: 402.52 lei
- Preț: 403.47 lei
- Preț: 371.69 lei
- Preț: 403.06 lei
- Preț: 404.59 lei
- Preț: 370.15 lei
- Preț: 370.52 lei
- Preț: 404.22 lei
- Preț: 472.10 lei
- Preț: 369.62 lei
- Preț: 470.39 lei
- Preț: 368.49 lei
- Preț: 375.26 lei
- Preț: 370.36 lei
- Preț: 404.39 lei
- Preț: 369.23 lei
- Preț: 372.80 lei
- Preț: 401.93 lei
- Preț: 402.68 lei
- Preț: 372.98 lei
Preț: 464.91 lei
Nou
Puncte Express: 697
Preț estimativ în valută:
89.00€ • 92.51$ • 73.79£
89.00€ • 92.51$ • 73.79£
Carte tipărită la comandă
Livrare economică 06-20 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783658247638
ISBN-10: 3658247630
Pagini: 65
Ilustrații: XI, 65 p. 1 illus.
Dimensiuni: 148 x 210 mm
Greutate: 0.1 kg
Ediția:1st ed. 2018
Editura: Springer Fachmedien Wiesbaden
Colecția Springer Spektrum
Seria BestMasters
Locul publicării:Wiesbaden, Germany
ISBN-10: 3658247630
Pagini: 65
Ilustrații: XI, 65 p. 1 illus.
Dimensiuni: 148 x 210 mm
Greutate: 0.1 kg
Ediția:1st ed. 2018
Editura: Springer Fachmedien Wiesbaden
Colecția Springer Spektrum
Seria BestMasters
Locul publicării:Wiesbaden, Germany
Cuprins
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.
Notă biografică
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.
Textul de pe ultima copertă
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
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.
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
- Researchers and students in the fields of graph theory, formal language theory and combinatorics
- Experts in these areas
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.
Caracteristici
Publication in the field of mathematics