A graphic apology for symmetry and implicitness:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Oxford [u.a.]
Oxford Univ. Press
2000
|
| Edition: | 1. publ. |
| Series: | Oxford mathematical monographs
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Includes bibliographical references (p. [487]-495) and index |
| Physical Description: | XVII, 501 S. |
| ISBN: | 0198507291 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019821770 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 050525s2000 |||| 00||| eng d | ||
| 010 | |a 0042739 | ||
| 020 | |a 0198507291 |9 0-19-850729-1 | ||
| 035 | |a (OCoLC)44313374 | ||
| 035 | |a (DE-599)BVBBV019821770 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-11 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 0 | |a 511.3 |2 21 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Carbone, Alessandra |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A graphic apology for symmetry and implicitness |c Alessandra Carbone and Stephen Semmes |
| 250 | |a 1. publ. | ||
| 264 | 1 | |a Oxford [u.a.] |b Oxford Univ. Press |c 2000 | |
| 300 | |a XVII, 501 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Oxford mathematical monographs | |
| 500 | |a Includes bibliographical references (p. [487]-495) and index | ||
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Graph theory | |
| 650 | 4 | |a Group theory | |
| 650 | 4 | |a Machine theory | |
| 650 | 0 | 7 | |a Gruppentheorie |0 (DE-588)4072157-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Gruppentheorie |0 (DE-588)4072157-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Semmes, Stephen |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013147030&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-013147030 | ||
Record in the Search Index
| _version_ | 1804133324661194752 |
|---|---|
| adam_text | Titel: A graphic apology for symmetry and implicitness
Autor: Carbone, Alessandra
Jahr: 2000
CONTENTS
1 Introduction 1
1.1 Examples of implicit descriptions 1
1.2 Formal proofs and cut elimination 4
1.3 Feasibility 5
1.4 Combinatorial models 7
1.5 Formal proofs and algorithmic complexity 8
1.6 The role of symmetry 9
1.7 Partial symmetries 9
1.8 Computational complexity 10
2 Morphisms in logic and complexity 15
2.1 Morphisms and formal proofs 15
2.2 Morphisms and monotonicity 16
2.3 Combinatorial proof systems 17
3 Exponential processes and formal proofs 19
3.1 Preliminaries 19
3.2 A process of branching 22
3.3 A stronger process of branching 24
3.4 Comparisons 28
3.5 The pigeon-hole principle 29
3.6 Proofs, sets, and cells 30
4 Graphs and their visibilities 37
4.1 Optical graphs 37
4.2 The definition of the visibility 38
4.3 Some examples 39
4.4 Visibility and depth 43
4.5 The canonical projection 45
4.6 Basic properties of the visibility 46
4.7 The size of the visibility 48
4.8 Formal proofs and logical flow graphs 50
4.9 Comparison with L-systems 53
4.10 Visibility in Riemannian manifolds 56
4.11 Universal covering spaces 65
4.12 Boolean circuits and expressions 76
4.13 Combinatorial dynamical systems 81
4.14 Exponential expansion 84
xiv
CONTENTS
89
91
104
105
109
109
Asymptotic growth of infinite visibilities
5.1 Introduction
5.2 When loops meet
5.3 When loops do not meet
5.4 Summary and remarks
5.5 Asymptotic geometry
Geometric aspects of cut elimination
6.1 Preliminary remarks
6.2 The process of cut elimination HI
6.3 A first scenario, and the breaking of cycles 114
6.4 A second scenario, and the breaking of focal pairs 115
6.5 A third scenario, and chains of focal pairs 115
6.6 The third scenario, continued 120
6.7 Chains of focal pairs in the second scenario 121
6.8 Recapitulation 122
6.9 Proofs without focal pairs 124
6.10 A fourth scenario, and the creation of focal pairs 125
6.11 Extensions of chains of focal pairs 125
6.12 Steady graphs and cut-free proofs 126
6.13 Steady graphs with oriented cycles 132
6.14 Steady horizons 133
6.15 A simplified model 136
6.16 Comparisons 139
6.17 A brief digression 140
6.18 Proofs with simple cuts 143
Feasibility graphs 155
7.1 Basic concepts 155
7.2 Extensions and comparisons 159
7.3 Some remarks about computability 161
7.4 Feasibility and visibility graphs 162
7.5 Upper bounds 154
7.6 Concrete examples K35
7.7 Measurements of complexity in groups 168
7.8 Trivial words in groups 170
7.9 Examples about numbers 175
7.10 Trees
7.11 Boolean circuits
7.12 Homoinorphisins and comparisons
Bounds for finite visibilities
8.1 The propagator rule
8.2 Visibilities within visibilities
8.3 The Calderon- Zygrnund decomposition
176
177
178
180
180
183
185
CONTENTS xv
8.4 The Corona decomposition 188
8.5 The derived graph 191
8.6 Extensions 192
8.7 A more direct counting argument 195
8.8 Exponential bounds for general graphs 200
8.9 The restrained visibility 207
8.10 Graphs with cycles 210
9 Some related computational questions 212
9.1 The size of the visibility 212
9.2 The visibility recognition problem 216
9.3 An implicit version 220
9.4 The visibility isomorphism problem 221
9.5 Computations with implicit descriptions 228
10 Mappings and graphs 231
10.1 Mappings and weak mappings 231
10.2 Computational questions 235
10.3 Local +-isomorphisms 236
10.4 Some interpretations 242
10.5 The local +-injection problem 243
10.6 A uniqueness result 247
10.7 Minimal representations 248
10.8 Mappings and effective witnesses 252
10.9 The visibility isomorphism problem 253
lO.lOMinimal representations and DP 257
10.11 Minimal folding graphs 258
10.12 Universal constructions 262
10.13The visibility spectrum 266
10.14 The local +-isomorphism problem 271
10.15 Comparisons with /c-provability 275
10.16A partial ordering between graphs 276
10.17Monotonicity properties 278
10.18Possible behavior of mappings 279
10.19PossibIe behavior of mappings, continued 282
H Mappings and comparisons 285
11.1 Locally +-stable mappings 285
11.2 Locally +-uniform mappings 287
11.3 Mappings and symmetry 288
11.4 Labelled graphs 289
11.5 Feasibility graphs 290
12 Adjacency matrices and counting 294
12.1 The adjacency matrix 294
12.2 Counting in the visibility 295
XVI
CONTENTS
12.3 Some concrete examples
12.4 Representation problems
12.5 Mappings and matrices
17 Groups and graphs
299
310
311
313
313
13 Duality and NP-completeness
13.1 The visibility mapping problem
13.2 Monotonicity and stability properties 31
13.3 The visibility surjoction problem 319
13.4 The visibility injection problem 324
14 Finite automata and regular languages 32^
14.1 Definitions and the subset construction 32
14.2 Geometric reformulations 332
14.3 An extended view 33 *
14.4 Markov languages 333
15 Constructions with graphs 333
15.1 Mappings and automata 333
15.2 Cartesian products and concatenation 339
15.3 Free products and positive closure 342
15.4 Unions and intersections 3-13
15.5 Fiber products (in general) 345
15.G Fiber products of graphs 348
15.7 Interpretations for automata 352
16 Stronger forms of recursion 355
1G.1 Feasible numbers 35G
1G.2 Combinatorial interpretations 358
1G.3 Feasibility graphs for feasibility graphs 3G1
1G.4 Correspondence with functions 3G9
1G.5 Implicit representations of functions 372
1G.G Functions and points 373
1G.7 Graphs and numbers 375
1G.8 Graphs and numbers, continued 378
1G.9 Rings and semirings 381
lG.lOFeasibility of sets 384
1G.11 Visual interpretations
lG.12Codings and sets
lG.130ther operations
lG.14Simulatioiis and conversions 395
lG.laSums and visibility graphs 397
1G.16 Back to formal proofs
389
390
392
399
404
17.1 Cay ley graphs and the word metric 404
17.2 Pause for some definitions
CONTENTS xvii
17.3 The Heisenberg groups 408
17.4 Geometry of Heisenberg groups 413
17.5 Automatic groups 418
17.6 Automatic structures for graphs 420
17.7 Between Cayley graphs and graphs in general 430
17.8 Scales and paths 430
17.9 Connections between scales and paths 431
17.10The Mellow traveller property 434
18 Extended notions of automata 436
18.1 Asynchronous automata 437
18.2 Heisenberg groups 440
18.3 Expanding automata 441
18.4 Tapes that cross 445
19 Geometry of scales in metric spaces 449
19.1 Metric spaces and length spaces 449
19.2 Discretizations of metric spaces 451
19.3 The scale-geometry graph 456
19.4 Conditions of bounded geometry 458
19.5 Automatic structures 460
19.6 Making choices 461
19.7 A geometric caveat 463
19.8 The doubling condition 464
20 The Corona decomposition revisited 465
20.1 Interesting paths 465
20.2 Reduced graphs 467
20.3 Crisp paths 470
20.4 A weak mapping between visibilities 473
20.5 Injectivity properties of the weak mapping 476
20.6 Bounds 477
Appendix
A Formal proofs: A brief review 480
A.l Sequent calculus 480
A.2 Cut elimination 483
A.3 The logical flow graph 484
References 4^
Index 496
|
| any_adam_object | 1 |
| author | Carbone, Alessandra Semmes, Stephen |
| author_facet | Carbone, Alessandra Semmes, Stephen |
| author_role | aut aut |
| author_sort | Carbone, Alessandra |
| author_variant | a c ac s s ss |
| building | Verbundindex |
| bvnumber | BV019821770 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 SK 890 |
| ctrlnum | (OCoLC)44313374 (DE-599)BVBBV019821770 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1. publ. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01768nam a2200493 c 4500</leader><controlfield tag="001">BV019821770</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050525s2000 |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">0042739</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0198507291</subfield><subfield code="9">0-19-850729-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)44313374</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019821770</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Carbone, Alessandra</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A graphic apology for symmetry and implicitness</subfield><subfield code="c">Alessandra Carbone and Stephen Semmes</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Oxford [u.a.]</subfield><subfield code="b">Oxford Univ. Press</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 501 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Oxford mathematical monographs</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. [487]-495) and index</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Group theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Gruppentheorie</subfield><subfield code="0">(DE-588)4072157-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Semmes, Stephen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013147030&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013147030</subfield></datafield></record></collection> |
| id | DE-604.BV019821770 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T20:06:55Z |
| institution | BVB |
| isbn | 0198507291 |
| language | English |
| lccn | 0042739 |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013147030 |
| oclc_num | 44313374 |
| open_access_boolean | |
| owner | DE-29T DE-11 |
| owner_facet | DE-29T DE-11 |
| physical | XVII, 501 S. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Oxford Univ. Press |
| record_format | marc |
| series2 | Oxford mathematical monographs |
| spelling | Carbone, Alessandra Verfasser aut A graphic apology for symmetry and implicitness Alessandra Carbone and Stephen Semmes 1. publ. Oxford [u.a.] Oxford Univ. Press 2000 XVII, 501 S. txt rdacontent n rdamedia nc rdacarrier Oxford mathematical monographs Includes bibliographical references (p. [487]-495) and index Computational complexity Graph theory Group theory Machine theory Gruppentheorie (DE-588)4072157-7 gnd rswk-swf Graphentheorie (DE-588)4113782-6 gnd rswk-swf Graphentheorie (DE-588)4113782-6 s DE-604 Gruppentheorie (DE-588)4072157-7 s Semmes, Stephen Verfasser aut HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013147030&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Carbone, Alessandra Semmes, Stephen A graphic apology for symmetry and implicitness Computational complexity Graph theory Group theory Machine theory Gruppentheorie (DE-588)4072157-7 gnd Graphentheorie (DE-588)4113782-6 gnd |
| subject_GND | (DE-588)4072157-7 (DE-588)4113782-6 |
| title | A graphic apology for symmetry and implicitness |
| title_auth | A graphic apology for symmetry and implicitness |
| title_exact_search | A graphic apology for symmetry and implicitness |
| title_full | A graphic apology for symmetry and implicitness Alessandra Carbone and Stephen Semmes |
| title_fullStr | A graphic apology for symmetry and implicitness Alessandra Carbone and Stephen Semmes |
| title_full_unstemmed | A graphic apology for symmetry and implicitness Alessandra Carbone and Stephen Semmes |
| title_short | A graphic apology for symmetry and implicitness |
| title_sort | a graphic apology for symmetry and implicitness |
| topic | Computational complexity Graph theory Group theory Machine theory Gruppentheorie (DE-588)4072157-7 gnd Graphentheorie (DE-588)4113782-6 gnd |
| topic_facet | Computational complexity Graph theory Group theory Machine theory Gruppentheorie Graphentheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=013147030&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT carbonealessandra agraphicapologyforsymmetryandimplicitness AT semmesstephen agraphicapologyforsymmetryandimplicitness |