Matches in SemOpenAlex for { <https://semopenalex.org/work/W2040301676> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2040301676 endingPage "23" @default.
- W2040301676 startingPage "1" @default.
- W2040301676 abstract "is finite, and a uniform X-lattice if ΓX is a finite graph, non-uniform otherwise. In [C2] and [BCR] we gave the necessary and sufficient conditions for the existence of X-lattices. In this work we determine how to construct pairs of tree lattice subgroups. In the setting of topological covering theory, there is a correspondence between coverings, p : X → A, and subgroups of π1(A), and this gives essentially ‘one’ subgroup up to conjugacy. Here with lattices given by their quotient graphs of groups, we are in an ‘orbifold’ setting where coverings have an extra ingredient, namely isotropy groups. We make use of this additional data to construct lattice subgroups by using subgroups of isotropy (vertex) groups. This will give rise to zero, one, finitely many, or infinitely many possible subgroups up to isomorphism. In fact in [CR1] the authors exhibited infinite ascending chain of lattice subgroups, all with the same quotient graph. We describe several methods (sections 3-5) for constructing a pair of Xlattices (Γ′,Γ) with Γ ≤ Γ′, starting from ‘edge-indexed graphs’ (A′, i′) and (A, i) which will correspond to the edge-indexed quotient graphs of their (common) universal covering tree by Γ′ and Γ respectively. Our techniques are a combination of topological graph theory, covering theory for graphs of groups ([B]), and covering theory for edge-indexed graphs developed in [C1] and [BCR]. As an application, we show (section 5) that a nonuniform X-lattice Γ contains an infinite chain of subgroups Λ1 < Λ2 < Λ3 < . . . where each Λk is a uniform Xj-lattice, Xk a subtree of X. Let φ : (A, i) → (A′, i′) be a covering of edge-indexed graphs (defined in section 2). We wish to determine if it is possible to extend φ to a covering" @default.
- W2040301676 created "2016-06-24" @default.
- W2040301676 creator A5066964597 @default.
- W2040301676 creator A5081949204 @default.
- W2040301676 creator A5022533031 @default.
- W2040301676 date "2011-01-01" @default.
- W2040301676 modified "2023-09-27" @default.
- W2040301676 title "Tree lattice subgroups" @default.
- W2040301676 cites W1986009900 @default.
- W2040301676 cites W1992703531 @default.
- W2040301676 cites W2040960421 @default.
- W2040301676 cites W2059230795 @default.
- W2040301676 cites W2809113709 @default.
- W2040301676 cites W2022826041 @default.
- W2040301676 doi "https://doi.org/10.1515/gcc.2011.001" @default.
- W2040301676 hasPublicationYear "2011" @default.
- W2040301676 type Work @default.
- W2040301676 sameAs 2040301676 @default.
- W2040301676 citedByCount "0" @default.
- W2040301676 crossrefType "journal-article" @default.
- W2040301676 hasAuthorship W2040301676A5022533031 @default.
- W2040301676 hasAuthorship W2040301676A5066964597 @default.
- W2040301676 hasAuthorship W2040301676A5081949204 @default.
- W2040301676 hasConcept C114614502 @default.
- W2040301676 hasConcept C118615104 @default.
- W2040301676 hasConcept C121332964 @default.
- W2040301676 hasConcept C132525143 @default.
- W2040301676 hasConcept C136170076 @default.
- W2040301676 hasConcept C143782950 @default.
- W2040301676 hasConcept C199422724 @default.
- W2040301676 hasConcept C202444582 @default.
- W2040301676 hasConcept C20725272 @default.
- W2040301676 hasConcept C24890656 @default.
- W2040301676 hasConcept C2781204021 @default.
- W2040301676 hasConcept C33923547 @default.
- W2040301676 hasConcept C80899671 @default.
- W2040301676 hasConcept C95627345 @default.
- W2040301676 hasConceptScore W2040301676C114614502 @default.
- W2040301676 hasConceptScore W2040301676C118615104 @default.
- W2040301676 hasConceptScore W2040301676C121332964 @default.
- W2040301676 hasConceptScore W2040301676C132525143 @default.
- W2040301676 hasConceptScore W2040301676C136170076 @default.
- W2040301676 hasConceptScore W2040301676C143782950 @default.
- W2040301676 hasConceptScore W2040301676C199422724 @default.
- W2040301676 hasConceptScore W2040301676C202444582 @default.
- W2040301676 hasConceptScore W2040301676C20725272 @default.
- W2040301676 hasConceptScore W2040301676C24890656 @default.
- W2040301676 hasConceptScore W2040301676C2781204021 @default.
- W2040301676 hasConceptScore W2040301676C33923547 @default.
- W2040301676 hasConceptScore W2040301676C80899671 @default.
- W2040301676 hasConceptScore W2040301676C95627345 @default.
- W2040301676 hasIssue "3" @default.
- W2040301676 hasLocation W20403016761 @default.
- W2040301676 hasOpenAccess W2040301676 @default.
- W2040301676 hasPrimaryLocation W20403016761 @default.
- W2040301676 hasRelatedWork W1768992667 @default.
- W2040301676 hasRelatedWork W181878848 @default.
- W2040301676 hasRelatedWork W1942887994 @default.
- W2040301676 hasRelatedWork W1994957743 @default.
- W2040301676 hasRelatedWork W2008440715 @default.
- W2040301676 hasRelatedWork W2073668070 @default.
- W2040301676 hasRelatedWork W2141042941 @default.
- W2040301676 hasRelatedWork W2152407290 @default.
- W2040301676 hasRelatedWork W2584667673 @default.
- W2040301676 hasRelatedWork W2598199642 @default.
- W2040301676 hasRelatedWork W2765824231 @default.
- W2040301676 hasRelatedWork W2810278013 @default.
- W2040301676 hasRelatedWork W294731568 @default.
- W2040301676 hasRelatedWork W2962948553 @default.
- W2040301676 hasRelatedWork W2967415798 @default.
- W2040301676 hasRelatedWork W3106212406 @default.
- W2040301676 hasRelatedWork W3196392487 @default.
- W2040301676 hasRelatedWork W611999914 @default.
- W2040301676 hasRelatedWork W68609794 @default.
- W2040301676 hasRelatedWork W2182125664 @default.
- W2040301676 hasVolume "3" @default.
- W2040301676 isParatext "false" @default.
- W2040301676 isRetracted "false" @default.
- W2040301676 magId "2040301676" @default.
- W2040301676 workType "article" @default.