نتایج جستجو برای: lattice of subgroups
تعداد نتایج: 21178448 فیلتر نتایج به سال:
Measure rigidity for the action of maximal horospherical subgroups on homogeneous spaces over a field of positive characteristic is proved. In the case when the lattice is uniform we prove the action of any horospherical subgroup is uniquely ergodic.
in this paper, we define the notions of fuzzy congruence relations and fuzzy convex subalgebras on a commutative residuated lattice and we obtain some related results. in particular, we will show that there exists a one to one correspondence between the set of all fuzzy congruence relations and the set of all fuzzy convex subalgebras on a commutative residuated lattice. then we study fuzzy...
Exercise 1 (Maximal compact subgroups of G). A lattice in Qp is a finitelygenerated Zp-submodule of Qp that generates Qp as vector space. In particular, it’s free of rank n. Note that G acts transitively on the set of lattices in Qp . (i) Show that K = StabG(Zp ). (ii) Suppose that K ′ is a compact subgroup of G. Show that K ′ stabilises a lattice. (Hint: show that the K ′-orbit of Zp is finite...
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF (q). When q is prime, we prove that Gn(q) is equal to the number Ln(q) of n-dimensional mod q lattices, which are defined to be lattices (that is, discrete additive subgroups of n-space) contained in the integer lattice Z and having the property that given any point P in t...
We study the lattice of finite-index extensions of a given finitely generated subgroup H of a free group F . This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of H . This characterization leads to a fast algorithm to compute the commensurator, which is based on a standard algorithm from automata theory. We also give a sub-exp...
We study the lattice of finite-index extensions of a given finitely generated subgroup H of a free group F . This lattice is finite and we give a combinatorial characterization of its greatest element, which is the commensurator of H . This characterization leads to a fast algorithm to compute the commensurator, which is based on a standard algorithm from automata theory. We also give a sub-exp...
We examine the relation between twisted versions of the extended supersymmetric gauge theories and supersymmetric orbifold lattices. In particular, for the N = 4 SYM in d = 4, we show that the continuum limit of orbifold lattice reproduces the twist introduced by Marcus, and the examples at lower dimensions are usually Blau-Thompson type. The orbifold lattice point group symmetry is a subgroup ...
A theorem by Zacher and Rips states that the finiteness of the index of a subgroup can be described in terms of purely lattice-theoretic concepts. On the other hand, it is clear that if G is a group and H is a subgroup of finite index of G, the index |G : H| cannot be recognized in the lattice L(G) of all subgroups of G, as for instance all groups of prime order have isomorphic subgroup lattice...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید