LEADER 03572nam  2200577   450 
001 9910480939103321
005 20170816143254.0
010   $a1-4704-0317-X
035   $a(CKB)3360000000464908
035   $a(EBL)3114380
035   $a(SSID)ssj0000973403
035   $a(PQKBManifestationID)11616159
035   $a(PQKBTitleCode)TC0000973403
035   $a(PQKBWorkID)10961183
035   $a(PQKB)11241104
035   $a(MiAaPQ)EBC3114380
035   $a(PPN)195416104
035   $a(EXLCZ)993360000000464908
100   $a20010320d2001      uy|            0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aNon-uniform lattices on uniform trees /$fLisa Carbone
210  1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d2001.
215   $a1 online resource (146 p.)
225 1 $aMemoirs of the American Mathematical Society,$x0065-9266 ;$vnumber 724
300   $a"July 2001, volume 152, number 724 (end of volume)."
311   $a0-8218-2721-9 
320   $aIncludes bibliographical references.
327   $a""Contents""; ""0. Introduction""; ""1. Graphs of groups, tree actions and edge-indexed graphs""; ""1.1 Graphs of groups""; ""1.2 Group actions on trees and quotient graphs of groups""; ""1.3 Edge-indexed graphs and their groupings""; ""1.4 Existence of finite groupings""; ""2. Aut(X) and its discrete subgroups""; ""2.1 Tree lattices""; ""2.2 The group G[sub(H)] of deck transformations""; ""2.3 Constructing tree lattices""; ""3. Existence of tree lattices""; ""3.1 Locally compact groups and their lattices""; ""3.2 Lattice Existence Theorem""
327   $a""3.3 Existence of non-uniform lattices on uniform trees""""3.4 Existence of non-uniform coverings""; ""4. Non-uniform coverings of indexed graphs with an arithmetic bridge""; ""4.1 Geometric and arithmetic bridges in indexed graphs""; ""4.2 Changing the ramification factor of an arithmetic bridge""; ""4.3 Gluing unimodular subgraphs along connected intersections""; ""4.4 Open fanning of arithmetic bridges""; ""4.5 Indexed topological coverings""; ""4.6 Step 1 - Schematic diagram""; ""4.7 Step 2 - Construct topological covering""; ""4.8 Step 3 - Change the ramification factor""
327   $a""4.9 Step 4 - Construct rectangles""""4.10 Step 5 - Glue rectangles iteratively""; ""4.11 Step 6 - Adjoin bridges""; ""4.12 Step 7 - Multiple open fanning""; ""4.13 Edge with a common factor implies non-uniform covering""; ""5. Non-uniform coverings of indexed graphs with a separating edge""; ""6. Non-uniform coverings of indexed graphs with a ramified loop""; ""7. Eliminating multiple edges""; ""7.1 Simplification of a graph with no loops""; ""7.2 Graphs with multiplicities""; ""7.3 Reduced factorization of an indexed graph""
327   $a""7.4 Canonical simplification of a unimodular indexed graph with no loops""""8. Existence of arithmetic bridges""; ""8.1 Unramified Loops""; ""8.2 Completion""; ""8.3 Suspension""; ""8.4 Restriction""; ""Bibliography""
410  0$aMemoirs of the American Mathematical Society ;$vno. 724.
606   $aLattice theory
606   $aTrees (Graph theory)
608   $aElectronic books.
615  0$aLattice theory.
615  0$aTrees (Graph theory)
676   $a510 s
676   $a511.3/3
700   $aCarbone$b Lisa$f1965-$0992144
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910480939103321
996   $aNon-uniform lattices on uniform trees$92271196
997   $aUNINA